Abstract
Lehmer [3] and Reisel [7] have devised tests for determining the primality of integers of the form A2n—1. Tables of primes of these forms may be found in [7] and Williams and Zarnke [10]. Little work, however, seems to have been done on integers of the form N=2A3n—1. Lucas [6] gave conditions that were only sufficient for the primality of N. Recently Lehmer [4] has given a method for determining the primality of an integer N if the factorization of N+1 is known.
Publisher
Canadian Mathematical Society
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Applications;CMS/CAIMS Books in Mathematics;2023
2. Primality test for numbers of the form Apn+wn;Journal of Discrete Algorithms;2015-07
3. On the primality of 2h·3n+1;Discrete Mathematics;2001-10
4. Deterministic primality test for numbers of the form $A^2.3^n+1$, $n \ge 3$ odd;Proceedings of the American Mathematical Society;2001-09-19
5. Explicit primality criteria for $(p-1)p^n-1$;Mathematics of Computation;2000-02-23