{"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":"43797cdb-0be7-58db-83f8-c7c8d0f0919b","task_key":"intermediate~5falgebra--test--43797cdb-0be7-58db-83f8-c7c8d0f0919b","task_revision_id":"1","upstream_id":"","short_description":"Given that a sequence satisfies $x_0=0$ and $|x_k|=|x_{k-1}+3|$ for all integers…","config":"intermediate_algebra","split":"test","body":"{\"level\":\"Level 5\",\"problem\":\"Given that a sequence satisfies $x_0=0$ and $|x_k|=|x_{k-1}+3|$ for all integers $k\\\\ge1$, find the minimum possible value of $|x_1+x_2+\\\\cdots+x_{2006}|$.\",\"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":[]}