Maths Olympiad Prep

Library / /37 of 57

, 2008

Number theory Difficulty 6.2 National Olympiad Prove it JBMO

Problem:
Is it possible to arrange the numbers 11,22,,200820081^{1}, 2^{2}, \ldots, 2008^{2008} one after the other, in such a way that the obtained number is a perfect square? (Explain your answer.)

Solution

Solution:
We will use the following lemmas.

Lemma 1. If xNx \in \mathbb{N}, then x20x^{2} \equiv 0 or 1(mod3)1 \pmod{3}.

Proof: Let xNx \in \mathbb{N}, then x=3kx=3k, x=3k+1x=3k+1 or x=3k+2x=3k+2, hence
x2=9k20(mod3)x2=9k2+6k+11(mod3),x2=9k2+12k+41(mod3), respectively.  \begin{aligned} & x^{2}=9k^{2} \equiv 0 \pmod{3} \\ & x^{2}=9k^{2}+6k+1 \equiv 1 \pmod{3}, \\ & x^{2}=9k^{2}+12k+4 \equiv 1 \pmod{3}, \text{ respectively. } \end{aligned}
Hence x20x^{2} \equiv 0 or 1(mod3)1 \pmod{3}, for every positive integer xx.

Without proof we will give the following lemma.

Lemma 2. If aa is a positive integer then aS(a)(mod3)a \equiv S(a) \pmod{3}, where S(a)S(a) is the sum of the digits of the number aa.

Further we have
(6k+1)6k+1=[(6k+1)k]6(6k+1)1(mod3)(6k+2)6k+2=[(6k+2)3k+1]21(mod3)(6k+3)6k+30(mod3)(6k+4)6k+4=[(6k+1)3k+2]21(mod3)(6k+5)6k+5=[(6k+5)3k+2]2(6k+5)2(mod3)(6k+6)6k+60(mod3) \begin{aligned} & (6k+1)^{6k+1}=\left[(6k+1)^{k}\right]^{6} \cdot (6k+1) \equiv 1 \pmod{3} \\ & (6k+2)^{6k+2}=\left[(6k+2)^{3k+1}\right]^{2} \equiv 1 \pmod{3} \\ & (6k+3)^{6k+3} \equiv 0 \pmod{3} \\ & (6k+4)^{6k+4}=\left[(6k+1)^{3k+2}\right]^{2} \equiv 1 \pmod{3} \\ & (6k+5)^{6k+5}=\left[(6k+5)^{3k+2}\right]^{2} \cdot (6k+5) \equiv 2 \pmod{3} \\ & (6k+6)^{6k+6} \equiv 0 \pmod{3} \end{aligned}
for every k=1,2,3,k=1,2,3, \ldots.

Let us separate the numbers 11,22,,200820081^{1}, 2^{2}, \ldots, 2008^{2008} into the following six classes: (6k+1)6k+1(6k+1)^{6k+1}, (6k+2)6k+2(6k+2)^{6k+2}, (6k+3)6k+3(6k+3)^{6k+3}, (6k+4)6k+4(6k+4)^{6k+4}, (6k+5)6k+5(6k+5)^{6k+5}, (6k+6)6k+6(6k+6)^{6k+6}, k=1,2,k=1,2,\ldots.

For k=1,2,3,k=1,2,3, \ldots let us denote by
sk=(6k+1)6k+1+(6k+2)6k+2+(6k+3)6k+3+(6k+4)6k+4+(6k+5)6k+5+(6k+6)6k+6s_{k}=(6k+1)^{6k+1}+(6k+2)^{6k+2}+(6k+3)^{6k+3}+(6k+4)^{6k+4}+(6k+5)^{6k+5}+(6k+6)^{6k+6}.

From (3) we have
sk1+1+0+1+2+02(mod3) s_{k} \equiv 1+1+0+1+2+0 \equiv 2 \pmod{3}
for every k=1,2,3,k=1,2,3, \ldots.

Let AA be the number obtained by writing one after the other (in some order) the numbers 11,22,,200820081^{1}, 2^{2}, \ldots, 2008^{2008}.

The sum of the digits, S(A)S(A), of the number AA is equal to the sum of the sums of digits, S(ii)S\left(i^{i}\right), of the numbers ii,i=1,2,,2008i^{i}, i=1,2, \ldots, 2008, and so, from Lemma 2, it follows that
AS(A)=S(11)+S(22)++S(20082008)11+22++20082008(mod3) A \equiv S(A)=S\left(1^{1}\right)+S\left(2^{2}\right)+\ldots+S\left(2008^{2008}\right) \equiv 1^{1}+2^{2}+\ldots+2008^{2008} \pmod{3}
Further on 2008=3346+42008=334 \cdot 6+4 and if we use (3) and (4) we get
A11+22++20082008s1+s2++s334+20052005+20062006+20072007+20082008(mod3)3342+1+1+0+1=6712(mod3) \begin{aligned} A & \equiv 1^{1}+2^{2}+\ldots+2008^{2008} \\ & \equiv s_{1}+s_{2}+\ldots+s_{334}+2005^{2005}+2006^{2006}+2007^{2007}+2008^{2008} \pmod{3} \\ & \equiv 334 \cdot 2+1+1+0+1=671 \equiv 2 \pmod{3} \end{aligned}
Finally, from Lemma 1, it follows that AA can not be 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: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.