{"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":"c478ba74-45d4-50c8-862a-778f0238bdf7","task_key":"test--c478ba74-45d4-50c8-862a-778f0238bdf7","task_revision_id":"1","upstream_id":"","short_description":"Find the least positive integer $n$ for which there exists a set $\\{s_1, s_2,…","config":"","split":"test","body":"{\"problem\":\"Find the least positive integer $n$ for which there exists a set $\\\\{s_1, s_2, \\\\ldots , s_n\\\\}$ consisting of $n$ distinct positive integers such that\\n\\\\[ \\\\left( 1 - \\\\frac{1}{s_1} \\\\right) \\\\left( 1 - \\\\frac{1}{s_2} \\\\right) \\\\cdots \\\\left( 1 - \\\\frac{1}{s_n} \\\\right) = \\\\frac{51}{2010}.\\\\]\\n\\n[i]\"}","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":[]}