{"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":"e9ac9cee-1e90-50e7-a603-1c4048c55950","task_key":"intermediate~5falgebra--test--e9ac9cee-1e90-50e7-a603-1c4048c55950","task_revision_id":"1","upstream_id":"","short_description":"The Fibonacci sequence is defined by $F_1 = F_2 = 1$ and $F_n = F_{n - 1} + F_{n…","config":"intermediate_algebra","split":"test","body":"{\"level\":\"Level 5\",\"problem\":\"The Fibonacci sequence is defined by $F_1 = F_2 = 1$ and $F_n = F_{n - 1} + F_{n - 2}$ for $n \\\\ge 3.$\\n\\nCompute\\n\\\\[\\\\sum_{j = 1}^{2004} i^{2004 - F_j}.\\\\]\",\"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":[]}