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.


Lucas pseudoprimes
HTML articles powered by AMS MathViewer

by Robert Baillie and Samuel S. Wagstaff PDF
Math. Comp. 35 (1980), 1391-1417 Request permission


We define several types of pseudoprimes with respect to Lucas sequences and prove the analogs of various theorems about ordinary pseudoprimes. For example, we show that Lucas pseudoprimes are rare and we count the Lucas sequences modulo n with respect to which n is a Lucas pseudoprime. We suggest some powerful new primality tests which combine Lucas pseudoprimes with ordinary pseudoprimes. Since these tests require the evaluation of the least number $f(n)$ for which the Jacobi symbol $(f(n)/n)$ is less than 1, we evaluate the average order of the function f.
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 10A25
  • Retrieve articles in all journals with MSC: 10A25
Additional Information
  • © Copyright 1980 American Mathematical Society
  • Journal: Math. Comp. 35 (1980), 1391-1417
  • MSC: Primary 10A25
  • DOI:
  • MathSciNet review: 583518