I like to build math problems; to solve the one below I should first find a certain square and use it in my solution. I would want to know if anyone can solve this problem otherwise. Thanks.
Problem. Prove that there are infinitely many natural numbers whose decimal notations end with 2015 and whose squares begin with 2015; in other words, numbers $x$ that satisfy
$$x = a_na_{n-1}......2015$$
$$x^2 = 2015b_{m-4}b_{m-5}.....b_2b_1b_0$$
Claim: $2015\cdot 10^{2k+4}<(4489\cdot 10^k + 2015)^2 <2016\cdot 10^{2k+4}$ for all $k\geq 4$
You have: $(4489\cdot 10^k + 2015)^2 = 4489^2\cdot 10^{2k} + 2\cdot 2015\cdot 4489\cdot 10^k + 2015^2$
Trivially $2015\cdot 10^{2k+4} = 20150000\cdot 10^{2k} < 20151129\cdot 10^{2k} = 4489^2\cdot 10^{2k} < (4489\cdot 10^k+2015)^2$
And
$2\cdot 2015\cdot 4489\cdot 10^k + 2015^2 \leq 2\cdot2015\cdot 4489\cdot 10^k + 2015^2\cdot 10^{k-4}= 180910760225\cdot 10^{k-4}=1809.10760225\cdot 10^{k+4}\leq 1809.10760225\cdot 10^{2k}<1810\cdot 10^{2k}$
So
$(4489\cdot 10^k + 2015)^2 \leq 20151129\cdot 10^{2k} + 2\cdot 2015\cdot 4489\cdot 10^k + 2015^2 < 20151129\cdot 10^{2k} + 1810\cdot 10^{2k} = 20152939\cdot 10^{2k} < 2016\cdot 10^{2k+4}$
Thus the claim is proven that for every $k\geq 4$ you have $2015\cdot 10^{2k+4}<(4489\cdot 10^k + 2015)^2 <2016\cdot 10^{2k+4}$.
Notice finally that means that $4489\cdot 10^k+2015$ ends with the digits $2015$, and its square begins with the digits $2015$. Since this is true for every $k\geq 4$, it is true for infinitely many such natural numbers.