1987 AJHSME Problems/Problem 8
From AoPSWiki
Problem
If 
and 
are nonzero digits, then the number of digits (not necessarily different) in the sum of the three whole numbers is
![\begin{tabular}[t]{cccc}9 & 8 & 7 & 6 \\& A & 3 & 2 \\& & B & 1 \\ \hline \end{tabular}](http://alt2.artofproblemsolving.com/Forum/latexrender/pictures/f/e/f/fefcf2d4e7eb8f0c345eb6ba8e7cbcfea4133de8.gif)
Solution
The minimum possible value of this sum is when 
, which is 
The largest possible value of the sum is when 
, making the sum 
Since all the possible sums are between 
and 
, they must have 
digits.
See Also
| 1987 AJHSME (Problems • Resources) | ||
| Preceded by Problem 7 | Followed by Problem 9 | |
| 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 | ||
