Timeline for How to solve a Diophantine equation in six variables? [closed]
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 26, 2019 at 14:55 | history | closed |
abx Dima Pasechnik Tom De Medts Sean Lawton R.P. |
Not suitable for this site | |
| Mar 26, 2019 at 14:54 | answer | added | Robert Israel | timeline score: 1 | |
| Mar 26, 2019 at 14:46 | comment | added | user74900 | @ThiKu I think you do not really need full modularity of elliptic curves over Q for Fermat's theorem; I think it was proved after Fermat's theorem has been proved. Or do you mean something else? | |
| Mar 26, 2019 at 14:31 | comment | added | Robert Israel | $3125+4563=7688$ ($a=5,b=5,c=13,d=3,e=31,f=2$). | |
| Mar 26, 2019 at 9:03 | comment | added | Gerry Myerson | $100+243=343$ ($a,b,c,d,e,f=10,1,3,3,1,7$). $1+675=676$. | |
| Mar 26, 2019 at 8:25 | review | Close votes | |||
| Mar 26, 2019 at 14:55 | |||||
| Mar 26, 2019 at 8:21 | comment | added | Wojowu | $a=2,b=1,c=11,d=1,e=1,f=5$ | |
| Mar 26, 2019 at 8:15 | comment | added | ThiKu | As you say, this is harder than proving the modularity of elliptic curves. | |
| Mar 26, 2019 at 8:04 | history | edited | Denis Serre | CC BY-SA 4.0 |
edited title
|
| Mar 26, 2019 at 7:56 | history | asked | DSop | CC BY-SA 4.0 |