Timeline for Solutions to x^2+n=y^3 diophantine equation [closed]
Current License: CC BY-SA 3.0
6 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Dec 13, 2013 at 21:47 | comment | added | Gerry Myerson | I don't oppose closing this question, but to say that "How do you solve equations like $x^2+5=y^3$?" "does not appear to be about research level mathematics" is quite absurd. | |
Dec 13, 2013 at 9:43 | history | closed |
Will Jagy Jack Huizenga Lucia Andrey Rekalo Dietrich Burde |
Not suitable for this site | |
Dec 13, 2013 at 9:15 | answer | added | Gerry Myerson | timeline score: 3 | |
Dec 13, 2013 at 6:11 | review | Close votes | |||
Dec 13, 2013 at 9:45 | |||||
Dec 13, 2013 at 5:58 | comment | added | KConrad | For $n = 5$ you can use reduction mod 4. See Theorem 2.2 of math.uconn.edu/~kconrad/blurbs/gradnumthy/mordelleqn1.pdf. | |
Dec 13, 2013 at 5:51 | history | asked | Thomas | CC BY-SA 3.0 |