Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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.

share|cite|improve this question
up vote 5 down vote accepted

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

share|cite|improve this answer

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.

share|cite|improve this answer

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.

share|cite|improve this answer
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

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.