{"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":"d52cdf98-ea74-5f12-90ed-cd154f2119c6","task_key":"OE~5fTO~5fmaths~5fen~5fCOMP--train--2000","task_revision_id":"3","upstream_id":"2000","short_description":"Find all positive integers $n \\geqslant 2$ for which there exist $n$ real…","config":"OE_TO_maths_en_COMP","split":"train","body":"{\"answer_type\":\"Numerical\",\"is_multiple_answer\":true,\"language\":\"English\",\"question\":\"Find all positive integers $n \\\\geqslant 2$ for which there exist $n$ real numbers $a_{1}<\\\\cdots<a_{n}$ and a real number $r>0$ such that the $\\\\frac{1}{2} n(n-1)$ differences $a_{j}-a_{i}$ for $1 \\\\leqslant i<j \\\\leqslant n$ are equal, in some order, to the numbers $r^{1}, r^{2}, \\\\ldots, r^{\\\\frac{1}{2} n(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":[]}