Timeline for Is 8 the largest cube in the Fibonacci sequence?
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Jun 10, 2017 at 0:05 | history | suggested | foobar | CC BY-SA 3.0 |
Fixed sign. Added citation to reach 6-character min for edits
|
| Jun 9, 2017 at 23:52 | review | Suggested edits | |||
| S Jun 10, 2017 at 0:05 | |||||
| Dec 12, 2015 at 23:32 | comment | added | Owen | If you look through all the results for ones that are 5 times a perfect square, it's only 0, 5 and 20. So that seems to answer the question completely. | |
| S May 27, 2014 at 21:48 | history | suggested | Marco Golla | CC BY-SA 3.0 |
added LaTeX code for formulae, to improve readability
|
| May 27, 2014 at 21:45 | review | Suggested edits | |||
| S May 27, 2014 at 21:48 | |||||
| Apr 7, 2010 at 22:40 | comment | added | Kevin Buzzard | [remark: the biggest integer point on either curve is 5*532^3+4=27438^2, but, unfortunately, 532 isn't a square] | |
| Apr 7, 2010 at 22:35 | comment | added | Kevin Buzzard | It's really easy to get a computer to find all the integer points on an elliptic curve, as I was just saying the other day at mathoverflow.net/questions/20286/… . Multiply up by 25 and we're looking for integer points to X^3+-100=Y^2 (with X,Y both multiples of 5). Both magma and sage have got this implemented now: you just type "IntegralPoints(EllipticCurve([0,100]));" into magma for one, and change 100 to -100 for the other. Both commands terminate in about 0.2 seconds. | |
| Apr 7, 2010 at 17:45 | history | edited | Alison Miller | CC BY-SA 2.5 |
added 25 characters in body
|
| Oct 22, 2009 at 1:56 | history | edited | Alison Miller | CC BY-SA 2.5 |
added addendum
|
| Oct 21, 2009 at 17:15 | history | answered | Alison Miller | CC BY-SA 2.5 |