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.

 

A note on primality testing using Lucas sequences
HTML articles powered by AMS MathViewer

by Michael A. Morrison PDF
Math. Comp. 29 (1975), 181-182 Request permission

Abstract:

For an odd integer $N > 1$, thought to be prime, a test is given which uses Lucas sequences and which can establish that any prime divisors of N are $\equiv \pm 1$ modulo the factored portion of $N + 1$.
References
    D. H. LEHMER, "An extended theory of Lucas functions," Ann. of Math., v. 31, 1930, pp. 442-443.
  • Edouard Lucas, Theorie des Fonctions Numeriques Simplement Periodiques, Amer. J. Math. 1 (1878), no. 2, 184–196 (French). MR 1505161, DOI 10.2307/2369308
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 10A25, 10-04
  • Retrieve articles in all journals with MSC: 10A25, 10-04
Additional Information
  • © Copyright 1975 American Mathematical Society
  • Journal: Math. Comp. 29 (1975), 181-182
  • MSC: Primary 10A25; Secondary 10-04
  • DOI: https://doi.org/10.1090/S0025-5718-1975-0369234-2
  • MathSciNet review: 0369234