16 citations · 43 across the 10 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.NT2015★ 16 cited
Strong Pseudoprimes to Twelve Prime Bases
Jonathan P. Sorenson, Jonathan Webster
Let be the smallest strong pseudoprime to the first prime bases. This value is known for . We extend this by finding and . We also pres…
cs.DS2015★ 7 cited
Two Compact Incremental Prime Sieves
Jonathan P. Sorenson
A prime sieve is an algorithm that finds the primes up to a bound . We say that a prime sieve is incremental, if it can quickly determine if is prime after having found al…