{"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":"4cf6ce69-58ad-5803-8efe-24ef4e35c3de","task_key":"number~5ftheory--test--4cf6ce69-58ad-5803-8efe-24ef4e35c3de","task_revision_id":"1","upstream_id":"","short_description":"Let the term $S_n$ be the sum of the first $n$ powers of $2$. For instance, $S_3…","config":"number_theory","split":"test","body":"{\"level\":\"Level 4\",\"problem\":\"Let the term $S_n$ be the sum of the first $n$ powers of $2$. For instance, $S_3 = 2^0 + 2^1 + 2^2 = 7$.  Find the largest possible value of the greatest common divisor of two consecutive terms, $S_n$ and $S_{n+1}$, for any $n$.\",\"type\":\"Number Theory\"}","display_format":"math","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/hendrycks/math","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}