{"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":"d53450fe-bcd9-526a-892f-09f4960e2952","task_key":"test--d53450fe-bcd9-526a-892f-09f4960e2952","task_revision_id":"1","upstream_id":"","short_description":"Define $\\phi^{!}(n)$ as the product of all positive integers less than or equal…","config":"","split":"test","body":"{\"problem\":\"Define $\\\\phi^{!}(n)$ as the product of all positive integers less than or equal to $n$ and relatively prime to $n$. Compute the remainder when $$ \\\\sum_{\\\\substack{2 \\\\leq n \\\\leq 50 \\\\\\\\ \\\\operatorname{gcd}(n, 50)=1}} \\\\phi^{!}(n) $$ is divided by 50 .\"}","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":[]}