Problem - Sum of digit of $n$ and $n^2$

70 Views Asked by At

How can i prove that : There are infinitely many natural numbers $m \geq 0$ with sum of digits of $(m) = n$ and sum of digits of $(m^2) = $$($sum of digits of $(m))^2$ ?

1

There are 1 best solutions below

1
On

Hint: $$11, 101, 1001,\ldots$$