{"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":"0601efe3-460f-5bf6-81ce-e1bc5f5ccc26","task_key":"test--0601efe3-460f-5bf6-81ce-e1bc5f5ccc26","task_revision_id":"1","upstream_id":"","short_description":"Let $x_{1}=y_{1}=x_{2}=y_{2}=1$, then for $n \\geq 3$ let $x_{n}=x_{n-1}…","config":"","split":"test","body":"{\"problem\":\"Let $x_{1}=y_{1}=x_{2}=y_{2}=1$, then for $n \\\\geq 3$ let $x_{n}=x_{n-1} y_{n-2}+x_{n-2} y_{n-1}$ and $y_{n}=y_{n-1} y_{n-2}- x_{n-1} x_{n-2}$. What are the last two digits of $\\\\left|x_{2012}\\\\right|$ ?\"}","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":[]}