{"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":"4cda72f7-4ddf-522f-ada6-05c883b187dc","task_key":"test--4cda72f7-4ddf-522f-ada6-05c883b187dc","task_revision_id":"1","upstream_id":"","short_description":"Find all integers $n \\geq 3$ such that the following property holds: if we list…","config":"","split":"test","body":"{\"problem\":\"Find all integers $n \\\\geq 3$ such that the following property holds: if we list the divisors of $n !$ in increasing order as $1=d_1<d_2<\\\\cdots<d_k=n!$ , then we have \\\\[d_2-d_1 \\\\leq d_3-d_2 \\\\leq \\\\cdots \\\\leq d_k-d_{k-1} .\\\\] \\nContents   1  Solution (Explanation of Video)  2  Solution 2  3  Video Solution  4  See Also\"}","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":[]}