2 papers
math.NT2026
Primes and almost primes between cubes
Daniel R. Johnston, Jonathan P. Sorenson, Simon N. Thomas +1
In this paper we study the problem of detecting prime numbers between all consecutive cubes. Firstly, we use a large computation to show that there is always a prime between …
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…