Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

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

 
 

 

A note on primality testing using Lucas sequences


Author: Michael A. Morrison
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
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

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 [Enhancements On Off] (What's this?)

  • [1] D. H. LEHMER, "An extended theory of Lucas functions," Ann. of Math., v. 31, 1930, pp. 442-443.
  • [2] E. LUCAS, "Théorie des fonctions numériques simplement périodiques," Amer. J. Math., v. 1, 1878, p. 302. MR 1505161

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

DOI: https://doi.org/10.1090/S0025-5718-1975-0369234-2
Keywords: Primality testing, Lucas sequences
Article copyright: © Copyright 1975 American Mathematical Society

American Mathematical Society