{"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":"770c7436-7e5b-5746-9524-16b78b6b192d","task_key":"test--770c7436-7e5b-5746-9524-16b78b6b192d","task_revision_id":"1","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: (a) $f(1)=1$ (b) $f(a) \\\\leq f(b)$ whenever $a$ and $b$ are positive integers with $a \\\\leq b$. (c) $f(2a)=f(a)+1$ for all positive integers $a$. How many possible values can the 2014-tuple $(f(1), f(2), \\\\ldots, f(2014))$ take?\"}","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":[]}