The least Carmichael numbers with $k$ prime factors

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$.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-16
DOI
https://doi.org/10.48550/arxiv.2611.21013
Primary Topic
Analytic Number Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The least Carmichael numbers with $k$ prime factors

Sylvia Webster, Jonathan Webster
arXiv (Cornell University)
Analytic Number Theory Research
preprint

The least Carmichael numbers with $k$ prime factors

Sylvia Webster, Jonathan Webster
preprint en

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$.

arXiv (Cornell University)
Analytic Number Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon