2 papers
math.NT2026
Algorithms for Carmichael numbers
Andrew Shallue, Jonathan Webster
Our primary concern is the computational complexity of algorithms that find all Carmichael numbers less than some specified bound . We have three related results. First, we show…
math.NT2024
Advances in Tabulating Carmichael Numbers
Andrew Shallue, Jonathan Webster
We report that there are Carmichael numbers less than which is an order of magnitude improvement on Richard Pinch's prior work. We find Carmichael numbers of t…