{"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":"88f9f270-6a5c-54ca-b111-bc56ccbd978a","task_key":"test--88f9f270-6a5c-54ca-b111-bc56ccbd978a","task_revision_id":"1","upstream_id":"","short_description":"Define a power cycle to be a set $S$ consisting of the nonnegative integer…","config":"","split":"test","body":"{\"problem\":\"Define a power cycle to be a set $S$ consisting of the nonnegative integer powers of an integer $a$, i.e. $S=\\\\left\\\\{1, a, a^{2}, \\\\ldots\\\\right\\\\}$ for some integer $a$. What is the minimum number of power cycles required such that given any odd integer $n$, there exists some integer $k$ in one of the power cycles such that $n \\\\equiv k$ $(\\\\bmod 1024) ?$\"}","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":[]}