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
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