{"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":"bb32d20f-cbf2-58af-a267-b0705589b6c3","task_key":"OE~5fTO~5fmaths~5fen~5fCOMP--train--1883","task_revision_id":"3","upstream_id":"1883","short_description":"The Fibonacci numbers $F_{0}, F_{1}, F_{2}, \\ldots$ are defined inductively by…","config":"OE_TO_maths_en_COMP","split":"train","body":"{\"answer_type\":\"Expression\",\"is_multiple_answer\":false,\"language\":\"English\",\"question\":\"The Fibonacci numbers $F_{0}, F_{1}, F_{2}, \\\\ldots$ are defined inductively by $F_{0}=0, F_{1}=1$, and $F_{n+1}=F_{n}+F_{n-1}$ for $n \\\\geqslant 1$. Given an integer $n \\\\geqslant 2$, determine the smallest size of a set $S$ of integers such that for every $k=2,3, \\\\ldots, n$ there exist some $x, y \\\\in S$ such that $x-y=F_{k}$.\",\"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":[]}