{"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":"105fc099-33f7-58d7-aa75-29c5b2136840","task_key":"test--105fc099-33f7-58d7-aa75-29c5b2136840","task_revision_id":"1","upstream_id":"","short_description":"If $n$ is a positive integer, the notation $n$! (read \" $n$ factorial\") is used…","config":"","split":"test","body":"{\"problem\":\"If $n$ is a positive integer, the notation $n$! (read \\\" $n$ factorial\\\") is used to represent the product of the integers from 1 to $n$. That is, $n!=n(n-1)(n-2) \\\\cdots(3)(2)(1)$. For example, $4!=4(3)(2)(1)=24$ and $1!=1$. If $a$ and $b$ are positive integers with $b>a$, what is the ones (units) digit of $b!-a$! that cannot be?\"}","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":[]}