9. (14 points) Given t∈N+,t=0,1(mod9). Arrange all t-digit numbers from 1↑11⋯1 to t99⋯9 in any order into a single number, denoted as A. Prove that A is not a perfect square.
Solution
9. It is known that the number of t-digit numbers is m=(t−1)↑88⋯89 (numbers).
Let the mt-digit numbers in A be am, am−1,⋯,a1, i.e., A=i=1∑mai×10t(i−1).
Thus, A≡∑i=1mai(mod9). Let t≡r(mod9)(2⩽r⩽8). Then m=(t−1)↑88⋯89≡8(t−1)+9 ≡10−r(mod9). Since ∑i=kk+8i=29(2k+8)≡0(mod9), we have A≡∑i=09−1(i↑99⋯9−i)≡∑i=09−1(9−i)=∑j=r9j =2(10−r)(9+r)=2r(1−r)(mod9). When r=2,5,8, A≡−1(mod9); When r=3,7, A≡−3(mod9); When r=4,6, A≡3(mod9). If A≡3 or −3(mod9), then A is a multiple of 3, but not a multiple of 9; if A≡−1(mod9), then A≡−1(mod3), but n2≡0 or 1(mod3). Thus, A is not a perfect square.
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: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.