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 ?
- A)
- B)
- C)
- D)
- E)
Answer
D
Key insight
In terms of the repunit R the equation reads R(9c - a^2) = b - 2c; two values of n force both sides to vanish.
Solution
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 .
Why this works
Repdigits are multiples of repunits, and the -digit repunit factors through the -digit one, so the whole equation lives in the single variable . A polynomial identity in that must hold at two distinct values, when it is only linear in , has to hold identically, which turns an infinite family of conditions into two digit equations. "At least two values of " is the phrase that signals this coefficient-matching argument.
Alternative approach
Reason from digits: . For the equation is , and for it is , i.e. . Multiply the first by and subtract the second: , so , and then , matching the general argument.
The trap
Testing n = 1 alone (which yields many digit triples) or using C_n with n digits instead of 2n digits.
Common mistakes
- Testing n = 1 alone (which yields many digit triples) or using C_n with n digits instead of 2n digits.
- Allowing for , (sum , not a choice, but leading to a guess of (E)); digits must be single nonzero digits.
Techniques
Apply an identity: SFFT, sum of squares, difference of cubes, Vieta · Substitute to simplify (u = x+1/x, shifting, scaling)