{"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":"a4359773-a7f6-5dff-86c4-6badf97fa2cc","task_key":"test--a4359773-a7f6-5dff-86c4-6badf97fa2cc","task_revision_id":"1","upstream_id":"","short_description":"For any positive integer $n$, let $f(n)$ denote the number of 1's in the base-2…","config":"","split":"test","body":"{\"problem\":\"For any positive integer $n$, let $f(n)$ denote the number of 1's in the base-2 representation of $n$. For how many values of $n$ with $1 \\\\leq n \\\\leq 2002$ do we have $f(n)=f(n+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":[]}