2018 AMC 10A Problem 25
For a positive integer and nonzero digits , , and , let be the -digit integer each of whose digits is equal to ; let be the -digit integer each of whose digits is equal to , and let be the -digit (not -digit) integer each of whose digits is equal to . What is the greatest possible value of for which there are at least two values of such that ?
Show solution without answering
Key insight
Using R = 11...1, the equation becomes (9c minus a squared) times R = b minus 2c. Two values of n force both sides to be 0.
Solution
Every number here is a repeated digit, so write each one using a string of ones. Let be the -digit number .
1. Write and . and . For example, with , .
2. Write . A -digit string of ones is followed by , which is . For example, . Also (check: ). So
3. Put everything into .
Every term has a factor , so divide it out:
Move the terms to one side:
4. Why two values of matter. Different give different (, , , ...), but the right side stays the same. If were not , only one value of could make the two sides equal, so only one would work. For two values of we need
and then the equation holds for every .
5. Try the digits. means is a multiple of , so is , or .
- : , . Sum .
- : , . Sum .
- : , , which is not a digit.
The largest sum is .
6. Check. : . : .
The answer is .
Why this works
Numbers made of one repeated digit are that digit times a string of ones, and a string of ones is built from the string of ones. That turns the whole problem into one equation in . The equation has the form (number) times = (number), and if it must hold for two different , both numbers must be . "At least two values of " is the hint to use this.
Alternative approach
Write out and to see where the conditions come from. For : , so . For : , so dividing by , . Multiply the first equation by and subtract the second: , so , and then . This shows what happens when and both work; the main solution shows the same must happen for any two values of .
Concise solution
A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.
Let ( ones). Then , , and, since with ,
The condition becomes
Divide by and rearrange:
The right side does not depend on , while takes different values for different . If , then is a single value, so at most one works. Two values of therefore force
and then the equation holds for every .
means is a multiple of : gives , (sum ); gives , (sum ); gives , , not a digit. The maximum is .
Check with : ; with : .
The answer is .
Review in the AoPS books
- Introduction to Number Theory, Chapter 8: Base Numbers
- Introduction to Algebra, Chapter 11: Special Factorizations (§11.2, §11.3, §11.5)
- Introduction to Number Theory, Chapter 7: Algebra With Integers
- Intermediate Algebra, Chapter 20: Some Advanced Strategies (§20.2)
Similar problems
Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.