Proving Only 2 Positive Integer Solutions for x3 = y2 – 15

  • Thread starter Thread starter BenVitale
  • Start date Start date
  • Tags Tags
    Integer Positive
BenVitale
Messages
72
Reaction score
1
A problem asks to find all possible pairs (x, y) of positive integers that satisfy the equation:

x3 = y2 – 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 news on Phys.org
Siegel's theorem does not help you here. You need to find a method that let's you set some kind of quantifiable limit on the ratio of something to something. Wikipedia references something called "Baker's method", which could be worth investigating. Then you'd prove that the points you found are the only solutions, by proving that there are no solutions above X, and by checking all points up to X manually.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top