mersenneforum.org Riesel base 3 reservations/statuses/primes
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

2016-09-20, 15:34   #837
Puzzle-Peter

Jun 2009

2·5·67 Posts

Quote:
 Originally Posted by Puzzle-Peter I do not understand the following LLR output: My input looks like this: Code:  23566399112 59508 -1 23566399112 59543 -1 23566399112 59568 -1 and lresults.txt looks like this: Code:  23566399112*3^59508-1 is not prime. RES64: DBDD7F48F65B3879. OLD64: A7B882071AD77B5A Time : 9.327 sec. Iter: 94407/94407, ERROR: ROUND OFF (0.5) > 0.4 Continuing from last save file. Unrecoverable error, Restarting with next larger FFT length... U((N+1)/3) is coprime to N! Time : 58.448 sec. 23566399112*3^59568-1 is not prime. RES64: B3A7CCFC753017E5. OLD64: 1AF766F55F9047AC Time : 9.324 sec. So what does this tell me about n=59543? Prime or no prime? Thanks Peter
Updating to the most recent version of LLR fixed the issue

2016-09-25, 08:41   #838
Siemelink

Jan 2006
Hungary

4148 Posts

Quote:
 Originally Posted by Siemelink As a tribute to this massive effort, I'll take a reservation too. Reserving k=22G to 23G, n=25K to 100K. Willem.
My pc died in July, so the progress was halted for a while. Continuing.

Willem.

 2016-10-17, 11:03 #839 MyDogBuster     May 2008 Wilmington, DE B2416 Posts R3 Reserving >63G n=25K-100K
 2016-11-10, 13:29 #840 MyDogBuster     May 2008 Wilmington, DE 22×23×31 Posts R3 R3 >63G tested to n=100K 282 primes found Results emailed - range released
 2016-11-16, 16:03 #841 rebirther     Sep 2011 Germany 23×32×5×7 Posts R3 tested to n=500k (300-500k) (4-6G) 467 primes found, 876 remain in this range Results emailed, Base released
 2016-11-16, 16:14 #842 rebirther     Sep 2011 Germany 23·32·5·7 Posts Reserving R3 to n=250k (200-250k) (2.147-4G) for BOINC
 2016-12-01, 21:20 #843 rebirther     Sep 2011 Germany 23×32×5×7 Posts R3 tested to n=250k (200-250k) (2.147-4G) 267 primes found, 1554 remain in this range Results emailed, Base released
 2016-12-10, 08:26 #844 rebirther     Sep 2011 Germany 1001110110002 Posts Reserving R3 to n=125k (100-125k) (6-10G) for BOINC
 2016-12-31, 13:58 #845 KEP Quasi Admin Thing     May 2005 3·313 Posts R3 13G-21G is complete to n=100K... results e-mailed
2016-12-31, 17:17   #846
VBCurtis

"Curtis"
Feb 2005
Riverside, CA

112E16 Posts

Quote:
 Originally Posted by KEP R3 13G-21G is complete to n=100K... results e-mailed
Excellent way to end the year, Kenneth! Rather a monumental task.
I'll begin a sieve for 10-15G once the 6-10G work reaches 200 or 250k, midyear I suppose.

2017-01-01, 16:21   #847
KEP
Quasi Admin Thing

May 2005

3×313 Posts

Quote:
 Originally Posted by VBCurtis Excellent way to end the year, Kenneth! Rather a monumental task. I'll begin a sieve for 10-15G once the 6-10G work reaches 200 or 250k, midyear I suppose.
Thanks!

It was about 40M tasks and it resulted in ~34800 primes (number may be wrong, is taken on top of my head)

So yes, it was a monumental task, however now you have plenty to sieve for the next many years. Really wish that Riesel base 3 could become a focus project for more users and maybe for BOINC

Unfortunantly I have no ressources available to help you sieve.

Happy new year everyone. Take care!

 Thread Tools

 Similar Threads Thread Thread Starter Forum Replies Last Post gd_barnes Conjectures 'R Us 2184 2020-10-27 14:30 gd_barnes Conjectures 'R Us 853 2020-10-26 17:25 Siemelink Conjectures 'R Us 1672 2020-10-25 07:39 gd_barnes Conjectures 'R Us 1415 2020-10-24 09:18 gd_barnes Conjectures 'R Us 388 2020-10-21 19:42

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

Wed Oct 28 12:10:56 UTC 2020 up 48 days, 9:21, 1 user, load averages: 1.25, 1.44, 1.62

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.