Timeline for Enumerating ways to decompose an integer into the sum of two squares
Current License: CC BY-SA 2.5
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 31, 2018 at 10:29 | answer | added | Beni Bogosel | timeline score: 2 | |
| Feb 17, 2018 at 8:07 | comment | added | Mark Bennet | Note also $65^2+65^2$ | |
| May 12, 2015 at 15:05 | answer | added | KalEl | timeline score: 1 | |
| Dec 6, 2014 at 21:14 | answer | added | pts | timeline score: 3 | |
| Jul 19, 2010 at 6:25 | vote | accept | MathMonkey | ||
| Jun 27, 2010 at 8:01 | comment | added | Robin Chapman | If one can obtain two essentially distinct representations: $n=a^2+b^2=c^2+d^2$, then one can factor $n$ nontrivially. Just take the gcd of $a+bi$ and $c+di$ in the Gaussian integers, and take the norm. The moral: it cannot be much harder to factor $n$ first and build up from representations of primes as sums of two squares as suggested by Gerry. | |
| Jun 27, 2010 at 1:41 | answer | added | Will Jagy | timeline score: 14 | |
| Jun 26, 2010 at 22:41 | answer | added | Gerry Myerson | timeline score: 23 | |
| Jun 26, 2010 at 22:08 | comment | added | Qiaochu Yuan | ("Subfactors" refers to a completely different mathematical concept, so I have removed the tag.) | |
| Jun 26, 2010 at 22:07 | history | edited | Qiaochu Yuan | CC BY-SA 2.5 |
deleted 2 characters in body; edited tags
|
| Jun 26, 2010 at 22:07 | comment | added | Qiaochu Yuan | The prime factorization of N tells you its prime factorization over the Gaussian integers (en.wikipedia.org/wiki/Gaussian_integer), and then you're just counting all the ways to split N into the product of two Gaussian integers (up to units). | |
| Jun 26, 2010 at 22:05 | history | asked | MathMonkey | CC BY-SA 2.5 |