Let $n\geq 0$ be a nonnegative integer.
I observed that the expression $3n6n3^2+4n8n4^2$ is always a perfect square where $n$ represents number of "0". And I had verified it by using a calculator for at at most 7 digit composition of $3n6n3$ and $4n8n4$. That is:
$n=0:363^2+484^2=605^2$
$n=1:30603^2+40804^2=51005^2$
$n=2:3006003^2+4008004^2=5010005^2$
This computations put me on the affirmative side that in general as $n$ runs through positive integers the given sum always yields a perfect square.
But when im trying to prove it, I dont know where I will start.
Can someone help me prove that the expression $3n6n3^2+4n8n4^2$ always yields a perfect square? Thanks a lot.
In more usual notation, your observation is that whenever $b$ is a power of $10$, the number $$ (3b^2+6b+3)^2 + (4b^2 + 8b + 4)^2 $$ is always a perfect square.
This holds even if $b$ is not a power of $10$. We have $$ \begin{align} &(3b^2+6b+3)^2 + (4b^2 + 8b + 4)^2 \\ ={}& (3(b^2+2b+1))^2 + (4(b^2+2b+1))^2 \\ ={}& 9\cdot(b^2+2b+1)^2 + 16 \cdot (b^2+2b+1)^2 \\ ={}& (9+16)\cdot (b^2+2b+1)^2 \\ ={}& 25\cdot (b^2+2b+1)^2 \\ ={}& (5(b^2+2b+1))^2 \end{align} $$
It also happens that $b^2+2b+1$ itself is a perfect square (namely of $b+1$), but that is not necessary for the rewriting to work.