# Fermat's theorem on sums of two squares

There's the Fermat's theorem on sums of two squares.

My question is, as the prime numbers that are 1 modulo 4 can be divided into the sum of two squares, will the squared number be unique?

For example, $41 = 4^2 + 5^2$ and the squared number will be 4 and 5.

-

Yes, if you don't take into account the order of the two numbers or $\pm$ sign in front of the numbers.

-

Just to complement Pantelis' answer, the reason why they are unique can be easily seen from the proof using the Gaussian integers $\mathbb{Z}[i]$, which is a UFD.

-

Primes of the form $p=4k+1\;$ have a unique decomposition as sum of squares $p=a^2+b^2$ with $0<a<b\;$, due to Thue's Lemma.

Further, primes of the form $p=4n+3$, never have a decomposition into $2$ squares, proven in various ways here.

-
BTW: Unique solutions seem to be quite rare, as this unanswered question indicates: Unique solutions for $n=\sum_{j=1}^{g(k)} a_j^k$ – draks ... Jul 11 '12 at 10:41