{"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":"50079179-6b9e-5b7e-9e61-9a31810aa792","task_key":"test--50079179-6b9e-5b7e-9e61-9a31810aa792","task_revision_id":"1","upstream_id":"","short_description":"Determine all integers $n \\geq 2$ such that there exists a permutation $x_0,…","config":"","split":"test","body":"{\"problem\":\"Determine all integers $n \\\\geq 2$ such that there exists a permutation $x_0, x_1, \\\\ldots, x_{n - 1}$ of the numbers $0, 1, \\\\ldots, n - 1$ with the property that the $n$ numbers\\n$$x_0, \\\\hspace{0.3cm} x_0 + x_1, \\\\hspace{0.3cm} \\\\ldots, \\\\hspace{0.3cm} x_0 + x_1 + \\\\ldots  + x_{n - 1}$$\\nare pairwise distinct modulo $n$.\"}","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":[]}