{"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":"a8c55025-23ba-5818-8a17-4dac8d6de428","task_key":"test--a8c55025-23ba-5818-8a17-4dac8d6de428","task_revision_id":"1","upstream_id":"","short_description":"Determine all integers $n\\geqslant 2$ with the following property: every $n$…","config":"","split":"test","body":"{\"problem\":\"Determine all integers $n\\\\geqslant 2$ with the following property: every $n$ pairwise distinct integers whose sum is not divisible by $n$ can be arranged in some order $a_1,a_2,\\\\ldots, a_n$ so that $n$ divides $1\\\\cdot a_1+2\\\\cdot a_2+\\\\cdots+n\\\\cdot a_n.$\\n\\n[i]Arsenii Nikolaiev, Anton Trygub, Oleksii Masalitin, and Fedir Yudin[/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":[]}