{"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":"d3206404-0144-524a-81dc-d278cb810a5d","task_key":"test--d3206404-0144-524a-81dc-d278cb810a5d","task_revision_id":"1","upstream_id":"","short_description":"A sequence is defined by $A_{0}=0, A_{1}=1, A_{2}=2$, and, for integers $n \\geq…","config":"","split":"test","body":"{\"problem\":\"A sequence is defined by $A_{0}=0, A_{1}=1, A_{2}=2$, and, for integers $n \\\\geq 3$, $$A_{n}=\\\\frac{A_{n-1}+A_{n-2}+A_{n-3}}{3}+\\\\frac{1}{n^{4}-n^{2}}$$ Compute $\\\\lim _{N \\\\rightarrow \\\\infty} A_{N}$.\"}","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":[]}