2017 AMC 12A Problems/Problem 21

Revision as of 17:10, 8 February 2017 by Thomas0115 (talk | contribs) (Created page with "==Problem== A set <math>S</math> is constructed as follows. To begin, <math>S = \{0,10\}</math>. Repeatedly, as long as possible, if <math>x</math> is an integer root of some...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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 polynomial $a_{n}x^n + a_{n-1}x^{n-1} + ... + 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?

$\textbf{(A)}\ 4 \qquad \textbf{(B)}\ 5 \qquad\textbf{(C)}\ 7 \qquad\textbf{(D)}\ 9 \qquad\textbf{(E)}\ 11$