Reply to comment

Croft Spiral Sieve

The Croft Spiral Sieve, a very efficient multiplicative sieving algorithm derived from the set of all numbers not divisible by 2, 3, & 5, reveals the perfectly symmetrical deterministic process, employing 8 progressively expanding "chord" patterns, whereby the final post-factorization result is all primes >5 up to a given n:


  • Web page addresses and e-mail addresses turn into links automatically.
  • Allowed HTML tags: <a> <em> <strong> <cite> <code> <ul> <ol> <li> <dl> <dt> <dd>
  • Lines and paragraphs break automatically.

More information about formatting options

To prevent automated spam submissions leave this field empty.
By submitting this form, you accept the Mollom privacy policy.