Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

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

 

 

Effective primality tests for some integers of the forms $ A5\sp n-1$ and $ A7\sp n-1$


Author: H. C. Williams
Journal: Math. Comp. 48 (1987), 385-403
MSC: Primary 11Y11; Secondary 11A51
DOI: https://doi.org/10.1090/S0025-5718-1987-0866123-X
MathSciNet review: 866123
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: It is shown how polynomial time prime tests, which are both fast and deterministic, can be developed for many numbers of the form $ A{r^n} - 1\;(r = 5,7;A < {r^n})$. These tests, like the Lucas-Lehmer test for the primality of the Mersenne numbers, are derived by using the properties of the Lucas functions. We exemplify these ideas by using numbers of the form $ 2 \cdot {10^n} - 1$.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 11Y11, 11A51

Retrieve articles in all journals with MSC: 11Y11, 11A51


Additional Information

DOI: https://doi.org/10.1090/S0025-5718-1987-0866123-X
Article copyright: © Copyright 1987 American Mathematical Society