olymmath

AMC 12 2017a Problem 21

  • Paper

A set SS is constructed as follows. To begin, S={0,10}S = \{0,10\}. Repeatedly, as long as possible, if xx is an integer root of some polynomial anxn+an−1xn−1+...+a1x+a0a_{n}x^n + a_{n-1}x^{n-1} + ... + a_{1}x + a_0 for some n≥1n\geq{1}, all of whose coefficients aia_i are elements of SS, then xx is put into SS. When no more elements can be added to SS, how many elements does SS have?

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

Dataset text AMC 12 2000 to 2025. Quoted with source.

Show the answer

D

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator amc12/2017a/p21 · Tag 766EAH4RGC · Edit this page on GitHub · Keys: j next, k previous