mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Conjectures 'R Us

Reply
 
Thread Tools
Old 2011-05-06, 14:41   #364
Puzzle-Peter
 
Puzzle-Peter's Avatar
 
Jun 2009

66910 Posts
Default

k=1110M to 1125M done, 79 k's remaining

files emailed
Puzzle-Peter is offline   Reply With Quote
Old 2011-05-08, 10:40   #365
Puzzle-Peter
 
Puzzle-Peter's Avatar
 
Jun 2009

12358 Posts
Default

R3 k=1125M to 1140M complete, 78 k's remaining

results mailed
Puzzle-Peter is offline   Reply With Quote
Old 2011-05-11, 15:56   #366
Puzzle-Peter
 
Puzzle-Peter's Avatar
 
Jun 2009

3×223 Posts
Default

R3 k=1140M to 1155M complete, 84 k's remaining

results emailed
Puzzle-Peter is offline   Reply With Quote
Old 2011-05-13, 12:21   #367
Mattyp101
 
Jan 2011

22×5 Posts
Default

k=240M-250M complete to n=100K
32 primes found
18 k's remain
Results sent
Mattyp101 is offline   Reply With Quote
Old 2011-05-13, 19:59   #368
Puzzle-Peter
 
Puzzle-Peter's Avatar
 
Jun 2009

12358 Posts
Default

k=1155M to 1170M tested to n=25k, 77 k's remaining

Results emailed
Puzzle-Peter is offline   Reply With Quote
Old 2011-05-15, 10:00   #369
Puzzle-Peter
 
Puzzle-Peter's Avatar
 
Jun 2009

12358 Posts
Default

k=1170M to 1185M tested to n=25k, 77 k's remaining

Results emailed
Puzzle-Peter is offline   Reply With Quote
Old 2011-05-15, 14:19   #370
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT)

163116 Posts
Default

Reserving k=4M-10M upto n=500k
This might take a while but I am willing to share the sieve file if I start getting in someone's way(judging by activity on taking past 100k sofar I won't).
henryzz is offline   Reply With Quote
Old 2011-05-16, 14:30   #371
Puzzle-Peter
 
Puzzle-Peter's Avatar
 
Jun 2009

29D16 Posts
Default

k=1185M to 1200M tested to n=25k, 70 k's remaining

Results emailed
Puzzle-Peter is offline   Reply With Quote
Old 2011-05-20, 20:23   #372
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT)

13·19·23 Posts
Default

Quote:
Originally Posted by henryzz View Post
Reserving k=4M-10M upto n=500k
This might take a while but I am willing to share the sieve file if I start getting in someone's way(judging by activity on taking past 100k sofar I won't).
Sieving is going well so far. Sieved upto 450G sofar and removing a candidate every 55 sec. Should sieve upto 4.5T(4T probable because of removals) as test at 340K(60% through) takes 556 secs. Would you suggest splitting off 100M-250M(or 200M) early?
henryzz is offline   Reply With Quote
Old 2011-05-20, 20:50   #373
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

27A916 Posts
Default

Quote:
Originally Posted by henryzz View Post
Sieving is going well so far. Sieved upto 450G sofar and removing a candidate every 55 sec. Should sieve upto 4.5T(4T probable because of removals) as test at 340K(60% through) takes 556 secs. Would you suggest splitting off 100M-250M(or 200M) early?
Yeah, you might test a candidate at n=190K (60% of n=100K-250K) and see how long that takes, then stop sieving when the removal rate equals that. Then do testing of n=100K-250K. Then remove all k's with primes for the n=250K-500K range, test a candidate at n=400K (60% of n=250K-500K), stop sieving at that removal rate for that n-range, and then finish up testing n=250K-500K. You could also split off n=100K-200K and follow it up with n=200K-500K but I tend to want to put the higher n-ratio (i.e. n-max/n-min) on the lower range when breaking off n-ranges so my preference would be n=100K-250K/250K-500K.

Although it involves more personal hassle, splitting up n-ranges would be a fair amount more CPU-efficient, especially since base 3 is probably the most prime-heavy of all bases.

Last fiddled with by gd_barnes on 2011-05-20 at 20:54
gd_barnes is online now   Reply With Quote
Old 2011-05-20, 21:15   #374
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT)

10110001100012 Posts
Default

Quote:
Originally Posted by gd_barnes View Post
Yeah, you might test a candidate at n=190K (60% of n=100K-250K) and see how long that takes, then stop sieving when the removal rate equals that. Then do testing of n=100K-250K. Then remove all k's with primes for the n=250K-500K range, test a candidate at n=400K (60% of n=250K-500K), stop sieving at that removal rate for that n-range, and then finish up testing n=250K-500K. You could also split off n=100K-200K and follow it up with n=200K-500K but I tend to want to put the higher n-ratio (i.e. n-max/n-min) on the lower range when breaking off n-ranges so my preference would be n=100K-250K/250K-500K.

Although it involves more personal hassle, splitting up n-ranges would be a fair amount more CPU-efficient, especially since base 3 is probably the most prime-heavy of all bases.
I think I will do that. A test at 190M took 145 seconds which would imply a sieve depth of ~1.5T. Any hints on what depth 250k-500k will then be sieved to. What depth if 1 or 2ks are removed? It might be possible to be worked out now based on how many primes in 100k-250k but you should be able to make an educated guess much easier I think. A test at 400k takes 655 seconds.
henryzz is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Bases 101-250 reservations/statuses/primes gd_barnes Conjectures 'R Us 815 2020-07-10 15:55
Bases 4-32 reservations/statuses/primes gd_barnes Conjectures 'R Us 1406 2020-07-09 21:36
Bases 33-100 reservations/statuses/primes Siemelink Conjectures 'R Us 1663 2020-07-06 20:15
Bases 251-500 reservations/statuses/primes gd_barnes Conjectures 'R Us 2111 2020-07-06 12:06
Sierp base 3 reservations/statuses/primes gd_barnes Conjectures 'R Us 383 2020-02-12 23:10

All times are UTC. The time now is 04:46.

Sat Jul 11 04:46:28 UTC 2020 up 108 days, 2:19, 0 users, load averages: 1.19, 1.21, 1.27

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

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.