mersenneforum.org Questions and stuff
 Register FAQ Search Today's Posts Mark Forums Read

2012-11-21, 05:48   #177
LaurV
Romulan Interpreter

Jun 2011
Thailand

205268 Posts

Quote:
 Originally Posted by AMDave However there is no discernible pattern for whether the mod6 'seed' is 1 above or 1 below.
Well, if you have nothing better to do, you can establish some pattern, not where the primes are, but where they are not. For example, taking in 6k-1 some k=1 (mod 5) you get 30k+5 which is always divisible by 5, therefore composite (ex: 35, 65, 95, 125, etc), and symmetrical, 30k-5 (which is 6k+1 with convenient renaming of k) (ex: 25, 55, 85, 115, 145, etc). You can repeat this for 7 (42k+/-7, ex: 35, 49, 77, 91, 119, 133), for 11 (66k+/-11, ex: 55, 77, 121, 143, 187), etc, and get a "pattern" with "where the primes are not", in the (+/-1 mod 6) distribution. They repeat after 6*5*7*11 lines

 2012-11-21, 08:16 #178 AMDave     Jan 2006 deep in a while-loop 12228 Posts I will have to take your word for it. I am out-geeked on this subject If there is an upper/lower pattern to the mod6-adjacent as you say, then that is interesting. I have to then pose the next (and killer) question: Is there then also a predictive pattern to the mod6-adjacent when including the mod-6-non-adjacents? I don't see one there. In fact I am now seeing spots and colours and need to withdraw from this thread. My own question is beyond me atm Last fiddled with by AMDave on 2012-11-21 at 09:03

 Similar Threads Thread Thread Starter Forum Replies Last Post Batalov Miscellaneous Math 1 2017-01-27 04:56 fivemack Lounge 12 2011-06-12 11:28 paulunderwood Linux 3 2005-12-05 22:18 Xyzzy Software 6 2004-10-06 13:35 Xyzzy Lounge 11 2003-09-15 23:22

All times are UTC. The time now is 12:33.

Wed May 27 12:33:29 UTC 2020 up 63 days, 10:06, 1 user, load averages: 1.92, 1.92, 1.84

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.