mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Sierpinski/Riesel Base 5

Reply
 
Thread Tools
Old 2014-05-05, 02:11   #12
TheCount
 
TheCount's Avatar
 
Sep 2013
Perth, Au.

2×72 Posts
Default Retest current k's

Primegrid's looking at doing a re-test of current k's for range before they went to BOINC, i.e. n<1M:
http://www.primegrid.com/forum_thread.php?id=5686
Good idea I think.
TheCount is offline   Reply With Quote
Old 2014-06-12, 00:10   #13
TheCount
 
TheCount's Avatar
 
Sep 2013
Perth, Au.

2·72 Posts
Default Retest current k's

Re-check of current k's for n<966063 complete.
731K individual tests completed in the re-check.
No prime found.
Now confident to head to much higher n.
http://www.primegrid.com/stats_sr5_llr.php
TheCount is offline   Reply With Quote
Old 2015-01-02, 02:39   #14
AG5BPilot
 
AG5BPilot's Avatar
 
Dec 2011
New York, U.S.A.

97 Posts
Default

Quote:
Originally Posted by MyDogBuster View Post
Hi Lennart, Is there some screen that will show what primes have been found on SR5-BOINC. Gary and I need those so we can keep our tables up to date on CRUS. It also effects bases 25 and 625
This page didn't exist last year when you asked the question: http://www.primegrid.com/primes/primes.php?project=SR5
AG5BPilot is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
BOINC Unregistered Information & Answers 6 2010-09-21 03:31
Base-6 speed for prime testing vs. base-2 jasong Conjectures 'R Us 36 2010-08-03 06:25
Boinc Xentar Sierpinski/Riesel Base 5 4 2009-04-25 10:26
BOINC? KEP Twin Prime Search 212 2007-04-25 10:29
BOINC bebarce Software 3 2005-12-15 18:35

All times are UTC. The time now is 19:43.

Thu Feb 25 19:43:54 UTC 2021 up 84 days, 15:55, 0 users, load averages: 2.35, 1.92, 1.86

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, 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.