{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"omni-math","formal_name":"Omni-MATH","introduction":"Omni-MATH evaluates mathematical reasoning on Olympiad-level problems. Its official dataset contains 4,428 problems accompanied by domain and difficulty information.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","indexing_mode":"index","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[],"history":"","construction":"","limitations":"","saturation":"","scores":[]}},"task_id":"cbba85cb-5685-5dfa-aa55-18a6bd16f598","task_key":"test--cbba85cb-5685-5dfa-aa55-18a6bd16f598","task_revision_id":"1","upstream_id":"","short_description":"Determine the smallest positive integer $ n$ such that there exists positive…","config":"","split":"test","body":"{\"problem\":\"Determine the smallest positive integer $ n$ such that there exists positive integers $ a_1,a_2,\\\\cdots,a_n$, that smaller than or equal to $ 15$ and are not necessarily distinct, such that the last four digits of the sum,\\n\\n\\\\[ a_1!\\\\plus{}a_2!\\\\plus{}\\\\cdots\\\\plus{}a_n!\\\\]\\n\\nIs $ 2001$.\"}","display_format":"math","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}