{"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":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"fc85ff17-d50d-58ff-aa23-7aebe71964d8","task_key":"test--fc85ff17-d50d-58ff-aa23-7aebe71964d8","task_revision_id":"4","upstream_id":"","short_description":"For any positive integer $d$, prove there are infinitely many positive integers…","config":"","split":"test","body":"{\"problem\":\"For any positive integer $d$, prove there are infinitely many positive integers $n$ such that  $d(n!)-1$ is a composite number.\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}