Primitive divisors of Lucas and Lehmer sequences. II

From MaRDI portal
Publication:679090




Abstract: Let al and 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 with , 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.




Cited in
(28)






This page was built for publication: Primitive divisors of Lucas and Lehmer sequences. II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q679090)