{"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":"9811106e-1d10-5b88-ae31-2d7eebb6ba75","task_key":"intermediate~5falgebra--test--9811106e-1d10-5b88-ae31-2d7eebb6ba75","task_revision_id":"1","upstream_id":"","short_description":"A set $S$ is constructed as follows. To begin, $S = \\{0,10\\}$. Repeatedly, as…","config":"intermediate_algebra","split":"test","body":"{\"level\":\"Level 4\",\"problem\":\"A set $S$ is constructed as follows. To begin, $S = \\\\{0,10\\\\}$. Repeatedly, as long as possible, if $x$ is an integer root of some nonzero polynomial $a_{n}x^n + a_{n-1}x^{n-1} + \\\\dots + a_{1}x + a_0$ for some $n\\\\geq{1}$, all of whose coefficients $a_i$ are elements of $S$, then $x$ is put into $S$. When no more elements can be added to $S$, how many elements does $S$ have?\",\"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":[]}