3 citations · 3 across the 4 of their papers we have counts for
5 papers · 1 filter
The Prime Wavelet Tree: Compressing the Carmichael Numbers
Ankur Gupta, Jonathan Webster, Sylvia Webster
We present two number-theoretic compression techniques. The first is \textit{local}, and compresses individual numbers. The second is \textit{global}, and compresses the entire set…
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 …
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…
An algorithm and computation to verify Legendre's Conjecture up to
Jonathan Sorenson, Jonathan Webster
We state a general purpose algorithm for quickly finding primes in evenly divided sub-intervals. Legendre's conjecture claims that for every positive integer , there exists a pr…
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…