Sieving Routines

Last modified: Mon Jul 30 15:24:30 CDT 2001

This page gives information on sieving routines, for finding primes and for factoring numbers. It includes C source code for "Robert Bennion's Hopping Sieve", which is further described in the Proceedings of ANTS III (the third Algorithmic Number Theory Symposium, June 1998, Portland, Oregon). "The hopping sieve" was developed by Robert Bennion at the University of Utah in the early 1970s. This sieve MAY have advantages over other methods if you have a small or slow cache memory.


Correspondence may be sent to galway@math.uiuc.edu
I would very much appreciate comments on the programs provided here. Can you re-implement them so that they show clear advantages over other methods?


You can find much more about primes and sieving at Chris Caldwell's "The Prime Pages".


Go back to Will Galway's home page.