Lucas pseudoprimes

Authors:
Robert Baillie and Samuel S. Wagstaff

Journal:
Math. Comp. **35** (1980), 1391-1417

MSC:
Primary 10A25

MathSciNet review:
583518

Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: We define several types of pseudoprimes with respect to Lucas sequences and prove the analogs of various theorems about ordinary pseudoprimes. For example, we show that Lucas pseudoprimes are rare and we count the Lucas sequences modulo *n* with respect to which *n* is a Lucas pseudoprime. We suggest some powerful new primality tests which combine Lucas pseudoprimes with ordinary pseudoprimes. Since these tests require the evaluation of the least number for which the Jacobi symbol is less than 1, we evaluate the average order of the function *f*.

**[1]**John Brillhart, D. H. Lehmer, and J. L. Selfridge,*New primality criteria and factorizations of 2^{𝑚}±1*, Math. Comp.**29**(1975), 620–647. MR**0384673**, 10.1090/S0025-5718-1975-0384673-1**[2]**N. G. DE BRUIJN, "On the number of positive integers and free of prime factors ,"*Indag. Math.*, v. 13, 1951, pp. 50-60. MR**13**, 724.**[3]**D. A. Burgess,*On character sums and 𝐿-series*, Proc. London Math. Soc. (3)**12**(1962), 193–206. MR**0132733****[4]**P. D. T. A. Elliott,*A conjecture of Erdős concerning character sums*, Nederl. Akad. Wetensch. Proc. Ser. A 72=Indag. Math.**31**(1969), 164–171. MR**0242780****[5]**P. D. T. A. Elliott,*On the mean value of 𝑓(𝑝)*, Proc. London Math. Soc. (3)**21**(1970), 28–96. MR**0266881****[6]**P. Erdös and M. Kac,*The Gaussian law of errors in the theory of additive number theoretic functions*, Amer. J. Math.**62**(1940), 738–742. MR**0002374****[7]**P. Erdös,*On pseudoprimes and Carmichael numbers*, Publ. Math. Debrecen**4**(1956), 201–206. MR**0079031****[8]**Pál Erdős,*Remarks on number theory. I*, Mat. Lapok**12**(1961), 10–17 (Hungarian, with Russian and English summaries). MR**0144869****[9]**G. H. HARDY & E. M. WRIGHT,*An Introduction to the Theory of Numbers*, 4th ed., Oxford Univ. Press, London, 1959.**[10]**D. H. Lehmer,*An extended theory of Lucas’ functions*, Ann. of Math. (2)**31**(1930), no. 3, 419–448. MR**1502953**, 10.2307/1968235**[11]**EMMA LEHMER, "On the infinitude of Fibonacci pseudo-primes,"*Fibonacci Quart.*, v. 2, 1964, pp. 229-230.**[12]**Edouard Lucas,*Theorie des Fonctions Numeriques Simplement Periodiques*, Amer. J. Math.**1**(1878), no. 4, 289–321 (French). MR**1505176**, 10.2307/2369373**[13]**D. E. G. MALM, "On Monte-Carlo primality tests,"*Notices Amer. Math. Soc.*, v. 24, 1977, p. A-529. Abstract #77T-A22.**[14]**Gary L. Miller,*Riemann’s hypothesis and tests for primality*, Seventh Annual ACM Symposium on Theory of Computing (Albuquerque, N.M., 1975), Assoc. Comput. Mach., New York, 1975, pp. 234–239. MR**0480296****[15]**Ivan Niven and Herbert S. Zuckerman,*An introduction to the theory of numbers*, 3rd ed., John Wiley & Sons, Inc., New York-London-Sydney, 1972. MR**0344181****[16]**Edward A. Parberry,*On primes and pseudo-primes related to the Fibonacci sequence*, Fibonacci Quart.**8**(1970), no. 1, 49–60. MR**0262199****[17]**Carl Pomerance, J. L. Selfridge, and Samuel S. Wagstaff Jr.,*The pseudoprimes to 25⋅10⁹*, Math. Comp.**35**(1980), no. 151, 1003–1026. MR**572872**, 10.1090/S0025-5718-1980-0572872-7**[18]**A. Rotkiewicz,*On the pseudoprimes with respect to the Lucas sequences*, Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys.**21**(1973), 793–797 (English, with Russian summary). MR**0332640****[19]**K. Szymiczek,*On pseudoprimes which are products of distinct primes*, Amer. Math. Monthly**74**(1967), no. 1, 35–37. MR**0205921****[20]**H. C. Williams and J. S. Judd,*Determination of the primality of 𝑁 by using factors of 𝑁²±1*, Math. Comp.**30**(1976), no. 133, 157–172. MR**0396390**, 10.1090/S0025-5718-1976-0396390-3**[21]**H. C. Williams and J. S. Judd,*Some algorithms for prime testing using generalized Lehmer functions*, Math. Comp.**30**(1976), no. 136, 867–886. MR**0414473**, 10.1090/S0025-5718-1976-0414473-6**[22]**H. C. Williams,*On numbers analogous to the Carmichael numbers*, Canad. Math. Bull.**20**(1977), no. 1, 133–143. MR**0447099****[23]**H. C. Williams and R. Holte,*Some observations on primality testing*, Math. Comp.**32**(1978), no. 143, 905–917. MR**0476625**, 10.1090/S0025-5718-1978-0476625-0**[24]**Masataka Yorinaga,*A technique of numerical production of a sequence of pseudo-prime numbers*, Math. J. Okayama Univ.**19**(1976/77), no. 1, 1–4. MR**0432522****[25]**Masataka Yorinaga,*On a congruencial property of Fibonacci numbers–numerical experiments*, Math. J. Okayama Univ.**19**(1976/77), no. 1, 5–10. MR**0432525****[26]**Masataka Yorinaga,*On a congruencial property of Fibonacci numbers–considerations and remarks*, Math. J. Okayama Univ.**19**(1976/77), no. 1, 11–17. MR**0432526****[27]**A. Rotkiewicz,*On Lucas numbers with two intrinsic prime divisors*, Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys.**10**(1962), 229–232. MR**0139592**

Retrieve articles in *Mathematics of Computation*
with MSC:
10A25

Retrieve articles in all journals with MSC: 10A25

Additional Information

DOI:
http://dx.doi.org/10.1090/S0025-5718-1980-0583518-6

Keywords:
Pseudoprime,
Lucas sequence,
Lucas pseudoprime,
strong pseudoprime,
Euler pseudoprime,
primality testing

Article copyright:
© Copyright 1980
American Mathematical Society