A problem asks to find all possible pairs (x, y) of positive integers that satisfy the equation:(adsbygoogle = window.adsbygoogle || []).push({});

x^{3}= y^{2}– 15

There are 2 pairs (so far) that satisfy the equation:

x = 1, y = 4

x = 109, y = 1138

It's possible that these 2 points are the only two positive integer solutions.

Siegel's theorem states that an elliptic curve can have only a finite number of points with integer coordinates.

Could there be other points for that curve? If not, how to prove that these 2 points are the only solutions?

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Elliptic curves

Loading...

Similar Threads - Elliptic curves | Date |
---|---|

Constructing elliptic curves | Feb 10, 2013 |

Area of a Triangle and Elliptic Curves - Birch and Swinnerton Dyer Conjecture | Mar 27, 2012 |

Endomorphism ring over an elliptic curve | Aug 23, 2011 |

Question about Elliptic curves taken over the algebraic closure of the Rationals | Jan 21, 2011 |

Elliptic Curve y^2 = x^3 +17; show N_p = p | Mar 30, 2010 |

**Physics Forums - The Fusion of Science and Community**