{"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":"9775157c-4f13-5337-8f4a-83c5d2a0c4a0","task_key":"test--9775157c-4f13-5337-8f4a-83c5d2a0c4a0","task_revision_id":"1","upstream_id":"","short_description":"Let $n>1$ be an integer. For each numbers $(x_1, x_2,\\dots, x_n)$ with…","config":"","split":"test","body":"{\"problem\":\"Let $n>1$ be an integer. For each numbers $(x_1, x_2,\\\\dots, x_n)$ with $x_1^2+x_2^2+x_3^2+\\\\dots +x_n^2=1$, denote\\n$m=\\\\min\\\\{|x_i-x_j|, 0<i<j<n+1\\\\}$\\nFind the maximum value of $m$.\"}","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":[]}