{"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":"eee988e4-c3cc-5dc1-b4e6-b27f8c379598","task_key":"test--eee988e4-c3cc-5dc1-b4e6-b27f8c379598","task_revision_id":"4","upstream_id":"","short_description":"Proof that","config":"","split":"test","body":"{\"problem\":\"Proof that\\n$$ \\\\sum_{m=1}^n5^{\\\\omega (m)} \\\\le \\\\sum_{k=1}^n\\\\lfloor \\\\frac{n}{k} \\\\rfloor \\\\tau (k)^2  \\\\le \\\\sum_{m=1}^n5^{\\\\Omega (m)} .$$\"}","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":[]}