I come to see this problem do not know if it's easy or difficult (I sense it's not hard) and I want to share it with members of MSE. It comes from a French source in which it says it is an Olympics problem but does not say what kind of Olympics. I really like it and I'm going to try to solve it and hope others here want to solve it too.
Prove that the integers of the form $N=\underbrace{111 . . . 1}_{n\space times}\space\underbrace{222 . . . 2}_{n+1\space times}\space5$ are perfect squares.
Hint:
$$10^{n+2}\frac{10^n-1}9+20\frac{10^{n+1}-1}9+5=\frac{10^{2n+2}+2\cdot10^{n+2}-10^{n+2}-20+45}9=\left(\frac{10^{n+1}+5}{3}\right)^2$$
and $10\bmod3=1$ hence $10^{n+1}\bmod3=1$.