{"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":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"13d65ac7-0bf0-571a-b0a6-b73b2e6f1df0","task_key":"test--13d65ac7-0bf0-571a-b0a6-b73b2e6f1df0","task_revision_id":"2","upstream_id":"","short_description":"Let $f: \\mathbb{N} \\rightarrow \\mathbb{N}$ be a function satisfying the…","config":"","split":"test","body":"{\"problem\":\"Let $f: \\\\mathbb{N} \\\\rightarrow \\\\mathbb{N}$ be a function satisfying the following conditions:\\n(1) $f(1)=1$;\\n(2) $\\\\forall n\\\\in \\\\mathbb{N}$, $3f(n) f(2n+1) =f(2n) ( 1+3f(n) )$;\\n(3) $\\\\forall n\\\\in \\\\mathbb{N}$, $f(2n) < 6 f(n)$.\\nFind all solutions of equation $f(k) +f(l)=293$, where $k<l$.\\n($\\\\mathbb{N}$ denotes the set of all natural numbers).\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}