{"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":"534addeb-5fb9-5baf-8f20-a7c6f38f2a82","task_key":"OE~5fTO~5fmaths~5fen~5fCOMP--train--2344","task_revision_id":"1","upstream_id":"2344","short_description":"The geometric sequence with $n$ terms $t_{1}, t_{2}, \\ldots, t_{n-1}, t_{n}$ has…","config":"OE_TO_maths_en_COMP","split":"train","body":"{\"answer_type\":\"Numerical\",\"is_multiple_answer\":false,\"language\":\"English\",\"question\":\"The geometric sequence with $n$ terms $t_{1}, t_{2}, \\\\ldots, t_{n-1}, t_{n}$ has $t_{1} t_{n}=3$. Also, the product of all $n$ terms equals 59049 (that is, $t_{1} t_{2} \\\\cdots t_{n-1} t_{n}=59049$ ). Determine the value of $n$.\\n\\n(A geometric sequence is a sequence in which each term after the first is obtained from the previous term by multiplying it by a constant. For example, $3,6,12$ is a geometric sequence with three terms.)\",\"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":[]}