Suppose that
is a Lucas sequence, and suppose that l1, … , lt are primes. We show that the equation

has only finitely many solutions. Moreover, we explain a practical method of solving these equations. For example, if
is the Fibonacci sequence, then we solve the equation

under the restrictions: p is prime and m < p.
Received: 2005-12-19
Revised: 2006-07-18
Published Online: 2007-11-14
Published in Print: 2007-10-26
© Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Uniform bounds for two variable real oscillatory integrals and singularities of mappings
- On the first and second variations of a nonlocal isoperimetric problem
- Perfect powers from products of terms in Lucas sequences
- Multiple recurrence and convergence for sequences related to the prime numbers
- Transfinite diameter and the resultant
- Rational computations of the topological K-theory of classifying spaces of discrete groups
- On a question of Igusa III: A generalized Poisson formula for pairs of polynomials
- On the logarithmic Kobayashi conjecture
Articles in the same Issue
- Uniform bounds for two variable real oscillatory integrals and singularities of mappings
- On the first and second variations of a nonlocal isoperimetric problem
- Perfect powers from products of terms in Lucas sequences
- Multiple recurrence and convergence for sequences related to the prime numbers
- Transfinite diameter and the resultant
- Rational computations of the topological K-theory of classifying spaces of discrete groups
- On a question of Igusa III: A generalized Poisson formula for pairs of polynomials
- On the logarithmic Kobayashi conjecture