Skip to main content
OlympiadHQ

Browse · harp

Print

jmc

number theory junior

Problem

If , and are different digits, then the largest possible digit sum for has the form
(A)
(B)
(C)
(D)
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 .
Final answer
D