Primitive divisors of Lucas and Lehmer sequences, II

Paul Voutier

Published 2012-11-13Version 1

Let $\al$ and $\be$ be conjugate complex algebraic integers which generate Lucas or Lehmer sequences. We present an algorithm to search for elements of such sequences which have no primitive divisors. We use this algorithm to prove that for all $\al$ and $\be$ with $\hgt(\be/\al) \leq 4$, the $n$-th element of these sequences has a primitive divisor for $n > 30$. In the course of proving this result, we give an improvement of a result of Stewart concerning more general sequences.