{"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":"ba0d5ee2-0d8f-5ee4-ac5e-092cc6f6d451","task_key":"test--ba0d5ee2-0d8f-5ee4-ac5e-092cc6f6d451","task_revision_id":"1","upstream_id":"","short_description":"Find the number of positive integers $n$ satisfying $\\phi(n) | n$ such that","config":"","split":"test","body":"{\"problem\":\"Find the number of positive integers $n$ satisfying $\\\\phi(n) | n$ such that\\n\\\\[\\\\sum_{m=1}^{\\\\infty} \\\\left( \\\\left[ \\\\frac nm \\\\right] - \\\\left[\\\\frac{n-1}{m} \\\\right]  \\\\right) =  1992\\\\]\\nWhat is the largest number among them? As usual, $\\\\phi(n)$ is the number of positive integers less than or equal to $n$ and relatively prime to $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":[]}