{"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":"973ee150-027d-579b-9ef0-abbfefd06ff2","task_key":"OE~5fTO~5fmaths~5fen~5fCOMP--train--2111","task_revision_id":"3","upstream_id":"2111","short_description":"Find all positive integers $n$ such that there exists a sequence of positive…","config":"OE_TO_maths_en_COMP","split":"train","body":"{\"answer_type\":\"Numerical\",\"is_multiple_answer\":true,\"language\":\"English\",\"question\":\"Find all positive integers $n$ such that there exists a sequence of positive integers $a_{1}, a_{2}, \\\\ldots, a_{n}$ satisfying\\n\\n$$\\na_{k+1}=\\\\frac{a_{k}^{2}+1}{a_{k-1}+1}-1\\n$$\\n\\nfor every $k$ with $2 \\\\leq k \\\\leq n-1$.\",\"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":[]}