{"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":"50943f23-f067-5e58-b322-f1d136bd22cd","task_key":"test--50943f23-f067-5e58-b322-f1d136bd22cd","task_revision_id":"3","upstream_id":"","short_description":"Given a fixed positive integer $a\\geq 9$. Prove: There exist finitely many…","config":"","split":"test","body":"{\"problem\":\"Given a fixed positive integer $a\\\\geq 9$. Prove: There exist finitely many positive integers $n$, satisfying:\\n(1)$\\\\tau (n)=a$\\n(2)$n|\\\\phi (n)+\\\\sigma (n)$\\nNote: For positive integer $n$, $\\\\tau (n)$ is the number of positive divisors of $n$, $\\\\phi (n)$ is the number of positive integers $\\\\leq n$ and relatively prime with $n$, $\\\\sigma (n)$ is the sum of positive divisors of $n$.\"}","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":[]}