{"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":"d80cf1eb-9d87-5f9b-8709-8abb3e0ff3ec","task_key":"test--d80cf1eb-9d87-5f9b-8709-8abb3e0ff3ec","task_revision_id":"1","upstream_id":"","short_description":"Let $g:[0,1]\\rightarrow \\mathbb{R}$ be a continuous function and let…","config":"","split":"test","body":"{\"problem\":\"Let $g:[0,1]\\\\rightarrow \\\\mathbb{R}$ be a continuous function and let $f_{n}:[0,1]\\\\rightarrow \\\\mathbb{R}$ be a \\nsequence of functions defined by $f_{0}(x)=g(x)$ and\\n$$f_{n+1}(x)=\\\\frac{1}{x}\\\\int_{0}^{x}f_{n}(t)dt.$$\\nDetermine $\\\\lim_{n\\\\to \\\\infty}f_{n}(x)$ for every $x\\\\in (0,1]$.\"}","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":[]}