{"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":"f4ff7521-fcf9-5a2b-a90e-a4b69a51bd30","task_key":"test--f4ff7521-fcf9-5a2b-a90e-a4b69a51bd30","task_revision_id":"1","upstream_id":"","short_description":"Define the sequence \\left\\{x_{i}\\right\\}_{i \\geq 0} by $x_{0}=x_{1}=x_{2}=1$ and…","config":"","split":"test","body":"{\"problem\":\"Define the sequence \\\\left\\\\{x_{i}\\\\right\\\\}_{i \\\\geq 0} by $x_{0}=x_{1}=x_{2}=1$ and $x_{k}=\\\\frac{x_{k-1}+x_{k-2}+1}{x_{k-3}}$ for $k>2$. Find $x_{2013}$.\"}","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":[]}