{"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":"19a37311-eca0-5fd7-adac-e5c1deba0939","task_key":"test--19a37311-eca0-5fd7-adac-e5c1deba0939","task_revision_id":"1","upstream_id":"","short_description":"Determine the greatest positive integer $k$ that satisfies the following…","config":"","split":"test","body":"{\"problem\":\"Determine the greatest positive integer $k$ that satisfies the following property: The set of positive integers can be partitioned into $k$ subsets $A_1, A_2, \\\\ldots, A_k$ such that for all integers $n \\\\geq 15$ and all $i \\\\in \\\\{1, 2, \\\\ldots, k\\\\}$ there exist two distinct elements of $A_i$ whose sum is $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":[]}