{"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":"2f11bda5-4349-5b41-b605-c29628d16eda","task_key":"test--2f11bda5-4349-5b41-b605-c29628d16eda","task_revision_id":"1","upstream_id":"","short_description":"For each integer $a_0 > 1$, define the sequence $a_0, a_1, a_2, \\ldots$ for $n…","config":"","split":"test","body":"{\"problem\":\"For each integer $a_0 > 1$, define the sequence $a_0, a_1, a_2, \\\\ldots$ for $n \\\\geq 0$ as\\n$$a_{n+1} = \\n\\\\begin{cases}\\n\\\\sqrt{a_n} & \\\\text{if } \\\\sqrt{a_n} \\\\text{ is an integer,} \\\\\\\\\\na_n + 3 & \\\\text{otherwise.}\\n\\\\end{cases}\\n$$\\nDetermine all values of $a_0$ such that there exists a number $A$ such that $a_n = A$ for infinitely many values of $n$.\\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":[]}