Prove that $x^2 + y^2 = z^n$ has a solution in $\mathbb{N}$, where $n$ belongs to $\mathbb{N}$, the set of all natural numbers.
My Attempt:
Without loss of generality we can assign $z$ a perfect square value.
For $n=1 , x^2 + y^2 = z = k^2$ clearly has many solutions in natural number( since x,z,k are Pythagorean triplets).
Let the expression have a solution for $n = m$. Let it be $( x_1, y_1, z_1 = k_1^2 )$. Therefore,
$
x_1^2 + y_1^2 = z_1^m = k_1^{2m}
$
For $n = m+1$,
\begin{align*}
x^2 + y^2 &= z^{m+1}\\
\Rightarrow x^2 + y^2 &= z^mz
\end{align*}
clearly $(k_1.x_1, k_1.y_1, k_1.z_1 = k_1^2 )$ is a sol. of the equation, i.e.,
$(k_1.x_1)^2 + (k_1.y_1)^2 = z_1^m k_1^2$
$=>(k_1.x_1)^2 + (k_1.y_1)^2 = z1^2$
Thus, it is proved by induction.
Can You please tell me if my method is right. Is it justifiable to take z a perfect square?
Also, can you provide a non-induction proof? ( but before you do please tell me if my method is correct or not)