Phil Ah, that would explain why both 2 and 3 were exceptions in the hypothesis!
greg ~krsnadas.org -- from: Philip Hunt (USA) <[email protected]> to: [email protected] date: 14 May 2013 08:38 subject: Re: [Jprogramming] Testing consecutive pairs of primes >Before I make a fool of myself I'll apologize up front that I'm an absolute >beginner in J... :-) and I love learning from these posts (although some are >still beyond my reach). >Comment: Simple number theory says that all prime pairs are a multiple of 6 >plus/minus 1, since when in mod 6 all numbers are remainder 0,1,2,3,4,5 and >only 1,5 are possible primes. So by this rule any prime pairs you find must >surround a simple multiple of 6 am I missing something? Phil ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
