News for hackers. Stuff that matters.
Re:One-sentence proof of Fermat's theorem on sums of two squ... by enugu on Tuesday July 26, 2016 @04:13PM (#12168452)
Some context - knowing if a number can be written as a sum of squares can be reduced to determining whether its factors can be written as a sum of squares (proof of this involves the fact that norm of complex numbers respects multiplication). So the prime case becomes important. 4n+3 type primes cant be written as squares are either 0 or 1 modulo 4. 2 can be written. Which leaves the 4n+1 prime case which is fermats theorem.
Re:One-sentence proof of Fermat's theorem on sums of two squ... by CurtMonash on Tuesday July 26, 2016 @11:14PM (#12170256)
Indeed. :)

However, I noted a few more steps in my post.