{"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":"f7b86486-f5dd-5aae-9092-1c9803138d9e","task_key":"OE~5fTO~5fmaths~5fen~5fCOMP--train--2032","task_revision_id":"3","upstream_id":"2032","short_description":"Let $a_{0}, a_{1}, a_{2}, \\ldots$ be a sequence of real numbers such that…","config":"OE_TO_maths_en_COMP","split":"train","body":"{\"answer_type\":\"Numerical\",\"is_multiple_answer\":false,\"language\":\"English\",\"question\":\"Let $a_{0}, a_{1}, a_{2}, \\\\ldots$ be a sequence of real numbers such that $a_{0}=0, a_{1}=1$, and for every $n \\\\geqslant 2$ there exists $1 \\\\leqslant k \\\\leqslant n$ satisfying\\n\\n$$\\na_{n}=\\\\frac{a_{n-1}+\\\\cdots+a_{n-k}}{k}\\n$$\\n\\nFind the maximal possible value of $a_{2018}-a_{2017}$.\",\"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":[]}