{"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":"76a3fda3-bdd8-5454-b01f-ce09b375fece","task_key":"test--76a3fda3-bdd8-5454-b01f-ce09b375fece","task_revision_id":"1","upstream_id":"","short_description":"Let $n$ to be a positive integer. Given a set $\\{ a_1, a_2, \\ldots, a_n \\} $ of…","config":"","split":"test","body":"{\"problem\":\"Let $n$ to be a positive integer. Given a set $\\\\{ a_1, a_2, \\\\ldots, a_n \\\\} $ of integers, where $a_i \\\\in \\\\{ 0, 1, 2, 3, \\\\ldots, 2^n -1 \\\\},$ $\\\\forall i$, we associate to each of its subsets the sum of its elements; particularly, the empty subset has sum of its elements equal to $0$. If all of these sums have different remainders when divided by $2^n$, we say that $\\\\{ a_1, a_2, \\\\ldots, a_n \\\\} $ is [i]$n$-complete[/i].\\n\\nFor each $n$, find the number of [i]$n$-complete[/i] sets.\"}","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":[]}