1994 AJHSME Problems/Problem 23
Problem
If 
, 
and 
are different digits, then the largest possible 
digit sum for
has the form
Solution
The sum can be rewritten as 
. To get the largest possible sum, we maximize the hundreds digit, . If 
, the sum is a 
-digit number, so we let 
and 
. To continue maxmimizing this sum, we can let 
, a different digit from , and 
, which has the form 
.
See Also
| 1994 AJHSME (Problems • Answer Key • Resources) | ||
| Preceded by Problem 22 |
Followed by Problem 24 | |
| 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 AJHSME/AMC 8 Problems and Solutions | ||
