mersenneforum.org Sierp base 3 - mini-drive Ia
 Register FAQ Search Today's Posts Mark Forums Read

 2008-10-29, 20:26 #155 Flatlander I quite division it     "Chris" Feb 2005 England 31·67 Posts 29548672*3^96142+1 Is prime.
2008-10-29, 20:32   #156
gd_barnes

May 2007
Kansas; USA

72×11×19 Posts

Quote:
 Originally Posted by KEP I've split the sieve over 3 cores, because it lowered the completion time from ~30-35 days, to ~10 days. I know it is not all to efficient, but the difference is only a few percent, so I decided to do it this way. I may add, that I only sieve the 3 ranges to 150G and not any further. Once the 50M-100M range completes, I'll e-mail you the sieve file, and then continue complete the other 2 ranges, starting with 100M-150M and then six days later complete the 150M-200M range in about 10 days Regards KEP

Oh, OK. That sounds great. Thanks for the excellent sieving work!

 2008-10-29, 21:48 #157 mdettweiler A Sunny Moo     Aug 2007 USA (GMT-5) 141418 Posts @Gary: Ah, I see what you mean. Yeah, that sounds good.
2008-10-29, 22:40   #158
gd_barnes

May 2007
Kansas; USA

101000000000012 Posts

Quote:
 Originally Posted by mdettweiler @Gary: Ah, I see what you mean. Yeah, that sounds good.

I was just thinking of one more thing. To keep the Roman-numeral prefixes in sync, so to speak, I think we'll just call the Sierp drive for k=50M-100M 'Mini-Drive - Sierp base 3 I(b)' after which we'll go II, III, IV, V, etc.

I kind of like the idea of Roman numeral prefixes for drives of the same base.

Gary

2008-10-29, 23:45   #159
Flatlander
I quite division it

"Chris"
Feb 2005
England

31×67 Posts

94-95 and 95-96 complete. No primes.

When the n is below 50,000, say, do you think things would be more manageable if the files were available as ks rather than ns? i.e. 3 or 5 ks per file. It would then just be a case of each tester removing the k from their file when they find a prime.
Attached Files
 94-96-results.zip (104.8 KB, 57 views)

Last fiddled with by Flatlander on 2008-10-30 at 00:06 Reason: Removed 'Gary,' to make it a question to anyone.

2008-10-30, 10:42   #160
gd_barnes

May 2007
Kansas; USA

72×11×19 Posts

Quote:
 Originally Posted by Flatlander 94-95 and 95-96 complete. No primes. When the n is below 50,000, say, do you think things would be more manageable if the files were available as ks rather than ns? i.e. 3 or 5 ks per file. It would then just be a case of each tester removing the k from their file when they find a prime.

Is 93-94 complete?

Funny you mention that. That's how I've been doing the conjecture searches over several cores for quite a while now. For instance, I have Sierp base 31 divided up on 2 cores; one running k=~1 to 3.1M and the other k=~3.1M-6.2M. Much less duplication of testing that way.

I have to think of the best way to design that for a drive. The problem is, one person could end up with 3 k's that never yield a prime over a large n-range. Therefore, it'd have to be something like 3 k's over n=25K-50K or something like that.

The myriad of situations that could arise has prevented me from running a drive like that yet. The main problem being one person ending up with a file that takes far longer to test than another person; and possibly even longer than they care to continue testing. It would be far easier to administer but a little difficult to manage workload properly.

Gary

2008-10-30, 14:01   #161
Flatlander
I quite division it

"Chris"
Feb 2005
England

31·67 Posts

Quote:
 Originally Posted by gd_barnes Is 93-94 complete? Gary
Yes, sorry.
Attached Files
 93-94-results.zip (54.8 KB, 59 views)

 2008-11-02, 13:30 #162 Flatlander I quite division it     "Chris" Feb 2005 England 31·67 Posts 23243282*3^99009+1 Is prime.
2008-11-03, 21:07   #163
Flatlander
I quite division it

"Chris"
Feb 2005
England

31×67 Posts

96-100 complete.
Attached Files
 96-100-results.zip (204.5 KB, 59 views)

2008-11-04, 04:49   #164
gd_barnes

May 2007
Kansas; USA

72·11·19 Posts

Quote:
 Originally Posted by Flatlander 96-100 complete.

Thanks, Chris, for your immense contribution to the base 3 efforts!

Last fiddled with by gd_barnes on 2008-11-04 at 04:49

2008-11-08, 14:53   #165
Flatlander
I quite division it

"Chris"
Feb 2005
England

207710 Posts

Quote:
 Originally Posted by gd_barnes ... First, we'll do k=50M-100M for n=25K-100K to get it 'on the same page' as the Riesel side. In the mean time, one person like me (when I free up a resource or 2) or anyone else who wants to volunteer for it, can run k=100M-200M for n=25K-35K or 25K-40K. Later on, we can start a drive for that k-range for n=35K (or 40K) to 100K. It's best that only one person or at most 2 do it. If that works out well, we'll plan on doing it that way for future mini drives. ... Gary
I'll do it. (Unless this is now not the most efficient way, it light of Karsten's scripts? Perhaps it's now more efficient if I started with n even lower, using the scripts?)

Is it time to rename and unsticky this thread?

 Similar Threads Thread Thread Starter Forum Replies Last Post gd_barnes Conjectures 'R Us 254 2014-06-10 16:00 gd_barnes Conjectures 'R Us 46 2009-10-26 18:19 gd_barnes Conjectures 'R Us 199 2009-09-30 18:44 gd_barnes Conjectures 'R Us 43 2009-03-06 08:41 gd_barnes Conjectures 'R Us 43 2008-07-16 10:12

All times are UTC. The time now is 14:10.

Sun Nov 29 14:10:44 UTC 2020 up 80 days, 11:21, 3 users, load averages: 1.07, 1.16, 1.18

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.