Slashdot videos: Now with more Slashdot!
We've improved Slashdot's video section; now you can view our video interviews, product close-ups and site visits with all the usual Slashdot options to comment, share, etc. No more walled garden! It's a work in progress -- we hope you'll check it out (Learn more about the recent updates).
Some years ago I came across a pattern in that 42n plus individually the primes from 1 to 41 and also 25 creates a list of all possible primes. It's seemingly simple, but I've never found a single academic reference to this pattern. I've also checked it with scripts to several million primes, no exceptions.
What is it that makes that limited range hold true for all prime numbers? And is there an academic significance for this? I've been asking for years, but I'd love Slashdot's help in finally getting this answered!
After n=0, the relevant base is 1,5,11,13,17,19,23,25,29,31,37,41. 2,3, & 7 never repeat. Also, pushed into binaries it makes a great way to compress arbitrarily large primes! The programmer in me wonders about that trait's usefulness to cryptography..."