I was looking for ways to improve a Sieve of Eratosthenes program I have and I ran across this web page.
http://www.qsl.net/w2gl/blackkey.html
In it I found this statement, "For all primes (except 2, 3, 5; the factors of 30), any Prime (mod 30) yields the remainder set: {1, 7, 11, 13, 17, 19, 23, 29}. This set fits nicely into a byte, having eight elements."
I have spot checked various primes and this seems to be true. My question is, is it true?
http://www.qsl.net/w2gl/blackkey.html
In it I found this statement, "For all primes (except 2, 3, 5; the factors of 30), any Prime (mod 30) yields the remainder set: {1, 7, 11, 13, 17, 19, 23, 29}. This set fits nicely into a byte, having eight elements."
I have spot checked various primes and this seems to be true. My question is, is it true?