Strong Carmichael numbers

D. H. Lehmer

doi:10.1017/S1446788700019364

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A composite number N is called a pseudoprime for the base a in case . An odd pseudoprime N is called strong for the base a.

Crossref Citations

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Williams, H. C. 1977. On Numbers Analogous to the Carmichael Numbers. Canadian Mathematical Bulletin, Vol. 20, Issue. 1, p. 133.

Poorten, A. J. van der and Rotkiewicz, A. 1980. On strong pseudoprimes in arithmetic progressions. Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, Vol. 29, Issue. 3, p. 316.

Rotkiewicz, A. 1980. Arithmetical progressions formed from three different Euler pseudoprimes for the odd basea. Rendiconti del Circolo Matematico di Palermo, Vol. 29, Issue. 3, p. 420.

Pomerance, Carl Selfridge, J. L. and Wagstaff, Samuel S. 1980. The pseudoprimes to 25⋅10⁹. Mathematics of Computation, Vol. 35, Issue. 151, p. 1003.

Guy, Richard K. 1981. Unsolved Problems in Number Theory. p. 3.

Pomerance, Carl 1981. Recent developments in primality testing. The Mathematical Intelligencer, Vol. 3, Issue. 3, p. 97.

Rotkiewicz, A. 1982. On Euler Lehmer pseudoprimes and strong Lehmer pseudoprimes with parameters 𝐿, 𝑄 in arithmetic progressions. Mathematics of Computation, Vol. 39, Issue. 159, p. 239.

Cohen, H. and Lenstra, H. W. 1984. Primality testing and Jacobi sums. Mathematics of Computation, Vol. 42, Issue. 165, p. 297.

Dixon, John D. 1984. Factorization and Primality Tests. The American Mathematical Monthly, Vol. 91, Issue. 6, p. 333.

Erdős, Paul and Pomerance, Carl 1986. On the number of false witnesses for a composite number. Mathematics of Computation, Vol. 46, Issue. 173, p. 259.

Ribenboim, Paulo 1988. The Book of Prime Number Records. p. 13.

Ribenboim, Paulo 1989. The Book of Prime Number Records. p. 13.

Ribenboim, Paulo 1991. The Little Book of Big Primes. p. 11.

Alford, W. R. Granville, Andrew and Pomerance, Carl 1994. Algorithmic Number Theory. Vol. 877, Issue. , p. 1.

Guy, Richard K. 1994. Unsolved Problems in Number Theory. Vol. 1, Issue. , p. 3.

Guy, Richard K. 2004. Unsolved Problems in Number Theory. Vol. 1, Issue. , p. 3.

2006. Die Welt der Primzahlen. p. 15.

Ribenboim, Paulo 2011. Die Welt der Primzahlen. p. 15.

EKSTROM, AARON POMERANCE, CARL and THAKUR, DINESH S. 2012. INFINITUDE OF ELLIPTIC CARMICHAEL NUMBERS. Journal of the Australian Mathematical Society, Vol. 92, Issue. 1, p. 45.

Article contents

Strong Carmichael numbers

Extract

References

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Article contents

Strong Carmichael numbers

Extract

References

Save article to Kindle

Save article to Dropbox

Save article to Google Drive

Reply to: Submit a response

Your details

You have entered the maximum number of contributors

Conflicting interests