{"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":"ea2775e5-fb1c-5b92-ae44-007bd7420126","task_key":"test--ea2775e5-fb1c-5b92-ae44-007bd7420126","task_revision_id":"1","upstream_id":"","short_description":"Let $\\mathbb{N} = \\{1,2,3, \\ldots\\}$. Determine if there exists a strictly…","config":"","split":"test","body":"{\"problem\":\"Let $\\\\mathbb{N} = \\\\{1,2,3, \\\\ldots\\\\}$. Determine if there exists a strictly increasing function $f: \\\\mathbb{N} \\\\mapsto \\\\mathbb{N}$ with the following properties:\\n\\n(i) $f(1) = 2$;\\n\\n(ii) $f(f(n)) = f(n) + n, (n \\\\in \\\\mathbb{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":[]}