pith. sign in

arxiv: 1512.00444 · v2 · pith:ZJRFS26Anew · submitted 2015-12-01 · 🧮 math.NT · cs.DS

Infinitely Many Carmichael Numbers for a Modified Miller-Rabin Prime Test

classification 🧮 math.NT cs.DS
keywords testcarmichaelmiller-rabinnumbersinfinitelymanyresultsvariant
0
0 comments X
read the original abstract

We define a variant of the Miller-Rabin primality test, which is in between Miller-Rabin and Fermat in terms of strength. We show that this test has infinitely many "Carmichael" numbers. We show that the test can also be thought of as a variant of the Solovay-Strassen test. We explore the growth of the test's "Carmichael" numbers, giving some empirical results and a discussion of one particularly strong pattern which appears in the results.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.