{"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":"ebc17199-82d2-5ee9-804f-31fd5d3842f2","task_key":"test--ebc17199-82d2-5ee9-804f-31fd5d3842f2","task_revision_id":"1","upstream_id":"","short_description":"Find all positive integers $n \\geqslant 2$ for which there exist $n$ real…","config":"","split":"test","body":"{\"problem\":\"Find all positive integers $n \\\\geqslant 2$ for which there exist $n$ real numbers $a_1<\\\\cdots<a_n$ and a real number $r>0$ such that the $\\\\tfrac{1}{2}n(n-1)$ differences $a_j-a_i$ for $1 \\\\leqslant i<j \\\\leqslant n$ are equal, in some order, to the numbers $r^1,r^2,\\\\ldots,r^{\\\\frac{1}{2}n(n-1)}$.\"}","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":[]}