{"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":"e3c455eb-7858-50a3-95ac-41695c781bcf","task_key":"test--e3c455eb-7858-50a3-95ac-41695c781bcf","task_revision_id":"4","upstream_id":"","short_description":"Determine the greatest real number $ C $, such that for every positive integer $…","config":"","split":"test","body":"{\"problem\":\"Determine the greatest real number $ C $, such that for every positive integer $ n\\\\ge 2 $, there exists $ x_1, x_2,..., x_n  \\\\in [-1,1]$, so that\\n$$\\\\prod_{1\\\\le i<j\\\\le n}(x_i-x_j) \\\\ge C^{\\\\frac{n(n-1)}{2}}$$.\"}","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":[]}