2018 AMC 10A Problems/Problem 25

Revision as of 12:01, 19 February 2018 by Blacksheep2003 (talk | contribs)

Problem

For a positive integer $n$ and nonzero digits $a$, $b$, and $c$, let $A_n$ be the $n$-digit integer each of whose digits is equal to $a$; let $B_n$ be the $n$-digit integer each of whose digits is equal to $b$, and let $C_n$ be the $2n$-digit (not $n$-digit) integer each of whose digits is equal to $c$. What is the greatest possible value of $a + b + c$ for which there are at least two values of $n$ such that $C_n - B_n = A_n^2$?

$\textbf{(A)} \text{ 12} \qquad \textbf{(B)} \text{ 14} \qquad \textbf{(C)} \text{ 16} \qquad \textbf{(D)} \text{ 18} \qquad \textbf{(E)} \text{ 20}$

Solution

Notice that $(0.\overline{3})^2 = 0.\overline{1}$ and $(0.\overline{6})^2 = 0.\overline{4}$. Setting $a = 3$ and $c = 1$, we see $b = 2$ works for all possible values of $n$. Similarly, if $a = 6$ and $c = 4$, then $b = 8$ works for all possible values of $n$. The second solution yields a greater sum of $\boxed{\textbf{(D)} \text{ 18}}$.

See Also

2018 AMC 10A (ProblemsAnswer KeyResources)
Preceded by
Problem 24
Followed by
Last Problem
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
All AMC 10 Problems and Solutions
2018 AMC 12A (ProblemsAnswer KeyResources)
Preceded by
Problem 24
Followed by
Last Problem
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
All AMC 12 Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png