mersenneforum.org Riesel/Sierp base 2 even-k/even-n/odd-n testing
 Register FAQ Search Today's Posts Mark Forums Read

 2018-01-16, 23:33 #397 gd_barnes     May 2007 Kansas; USA 11·929 Posts I think you guys are talking about two different things. This communication confuses me so I'm wondering if you guys are understanding one another. :-) Peter, I believe that you are saying that a larger n-range needs to be sieved. I see that you have started on n=2^24-2^26 (n=16777216 to 67108864). That range vs. the previously suggested range by Bitcoin of n=2^24 to n=25M. Bitcoin, I believe that you are saying that you can sieve much more deeply as is needed. ...so two different lines of communication. I do not think that Primegrid would have a sieve file for this n-range. To the best of my knowledge they have only sieved all k<=10000 for n=9M-12M to P=20P (20e15). [They've also done all n<9M to deeper sieve depths.] To clear things up, Peter, I would suggest that you just send Bitcoin your entire sieve file and he can have Yoyo sieve as deeply as they can. I have no idea what that limit should be but I feel like P=25P (25e15) as suggested by Bitcoin would be a good starting point since it's just low weight even-n. One more thing to avoid some previous confusion: Please make sure that you guys are only sieving even-n. :-) This may possibly be the highest n-range ever sieved or factored outside of GIMPS. Last fiddled with by gd_barnes on 2018-01-16 at 23:53
 2018-01-17, 00:06 #398 pepi37     Dec 2011 After milion nines:) 101010000112 Posts So Gary, if I understand correctly can I make "ordinary sieve" on sequence 9519*2^n-1 and then remove all odd candidates from sieve? If that is true, then GPU can help us alot, since GPU sieve is way faster then CPU sieve.
2018-01-17, 00:10   #399
gd_barnes

May 2007
Kansas; USA

237538 Posts

Quote:
 Originally Posted by pepi37 So Gary, if I understand correctly can I make "ordinary sieve" on sequence 9519*2^n-1 and then remove all odd candidates from sieve? If that is true, then GPU can help us alot, since GPU sieve is way faster then CPU sieve.
Yes. Just sieve to some low limit and then remove all of the odd n's.

Alternatively you can sieve 9519*4^n-1 at half the n-range, i.e. 2^23-2^25 (n=8388608 to 33554432). No n-removal is then needed. But I don't know if a GPU can do anything except base 2.

Coordinate with Peter before doing anything. He has probably already removed odd n's or is sieving base 4. He is the starting point for all of this.

Last fiddled with by gd_barnes on 2018-01-17 at 00:11

2018-01-17, 00:15   #400
pepi37

Dec 2011
After milion nines:)

3·449 Posts

Quote:
 Originally Posted by gd_barnes Yes. Just sieve to some low limit and then remove all of the odd n's. Alternatively you can sieve 9519*4^n-1 at half the n-range, i.e. 2^23-2^25 (n=8388608 to 33554432). No n-removal is then needed. But I don't know if a GPU can do anything except base 2. Coordinate with Peter before doing anything. He has probably already removed odd n's or is sieving base 4. He is the starting point for all of this.
Very interesting :)
I will not start anything , dont worry :)
But idea with GPU still stay...

 2018-01-17, 15:53 #401 Puzzle-Peter     Jun 2009 67010 Posts I just sent the file to Mr. Bitcoin, odd n values were removed and P=160e12. As the optimal sieve depth increases with increasing n values I wasn't sure about 25e15. But now I realize it's so much more than what I had for the previous file which went up to n=2^24 I cannot imagine 25e15 to not be enough. Well, we will see. Any help about using GPUs will be greatly appreciated as nobody wants to waste time.
 2018-02-13, 07:28 #402 Jean Penné     May 2004 FRANCE 24×5×7 Posts Sierpinski odd n's testing Hi, k=9267 is now tested up to n = 9,003,487 (2,710,324 decimal digits) no prime, continuing... Best Regards, Jean
 2018-04-01, 06:11 #403 Jean Penné     May 2004 FRANCE 24×5×7 Posts Sierpinski odd n's testing Hi, k=9267 is now tested up to n = 9,200,215 (2,769,545 decimal digits) no prime, continuing... Best Regards, Jean
 2018-05-21, 14:41 #404 Jean Penné     May 2004 FRANCE 24·5·7 Posts Sierpinski odd n's testing Hi, k=9267 is now tested up to n = 9,400,135 (2,829,727 decimal digits) no prime, continuing... Best Regards, Jean
 2018-07-03, 15:37 #405 Jean Penné     May 2004 FRANCE 24·5·7 Posts Sierpinski odd n's testing Hi, k=9267 is now tested up to n = 9,602,743 (2,890,718 decimal digits) no prime, continuing... Best Regards, Jean
 2018-09-24, 06:16 #406 Jean Penné     May 2004 FRANCE 24×5×7 Posts Sierpinski odd n's testing Hi, k=9267 is now tested up to n = 10,003,207 (3,011,270 decimal digits) no prime, continuing... Best Regards, Jean
 2018-11-03, 15:29 #407 Jean Penné     May 2004 FRANCE 23016 Posts Sierpinski odd n's testing Hi, k=9267 is now tested up to n = 10,136,695 (3,051,454 decimal digits) no prime, continuing... Best Regards, Jean

 Similar Threads Thread Thread Starter Forum Replies Last Post R. Gerbicz Conjectures 'R Us 22 2009-12-29 20:21 gd_barnes Conjectures 'R Us 13 2009-12-14 09:23 Siemelink Conjectures 'R Us 105 2009-09-04 06:40 gd_barnes Conjectures 'R Us 10 2008-12-20 00:19 gd_barnes Conjectures 'R Us 43 2008-07-16 10:12

All times are UTC. The time now is 05:26.

Wed Oct 21 05:26:11 UTC 2020 up 41 days, 2:37, 0 users, load averages: 1.19, 1.32, 1.42