MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

What is the best algorithm to find all the integer points (X,Y) on this curve

$X^3+aX-bY^3=m,a,b,m\in\mathbb{Z}$(a>0,b>0,b is not a cubic number)?

share|cite|improve this question

Strictly speaking, the only algorithm of which I'm aware for solving such cubic Thue equations goes via lower bounds for linear forms in complex logarithms (and lattice basis reduction) and is described in, for example, a paper of Tzanakis and de Weger [JNT 31 (1989), 99-132]. Approaches based on Skolem's $p$-adic method or on lower bounds for linear forms in elliptic logarithms should typically work here too.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.