A performance analysis of a simple prime-testing algorithm
Marvin C. Wunderlich · Mathematics of Computation · 1983
This paper gives an empirical performance analysis of a prime-proving program designed and implemented by the author and J. L. Selfridge in 1974. The algorithm has been commonly referred to as the "down algorithm" because of its recursive characteristics. It is shown, among other things, that of the 2270 primes tested, 94