%0 Journal Article
%T Infinitely Many Carmichael Numbers for a Modified Miller-Rabin Prime Test
%A Eric Bach
%A Rex Fernando
%J Computer Science
%D 2015
%I arXiv
%X 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.
%U http://arxiv.org/abs/1512.00444v2