{"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":"8caf44a0-7b11-5735-838c-4bdb34db3df0","task_key":"OE~5fTO~5fmaths~5fen~5fCOMP--train--2193","task_revision_id":"2","upstream_id":"2193","short_description":"Let $m>1$ be an integer. A sequence $a_{1}, a_{2}, a_{3}, \\ldots$ is defined by…","config":"OE_TO_maths_en_COMP","split":"train","body":"{\"answer_type\":\"Numerical\",\"is_multiple_answer\":true,\"language\":\"English\",\"question\":\"Let $m>1$ be an integer. A sequence $a_{1}, a_{2}, a_{3}, \\\\ldots$ is defined by $a_{1}=a_{2}=1$, $a_{3}=4$, and for all $n \\\\geq 4$,\\n\\n$$\\na_{n}=m\\\\left(a_{n-1}+a_{n-2}\\\\right)-a_{n-3} .\\n$$\\n\\nDetermine all integers $m$ such that every term of the sequence is a square.\",\"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":[]}