# Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

## Finding strong pseudoprimes to several bases. IIHTML articles powered by AMS MathViewer

by Zhenxiang Zhang and Min Tang
Math. Comp. 72 (2003), 2085-2097 Request permission

## Abstract:

Define $\psi _m$ to be the smallest strong pseudoprime to all the first $m$ prime bases. If we know the exact value of $\psi _m$, we will have, for integers $n<\psi _m$, a deterministic efficient primality testing algorithm which is easy to implement. Thanks to Pomerance et al. and Jaeschke, the $\psi _m$ are known for $1 \leq m \leq 8$. Upper bounds for $\psi _9,\psi _{10} \text { and } \psi _{11}$ were first given by Jaeschke, and those for $\psi _{10} \text { and } \psi _{11}$ were then sharpened by the first author in his previous paper (Math. Comp. 70 (2001), 863–872). In this paper, we first follow the first author’s previous work to use biquadratic residue characters and cubic residue characters as main tools to tabulate all strong pseudoprimes (spsp’s) $n<10^{24}$ to the first five or six prime bases, which have the form $n=p q$ with $p, q$ odd primes and $q-1=k(p-1), k=4/3, 5/2, 3/2, 6$; then we tabulate all Carmichael numbers $<10^{20}$, to the first six prime bases up to 13, which have the form $n=q_1q_2q_3$ with each prime factor $q_i\equiv 3\mod 4$. There are in total 36 such Carmichael numbers, 12 numbers of which are also spsp’s to base 17; 5 numbers are spsp’s to bases 17 and 19; one number is an spsp to the first 11 prime bases up to 31. As a result the upper bounds for $\psi _{9}, \psi _{10}$ and $\psi _{11}$ are lowered from 20- and 22-decimal-digit numbers to a 19-decimal-digit number: \begin{equation*} \begin {split} \psi _{9}\leq \psi _{10}\leq \psi _{11}\leq Q_{11} &=3825\;12305\;65464\;13051\;\text { (19 digits)}\\ &= 149491\cdot 747451\cdot 34233211. \end{split} \end{equation*} We conjecture that $\psi _{9}= \psi _{10}= \psi _{11}=3825\;12305\;65464\;13051,$ and give reasons to support this conjecture. The main idea for finding these Carmichael numbers is that we loop on the largest prime factor $q_3$ and propose necessary conditions on $n$ to be a strong pseudoprime to the first $5$ prime bases. Comparisons of effectiveness with Arnault’s, Bleichenbacher’s, Jaeschke’s, and Pinch’s methods for finding (Carmichael) numbers with three prime factors, which are strong pseudoprimes to the first several prime bases, are given.
References
Similar Articles
• Retrieve articles in Mathematics of Computation with MSC (2000): 11Y11, 11A15, 11A51
• Retrieve articles in all journals with MSC (2000): 11Y11, 11A15, 11A51