Prove that there exist infinitely many positive integers n so that n and the sum of its digits are perfect squares and
a) the decimal representation of n contains at most one 0;
b) the decimal representation of n does not contain 0. (T. Lasy)
Solution
Note that the sum of the digits of this number is equal to S(Xn)=1⋅n+5⋅(n−1)+6=6n+1. Further, Xn=9102n−1+94⋅(10n−1)+1=9102n−1+4⋅(10n−1)+9=9102n+4⋅10n+4=(310n+2)2 is a perfect square. (Since S(10n+2)=3, we have 10n+2⋮3.) It suffices to note that if n=6m2+2m (m∈N), then S(Xn)=6n+1=6(6m2+2m)+1=(6m+1)2. Therefore, the numbers X6m2+2m satisfy the problem condition for all m∈N, and we have infinitely many such numbers.
Remark. Also we can consider (2⋅10n+1)2
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.