{"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":"e2738dc1-81da-5798-b32a-5f0fa720334d","task_key":"OE~5fTO~5fmaths~5fen~5fCOMP--train--1988","task_revision_id":"3","upstream_id":"1988","short_description":"Let $n \\geqslant 2$ be an integer, and let $A_{n}$ be the set","config":"OE_TO_maths_en_COMP","split":"train","body":"{\"answer_type\":\"Expression\",\"is_multiple_answer\":false,\"language\":\"English\",\"question\":\"Let $n \\\\geqslant 2$ be an integer, and let $A_{n}$ be the set\\n\\n$$\\nA_{n}=\\\\left\\\\{2^{n}-2^{k} \\\\mid k \\\\in \\\\mathbb{Z}, 0 \\\\leqslant k<n\\\\right\\\\} .\\n$$\\n\\nDetermine the largest positive integer that cannot be written as the sum of one or more (not necessarily distinct) elements of $A_{n}$.\",\"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":[]}