{"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":"57cc79d7-ad93-54ec-b3bf-0ba395cc28a8","task_key":"test--57cc79d7-ad93-54ec-b3bf-0ba395cc28a8","task_revision_id":"1","upstream_id":"","short_description":"A sequence of positive integers $a_{1}, a_{2}, a_{3}, \\ldots$ satisfies…","config":"","split":"test","body":"{\"problem\":\"A sequence of positive integers $a_{1}, a_{2}, a_{3}, \\\\ldots$ satisfies $$a_{n+1}=n\\\\left\\\\lfloor\\\\frac{a_{n}}{n}\\\\right\\\\rfloor+1$$ for all positive integers $n$. If $a_{30}=30$, how many possible values can $a_{1}$ take? (For a real number $x$, $\\\\lfloor x\\\\rfloor$ denotes the largest integer that is not greater than $x$.)\"}","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":[]}