{"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":"14ad5c9b-6dda-53c0-83c0-62a911fb1fc5","task_key":"test--14ad5c9b-6dda-53c0-83c0-62a911fb1fc5","task_revision_id":"1","upstream_id":"","short_description":"Determine all sequences $a_{0}, a_{1}, a_{2}, \\ldots$ of positive integers with…","config":"","split":"test","body":"{\"problem\":\"Determine all sequences $a_{0}, a_{1}, a_{2}, \\\\ldots$ of positive integers with $a_{0} \\\\geq 2015$ such that for all integers $n \\\\geq 1$ : (i) $a_{n+2}$ is divisible by $a_{n}$; (ii) $\\\\left|s_{n+1}-(n+1) a_{n}\\\\right|=1$, where $s_{n+1}=a_{n+1}-a_{n}+a_{n-1}-\\\\cdots+(-1)^{n+1} a_{0}$.\"}","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":[]}