{"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":"a223590b-f9fc-5b0f-a165-f84bd99dc514","task_key":"intermediate~5falgebra--test--a223590b-f9fc-5b0f-a165-f84bd99dc514","task_revision_id":"1","upstream_id":"","short_description":"Define a sequence recursively by $F_{0}=0,~F_{1}=1,$ and $F_{n}$ be the…","config":"intermediate_algebra","split":"test","body":"{\"level\":\"Level 3\",\"problem\":\"Define a sequence recursively by $F_{0}=0,~F_{1}=1,$ and $F_{n}$ be the remainder when $F_{n-1}+F_{n-2}$ is divided by $3,$ for all $n\\\\geq 2.$ Thus the sequence starts $0,1,1,2,0,2,\\\\ldots$ What is $F_{2017}+F_{2018}+F_{2019}+F_{2020}+F_{2021}+F_{2022}+F_{2023}+F_{2024}?$\",\"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":[]}