{"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":"240ca69e-8fc5-551a-8166-224534bb617e","task_key":"OE~5fTO~5fmaths~5fen~5fCOMP--train--1687","task_revision_id":"1","upstream_id":"1687","short_description":"Determine all pairs $(f, g)$ of functions from the set of positive integers to…","config":"OE_TO_maths_en_COMP","split":"train","body":"{\"answer_type\":\"Expression\",\"is_multiple_answer\":false,\"language\":\"English\",\"question\":\"Determine all pairs $(f, g)$ of functions from the set of positive integers to itself that satisfy\\n\\n$$\\nf^{g(n)+1}(n)+g^{f(n)}(n)=f(n+1)-g(n+1)+1\\n$$\\n\\nfor every positive integer $n$. Here, $f^{k}(n)$ means $\\\\underbrace{f(f(\\\\ldots f}_{k}(n) \\\\ldots))$.\",\"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":[]}