{"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":"9f8193ff-01b3-5ee9-a66f-329d7cdbd9bf","task_key":"test--9f8193ff-01b3-5ee9-a66f-329d7cdbd9bf","task_revision_id":"1","upstream_id":"","short_description":"Let $n, m$ be positive integers. A set $S$ of positive integers is called $(n,…","config":"","split":"test","body":"{\"problem\":\"Let $n, m$ be positive integers. A set $S$ of positive integers is called $(n, m)$-good, if:\\n\\n(1) $m \\\\in S$;\\n(2) for all $a\\\\in S$, all divisors of $a$ are also in $S$;\\n(3) for all distinct $a, b \\\\in S$, $a^n+b^n \\\\in S$.\\n\\nFor which $(n, m)$, the only $(n, m)$-good set is $\\\\mathbb{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":[]}