{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"olympiadbench","formal_name":"OlympiadBench","introduction":"OlympiadBench evaluates scientific reasoning on Olympiad-level mathematics and physics problems. Its official description lists 8,476 English and Chinese problems with separate text-only and multimodal settings.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://github.com/OpenBMB/OlympiadBench","indexing_mode":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"a9d6eaa6-4377-5d6a-a07b-0d4b2170912d","task_key":"OE~5fTO~5fmaths~5fen~5fCOMP--train--1834","task_revision_id":"3","upstream_id":"1834","short_description":"Find the smallest positive integer $n$, or show that no such $n$ exists, with…","config":"OE_TO_maths_en_COMP","split":"train","body":"{\"answer_type\":\"Numerical\",\"is_multiple_answer\":false,\"language\":\"English\",\"question\":\"Find the smallest positive integer $n$, or show that no such $n$ exists, with the following property: there are infinitely many distinct $n$-tuples of positive rational numbers $\\\\left(a_{1}, a_{2}, \\\\ldots, a_{n}\\\\right)$ such that both\\n\\n$$\\na_{1}+a_{2}+\\\\cdots+a_{n} \\\\quad \\\\text { and } \\\\quad \\\\frac{1}{a_{1}}+\\\\frac{1}{a_{2}}+\\\\cdots+\\\\frac{1}{a_{n}}\\n$$\\n\\nare integers.\",\"question_type\":\"Open-ended\",\"subject\":\"Math\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/OpenBMB/OlympiadBench","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}