$6, 96, 996, 9996,\dots, 99999\cdots996,\dots$
Consider the above number sequence. Here in the $n$ $^{th}$ term $n-1$ digits are $9$. How can we tell about the existence of a perfect square number in this sequence?
$6, 96, 996, 9996,\dots, 99999\cdots996,\dots$
Consider the above number sequence. Here in the $n$ $^{th}$ term $n-1$ digits are $9$. How can we tell about the existence of a perfect square number in this sequence?
The sum of the digits of the $n^{th}$ term of this sequence is $$\text{Sum}=9(n-1)+6=9n-3=3(3n-1)$$ Thus, every number in the sequence is divisible by $3$ but not by $9$. Hence, no number in the sequence can be a perfect square.