{"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":"3bd30c80-bf8e-564e-9adf-b456954c98dd","task_key":"test--3bd30c80-bf8e-564e-9adf-b456954c98dd","task_revision_id":"1","upstream_id":"","short_description":"Determine all integers $ n\\geq 2$ having the following property: for any…","config":"","split":"test","body":"{\"problem\":\"Determine all integers $ n\\\\geq 2$ having the following property: for any integers $a_1,a_2,\\\\ldots, a_n$ whose sum is not divisible by $n$, there exists an index $1 \\\\leq i \\\\leq n$ such that none of the numbers $$a_i,a_i+a_{i+1},\\\\ldots,a_i+a_{i+1}+\\\\ldots+a_{i+n-1}$$ is divisible by $n$. Here, we let $a_i=a_{i-n}$ when $i >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":[]}