{"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":"fd1a9801-0499-505d-af4d-e14b64274909","task_key":"test--fd1a9801-0499-505d-af4d-e14b64274909","task_revision_id":"1","upstream_id":"","short_description":"Find an $n$ such that $n!-(n-1)!+(n-2)!-(n-3)!+\\cdots \\pm 1$ ! is prime. Be…","config":"","split":"test","body":"{\"problem\":\"Find an $n$ such that $n!-(n-1)!+(n-2)!-(n-3)!+\\\\cdots \\\\pm 1$ ! is prime. Be prepared to justify your answer for $\\\\left\\\\{\\\\begin{array}{c}n, \\\\\\\\ {\\\\left[\\\\frac{n+225}{10}\\\\right],}\\\\end{array} n \\\\leq 25\\\\right.$ points, where $[N]$ is the greatest integer less than $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":[]}