{"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":"e91d833f-6202-5a82-9621-d1c6f5109a1b","task_key":"OE~5fTO~5fmaths~5fen~5fCOMP--train--1800","task_revision_id":"3","upstream_id":"1800","short_description":"Find all positive integers $n$ with the following property: the $k$ positive…","config":"OE_TO_maths_en_COMP","split":"train","body":"{\"answer_type\":\"Numerical\",\"is_multiple_answer\":true,\"language\":\"English\",\"question\":\"Find all positive integers $n$ with the following property: the $k$ positive divisors of $n$ have a permutation $\\\\left(d_{1}, d_{2}, \\\\ldots, d_{k}\\\\right)$ such that for every $i=1,2, \\\\ldots, k$, the number $d_{1}+\\\\cdots+d_{i}$ is a perfect square.\",\"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":[]}