Solution:
We will use the following lemmas.
Lemma 1. If x∈N, then x2≡0 or 1(mod3).
Proof: Let x∈N, then x=3k, x=3k+1 or x=3k+2, hence
x2=9k2≡0(mod3)x2=9k2+6k+1≡1(mod3),x2=9k2+12k+4≡1(mod3), respectively.
Hence x2≡0 or 1(mod3), for every positive integer x.
Without proof we will give the following lemma.
Lemma 2. If a is a positive integer then a≡S(a)(mod3), where S(a) is the sum of the digits of the number a.
Further we have
(6k+1)6k+1=[(6k+1)k]6⋅(6k+1)≡1(mod3)(6k+2)6k+2=[(6k+2)3k+1]2≡1(mod3)(6k+3)6k+3≡0(mod3)(6k+4)6k+4=[(6k+1)3k+2]2≡1(mod3)(6k+5)6k+5=[(6k+5)3k+2]2⋅(6k+5)≡2(mod3)(6k+6)6k+6≡0(mod3)
for every k=1,2,3,….
Let us separate the numbers 11,22,…,20082008 into the following six classes: (6k+1)6k+1, (6k+2)6k+2, (6k+3)6k+3, (6k+4)6k+4, (6k+5)6k+5, (6k+6)6k+6, k=1,2,….
For k=1,2,3,… 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+6.
From (3) we have
sk≡1+1+0+1+2+0≡2(mod3)
for every k=1,2,3,….
Let A be the number obtained by writing one after the other (in some order) the numbers 11,22,…,20082008.
The sum of the digits, S(A), of the number A is equal to the sum of the sums of digits, S(ii), of the numbers ii,i=1,2,…,2008, and so, from Lemma 2, it follows that
A≡S(A)=S(11)+S(22)+…+S(20082008)≡11+22+…+20082008(mod3)
Further on 2008=334⋅6+4 and if we use (3) and (4) we get
A≡11+22+…+20082008≡s1+s2+…+s334+20052005+20062006+20072007+20082008(mod3)≡334⋅2+1+1+0+1=671≡2(mod3)
Finally, from Lemma 1, it follows that A can not be a perfect square.