{"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":"18a071f5-a083-5fec-a5b3-06d18cfc0709","task_key":"test--18a071f5-a083-5fec-a5b3-06d18cfc0709","task_revision_id":"1","upstream_id":"","short_description":"For any positive integer $n$, let $\\tau(n)$ denote the number of positive…","config":"","split":"test","body":"{\"problem\":\"For any positive integer $n$, let $\\\\tau(n)$ denote the number of positive divisors of $n$. If $n$ is a positive integer such that $\\\\frac{\\\\tau\\\\left(n^{2}\\\\right)}{\\\\tau(n)}=3$, compute $\\\\frac{\\\\tau\\\\left(n^{7}\\\\right)}{\\\\tau(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":[]}