{"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":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"4ce9cf4d-368a-5c5d-b57d-bd11d0dbd20d","task_key":"test--4ce9cf4d-368a-5c5d-b57d-bd11d0dbd20d","task_revision_id":"3","upstream_id":"","short_description":"Find all natural numbers $n (n \\geq 2)$ such that there exists reals $a_1, a_2,…","config":"","split":"test","body":"{\"problem\":\"Find all natural numbers $n (n \\\\geq 2)$ such that there exists reals $a_1, a_2, \\\\dots, a_n$ which satisfy \\\\[ \\\\{ |a_i - a_j| \\\\mid 1\\\\leq i<j \\\\leq n\\\\} = \\\\left\\\\{1,2,\\\\dots,\\\\frac{n(n-1)}{2}\\\\right\\\\}. \\\\]\\r\\n\\r\\nLet $A=\\\\{1,2,3,4,5,6\\\\}, B=\\\\{7,8,9,\\\\dots,n\\\\}$. $A_i(i=1,2,\\\\dots,20)$ contains eight numbers, three of which are chosen from $A$ and the other five numbers from $B$. $|A_i \\\\cap A_j|\\\\leq 2, 1\\\\leq i<j\\\\leq 20$. Find the minimum possible value of $n$.\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}