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

Possible Duplicate:
Prove that $n$ is a sum of two squares?
Fermat’s theorem on sums of two squares

Is there any elementary proof for this theorem: A number $n$ is a sum of two squares if and only if all prime factors of of the form $4k+3$ have even exponent in the prime factorization of $n$.

share|cite|improve this question

marked as duplicate by draks ..., Gerry Myerson, Grigory M, Per Manne, rschwieb Nov 28 '12 at 14:45

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

As far as I remember, this wasn't that easy, needing the quadratic residue theorem and Euklid's identity (I hope it's called this way). – yo' Nov 28 '12 at 12:04

Well, it isn't that easy nor that straightforward. You need the following step (and I'm not saying this is the only way to prove, but I think is the most straightforward):

1) A prime $\,p\,$ is expressable as the sum of two (integer, all the time) squares iff $\,p=1\pmod 4\,$

2) The product of two sums of squares is again a sum of squares

3) Your claim.

For the above ne needs, imo, at least some basic group theory and some basic number theory. You check whether you know some of these.

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

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