Timeline for answer to Fermat's Last Theorem and Computability Theory by Alex B.
Current License: CC BY-SA 2.5
Post Revisions
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 23, 2010 at 23:43 | comment | added | Alex B. | @David I am aware of that paper. To prove the first case of FLT does not mean to prove it for that exponent. | |
| Dec 23, 2010 at 22:08 | comment | added | David Hansen | Roger Heath-Brown (and Fouvry independently) proved FLT for infinitely many primes in 1985. See Heath-Brown's paper "The first case of Fermat's last theorem", Inventiones vol. 79. | |
| Dec 23, 2010 at 6:01 | history | edited | Alex B. | CC BY-SA 2.5 |
added 479 characters in body
|
| Dec 23, 2010 at 0:59 | history | answered | Alex B. | CC BY-SA 2.5 |