{"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":"b6f05fde-990e-58b9-90d6-a7e5e27b91c0","task_key":"test--b6f05fde-990e-58b9-90d6-a7e5e27b91c0","task_revision_id":"1","upstream_id":"","short_description":"Prove: If the sum of all positive divisors of $ n \\in \\mathbb{Z}^{\\plus{}}$ is a…","config":"","split":"test","body":"{\"problem\":\"Prove: If the sum of all positive divisors of $ n \\\\in \\\\mathbb{Z}^{\\\\plus{}}$ is a power of two, then the number/amount of the divisors is a power of two.\"}","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":[]}