{"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":"0f68fd40-551f-552e-bcb4-fb6e82c86338","task_key":"test--0f68fd40-551f-552e-bcb4-fb6e82c86338","task_revision_id":"1","upstream_id":"","short_description":"Consider a sequence $x_{n}$ such that $x_{1}=x_{2}=1, x_{3}=\\frac{2}{3}$.…","config":"","split":"test","body":"{\"problem\":\"Consider a sequence $x_{n}$ such that $x_{1}=x_{2}=1, x_{3}=\\\\frac{2}{3}$. Suppose that $x_{n}=\\\\frac{x_{n-1}^{2} x_{n-2}}{2 x_{n-2}^{2}-x_{n-1} x_{n-3}}$ for all $n \\\\geq 4$. Find the least $n$ such that $x_{n} \\\\leq \\\\frac{1}{10^{6}}$.\"}","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":[]}