{"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":"edbaf9f6-50c2-520c-bbac-95037f0ccf8a","task_key":"intermediate~5falgebra--test--edbaf9f6-50c2-520c-bbac-95037f0ccf8a","task_revision_id":"1","upstream_id":"","short_description":"Compute","config":"intermediate_algebra","split":"test","body":"{\"level\":\"Level 4\",\"problem\":\"Compute\\n\\\\[\\\\sum_{n = 1}^\\\\infty \\\\frac{F_{n + 1}}{F_n F_{n + 2}},\\\\]where $F_n$ denotes the $n$th Fibonacci number, so $F_0 = 0$ and $F_1 = 1.$\",\"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":[]}