Lucas Pseudoprimes
- 1 October 1980
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 35 (152) , 1391-1417
- https://doi.org/10.2307/2006406
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 $f(n)$ for which the Jacobi symbol $(f(n)/n)$ is less than 1, we evaluate the average order of the function f.
Keywords
This publication has 9 references indexed in Scilit:
- The Pseudoprimes to 25 ⋅10 9Mathematics of Computation, 1980
- Some Observations on Primality TestingMathematics of Computation, 1978
- On Numbers Analogous to the Carmichael NumbersCanadian Mathematical Bulletin, 1977
- Some Algorithms for Prime Testing Using Generalized Lehmer FunctionMathematics of Computation, 1976
- Riemann's Hypothesis and tests for primalityPublished by Association for Computing Machinery (ACM) ,1975
- On Pseudoprimes Which are Products of Distinct PrimesThe American Mathematical Monthly, 1967
- The Gaussian Law of Errors in the Theory of Additive Number Theoretic FunctionsAmerican Journal of Mathematics, 1940
- An Extended Theory of Lucas' FunctionsAnnals of Mathematics, 1930
- Theorie des Fonctions Numeriques Simplement PeriodiquesAmerican Journal of Mathematics, 1878