{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"olympiadbench","formal_name":"OlympiadBench","introduction":"数学と物理のオリンピック水準の問題で、科学的推論を評価するベンチマークです。公式紹介では英語・中国語の8,476問を収録し、テキストのみと画像付きの設定を区別します。\n\nOlympiadBench 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"},"task_id":"5068f874-ba3a-52b3-af8d-0a4ee4c86d89","task_key":"OE~5fTO~5fmaths~5fen~5fCOMP--train--1709","task_revision_id":"1","upstream_id":"1709","short_description":"For each positive integer $k$, let $t(k)$ be the largest odd divisor of $k$.…","config":"OE_TO_maths_en_COMP","split":"train","body":"{\"answer_type\":\"Numerical\",\"is_multiple_answer\":true,\"language\":\"English\",\"question\":\"For each positive integer $k$, let $t(k)$ be the largest odd divisor of $k$. Determine all positive integers $a$ for which there exists a positive integer $n$ such that all the differences\\n\\n$$\\nt(n+a)-t(n), \\\\quad t(n+a+1)-t(n+1), \\\\quad \\\\ldots, \\\\quad t(n+2 a-1)-t(n+a-1)\\n$$\\n\\nare divisible by 4 .\",\"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":[]}