Lucasian criteria for the primality of

Author:
Hans Riesel

Journal:
Math. Comp. **23** (1969), 869-875

MSC:
Primary 10.08

DOI:
https://doi.org/10.1090/S0025-5718-1969-0262163-1

MathSciNet review:
0262163

Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: Let with given. If is a necessary and sufficient criterion that be prime, this is called a Lucasian criterion for the primality of . Many such criteria are known, but the case has not been treated in full generality earlier. A theorem is proved that (by aid of computer) enables the effective determination of suitable numbers for any given , if . The method is used on all in the domain . The Lucasian criteria thus constructed are applied, and all primes in the domain are tabulated.

**[1]**E. L. Ince,*Cycles of Reduced Ideals in Quadratic Fields*, British Association for the Advancement of Science, London, 1934.**[2]**D. H. Lehmer, ``An extended theory of Lucas' functions,''*Ann. of Math.*, v. 31, 1930, pp. 419-448.**[3]**E. Lucas, ``Théorie des fonctions numériques simplement périodiques,''*Amer. J. Math.*, v. 1, 1878, pp. 184-239, pp. 289-321. MR**1505164****[4]**H. Riesel, ``A note on the prime numbers of the forms and ,''*Ark. Mat.*, v. 3, 1956, pp. 245-253. MR**17**, 945. MR**0076793 (17:945d)****[5]**H. C. Williams & C. R. Zarnke, ``A report on prime numbers of the forms and ,''*Math. Comp.*, v. 22, 1968, pp. 420-422. MR**37**#2680. MR**0227095 (37:2680)****[6]**R. M. Robinson, ``A report on primes of the form and on factors of Fermat numbers,''*Proc. Amer. Math. Soc.*, v. 9, 1958, pp. 673-681. MR**20**#3097. MR**0096614 (20:3097)**

Retrieve articles in *Mathematics of Computation*
with MSC:
10.08

Retrieve articles in all journals with MSC: 10.08

Additional Information

DOI:
https://doi.org/10.1090/S0025-5718-1969-0262163-1

Article copyright:
© Copyright 1969
American Mathematical Society