{"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":"efc6b385-2822-50e8-9366-88561a7a4c66","task_key":"test--efc6b385-2822-50e8-9366-88561a7a4c66","task_revision_id":"1","upstream_id":"","short_description":"Let $a_{0}=-2, b_{0}=1$, and for $n \\geq 0$, let $$\\begin{aligned} &…","config":"","split":"test","body":"{\"problem\":\"Let $a_{0}=-2, b_{0}=1$, and for $n \\\\geq 0$, let $$\\\\begin{aligned} & a_{n+1}=a_{n}+b_{n}+\\\\sqrt{a_{n}^{2}+b_{n}^{2}} \\\\\\\\ & b_{n+1}=a_{n}+b_{n}-\\\\sqrt{a_{n}^{2}+b_{n}^{2}} \\\\end{aligned}$$ Find $a_{2012}$.\"}","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":[]}