{"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":"968eba26-113e-5439-bb5c-83cd9508927c","task_key":"test--968eba26-113e-5439-bb5c-83cd9508927c","task_revision_id":"1","upstream_id":"","short_description":"Let $n \\ge 2$ be an integer, and let $A_n$ be the set \\[A_n = \\{2^n - 2^k\\mid k…","config":"","split":"test","body":"{\"problem\":\"Let $n \\\\ge 2$ be an integer, and let $A_n$ be the set \\\\[A_n = \\\\{2^n  - 2^k\\\\mid k \\\\in \\\\mathbb{Z},\\\\, 0 \\\\le k < n\\\\}.\\\\] Determine the largest positive integer that cannot be written as the sum of one or more (not necessarily distinct) elements of $A_n$ .\\n\\n[i]\"}","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":[]}