Problem:
For a positive integer n and nonzero digits a,b, and c, let Anβ be the n-digit integer each of whose digits is equal to a; let Bnβ be the n-digit integer each of whose digits is equal to b; and let Cnβ be the 2n-digit (not n-digit) integer each of whose digits is equal to c. What is the greatest possible value of a+b+c for which there are at least two values of n such that CnββBnβ=An2β?
Answer Choices:
A. 12
B. 14
C. 16
D. 18
E. 20
Solution:
The equation CnββBnβ=An2β is equivalent to
cβ
9102nβ1ββbβ
910nβ1β=a2(910nβ1β)2.
Dividing by 10nβ1 and clearing fractions yields
(9cβa2)β
10n=9bβ9cβa2
As this must hold for two different values n1β and n2β, there are two such equations, and subtracting them gives
(9cβa2)(10n1ββ10n2β)=0
The second factor is non-zero, so 9cβa2=0 and thus 9bβ9cβa2=0. From this it follows that c=(3aβ)2 and b=2c. Hence digit a must be 3, 6, or 9, with corresponding values 1, 4, or 9 for c, and 2,8, or 18 for b. The case b=18 is invalid, so there are just two triples of possible values for a,b, and c, namely (3,2,1) and (6,8,4). In fact, in these cases, CnββBnβ=An2β for all positive integers n; for example, 4444β88=4356=662. The second triple has the greater coordinate sum, 6+8+4=(D)18β.
The problems on this page are the property of the MAA's American Mathematics Competitions