{"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":"96840a8f-c434-55fd-9626-06a2d090805f","task_key":"test--96840a8f-c434-55fd-9626-06a2d090805f","task_revision_id":"1","upstream_id":"","short_description":"Let $\\mathbb{N}$ be the set of positive integers, and let $f: \\mathbb{N}…","config":"","split":"test","body":"{\"problem\":\"Let $\\\\mathbb{N}$ be the set of positive integers, and let $f: \\\\mathbb{N} \\\\rightarrow \\\\mathbb{N}$ be a function satisfying $f(1)=1$ and for $n \\\\in \\\\mathbb{N}, f(2 n)=2 f(n)$ and $f(2 n+1)=2 f(n)-1$. Determine the sum of all positive integer solutions to $f(x)=19$ that do not exceed 2019.\"}","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":[]}