Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Primitive divisors of Lucas and Lehmer sequences
HTML articles powered by AMS MathViewer

by Paul M. Voutier PDF
Math. Comp. 64 (1995), 869-888 Request permission

Abstract:

Stewart reduced the problem of determining all Lucas and Lehmer sequences whose nth element does not have a primitive divisor to solving certain Thue equations. Using the method of Tzanakis and de Weger for solving Thue equations, we determine such sequences for $n \leq 30$. Further computations lead us to conjecture that, for $n > 30$, the nth element of such sequences always has a primitive divisor.
References
Similar Articles
Additional Information
  • © Copyright 1995 American Mathematical Society
  • Journal: Math. Comp. 64 (1995), 869-888
  • MSC: Primary 11D61; Secondary 11B39, 11Y50
  • DOI: https://doi.org/10.1090/S0025-5718-1995-1284673-6
  • MathSciNet review: 1284673