{"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":"0eef69c5-fce3-504b-b01d-7d75967b89bf","task_key":"test--0eef69c5-fce3-504b-b01d-7d75967b89bf","task_revision_id":"1","upstream_id":"","short_description":"For a positive integer $n$, denote by $\\tau(n)$ the number of positive integer…","config":"","split":"test","body":"{\"problem\":\"For a positive integer $n$, denote by $\\\\tau(n)$ the number of positive integer divisors of $n$, and denote by $\\\\phi(n)$ the number of positive integers that are less than or equal to $n$ and relatively prime to $n$. Call a positive integer $n$ good if $\\\\varphi(n)+4 \\\\tau(n)=n$. For example, the number 44 is good because $\\\\varphi(44)+4 \\\\tau(44)=44$. Find the sum of all good positive integers $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":[]}