{"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":"d543eacf-a4dc-5b99-ade3-f19d3cf3e6e0","task_key":"test--d543eacf-a4dc-5b99-ade3-f19d3cf3e6e0","task_revision_id":"1","upstream_id":"","short_description":"Find the smallest positive integer $n$ or show no such $n$ exists, with the…","config":"","split":"test","body":"{\"problem\":\"Find the smallest positive integer $n$ or show no such $n$ exists, with the following property: there are infinitely many distinct $n$-tuples of positive rational numbers $(a_1, a_2, \\\\ldots, a_n)$ such that both\\n$$a_1+a_2+\\\\dots +a_n \\\\quad \\\\text{and} \\\\quad \\\\frac{1}{a_1} + \\\\frac{1}{a_2} + \\\\dots + \\\\frac{1}{a_n}$$\\nare integers.\"}","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":[]}