{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"math","formal_name":"MATH","introduction":"MATH organises 12,500 high-school competition problems into seven subjects and five difficulty levels, each with a full worked solution. It underlies much of the later mathematics evaluation work; this catalogue imports the full test split: 5,000 problems across all seven subjects.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://github.com/hendrycks/math","indexing_mode":"index","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[],"history":"","construction":"","limitations":"","saturation":"","scores":[]}},"task_id":"7a77f46b-9649-5e34-b983-b11c4fb330c9","task_key":"intermediate~5falgebra--test--7a77f46b-9649-5e34-b983-b11c4fb330c9","task_revision_id":"1","upstream_id":"","short_description":"An infinite sequence of real numbers $a_1, a_2, \\dots$ satisfies the recurrence","config":"intermediate_algebra","split":"test","body":"{\"level\":\"Level 4\",\"problem\":\"An infinite sequence of real numbers $a_1, a_2, \\\\dots$ satisfies the recurrence\\n\\\\[ a_{n+3} = a_{n+2} - 2a_{n+1} + a_n \\\\]for every positive integer $n$. Given that $a_1 = a_3 = 1$ and $a_{98} = a_{99}$, compute $a_1 + a_2 + \\\\dots + a_{100}$.\",\"type\":\"Intermediate Algebra\"}","display_format":"math","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/hendrycks/math","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}