{"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":"638246c9-7d4c-50fb-8a29-0c0d6d2a91ce","task_key":"test--638246c9-7d4c-50fb-8a29-0c0d6d2a91ce","task_revision_id":"1","upstream_id":"","short_description":"Find all positive integers $n$ such that there exists a sequence of positive…","config":"","split":"test","body":"{\"problem\":\"Find all positive integers $n$ such that there exists a sequence of positive integers $a_1$, $a_2$,$\\\\ldots$, $a_n$ satisfying: \\\\[a_{k+1}=\\\\frac{a_k^2+1}{a_{k-1}+1}-1\\\\] for every $k$ with $2\\\\leq k\\\\leq n-1$.\\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":[]}