{"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":"1dcd1d6b-a7c8-5e90-913e-66aad3abca34","task_key":"test--1dcd1d6b-a7c8-5e90-913e-66aad3abca34","task_revision_id":"1","upstream_id":"","short_description":"A positive integer is called fancy if it can be expressed in the form…","config":"","split":"test","body":"{\"problem\":\"A positive integer is called fancy if it can be expressed in the form $$2^{a_{1}}+2^{a_{2}}+\\\\cdots+2^{a_{100}}$$ where $a_{1}, a_{2}, \\\\ldots, a_{100}$ are non-negative integers that are not necessarily distinct. Find the smallest positive integer $n$ such that no multiple of $n$ is a fancy number.\"}","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":[]}