Paperlane

no. 16 · Tuesday 17 November 2026

The least Carmichael numbers with $k$ prime factors

Jonathan Webster and Sylvia Webster

math.NT

Abstract

Let $S_k$ denote the least Carmichael number with exactly $k$ prime factors. Like the later searches of Pinch, our algorithm builds the prime factors of a candidate in increasing order and stops as soon as the preproduct $P$ satisfies $Pλ(P) > B$. At that point there is at most one possible cofactor, and we recover all of its prime factors at once in polynomial time. We prove an unconditional bound on the number of candidates the search examines, in terms of how far $B$ exceeds the product of the first $k$ primes. When the search is run in doubling passes, this gives a running time of $e^{O(k)} = S_k^{O(1/\log k)}$ under a natural conjecture on the size of $S_k$. We also show that the constant in the exponent is sharp for the set of square-free numbers that the bound counts. Finally, we compute $S_k$ for every $k \leq 64$; Pinch had computed it for $k \leq 35$.

fields
Number Theory
pdf ↗ page arXiv:2611.21013 ↗