{"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":"a7a6c56b-477a-55b0-af91-8eacd5b0859d","task_key":"OE~5fTO~5fmaths~5fen~5fCOMP--train--2091","task_revision_id":"3","upstream_id":"2091","short_description":"For any integer $n \\geq 2$, let $N(n)$ be the maximal number of triples…","config":"OE_TO_maths_en_COMP","split":"train","body":"{\"answer_type\":\"Expression\",\"is_multiple_answer\":false,\"language\":\"English\",\"question\":\"For any integer $n \\\\geq 2$, let $N(n)$ be the maximal number of triples $\\\\left(a_{i}, b_{i}, c_{i}\\\\right), i=1, \\\\ldots, N(n)$, consisting of nonnegative integers $a_{i}, b_{i}$ and $c_{i}$ such that the following two conditions are satisfied:\\n\\n(1) $a_{i}+b_{i}+c_{i}=n$ for all $i=1, \\\\ldots, N(n)$,\\n\\n(2) If $i \\\\neq j$, then $a_{i} \\\\neq a_{j}, b_{i} \\\\neq b_{j}$ and $c_{i} \\\\neq c_{j}$.\\n\\nDetermine $N(n)$ for all $n \\\\geq 2$.\",\"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":[]}