mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Riesel Prime Search

Reply
 
Thread Tools
Old 2006-01-18, 19:14   #56
grobie
 
grobie's Avatar
 
Sep 2005
Raleigh, North Carolina

15116 Posts
Default

Quote:
Originally Posted by grobie
I suffered a setback, I just bought a new box and 3 weeks later the hard drive crashed, its going to be replaced by dell, but for my k=1222853775, I lost all testing and sieve file from n=10k to 250k, I think my testing was at approx. 176K. My second box is still testing 250k to 300k.
Should I sieve & test from my last prime or start at 175k. All of the llrresults are gone also.
Ok, hard drive installed, NewPGen is now sieving again from 175k to 250k

Last fiddled with by grobie on 2006-01-18 at 19:16
grobie is offline   Reply With Quote
Old 2006-01-26, 17:44   #57
ValerieVonck
 
ValerieVonck's Avatar
 
Mar 2004
Belgium

15058 Posts
Default

Small update: still crunching on my 2 k's
ValerieVonck is offline   Reply With Quote
Old 2006-01-30, 20:59   #58
lsoule
 
lsoule's Avatar
 
Nov 2004
California

6A816 Posts
Default

I've run all the candidates for n=0-50k, added some more Ks, and
updated the table. My hope in expanding the range from 10k to 50k
is that the candidates will be a little more predictable.
lsoule is offline   Reply With Quote
Old 2006-02-05, 14:27   #59
amphoria
 
amphoria's Avatar
 
"Dave"
Sep 2005
UK

2·19·73 Posts
Default

Reserving k=317372055
amphoria is online now   Reply With Quote
Old 2006-02-22, 17:21   #60
lsoule
 
lsoule's Avatar
 
Nov 2004
California

170410 Posts
Default

Reserving 1501946985
lsoule is offline   Reply With Quote
Old 2006-03-01, 18:07   #61
ValerieVonck
 
ValerieVonck's Avatar
 
Mar 2004
Belgium

33·31 Posts
Default

Status of my search:

234686595 tested up to 135k=> 102 primes
360949875 tested up to 135k=> 100 primes
ValerieVonck is offline   Reply With Quote
Old 2006-03-03, 22:53   #62
edorajh
 
edorajh's Avatar
 
Oct 2003
Croatia

23·3·19 Posts
Default

reserving 555567045
edorajh is offline   Reply With Quote
Old 2006-03-03, 22:59   #63
lsoule
 
lsoule's Avatar
 
Nov 2004
California

170410 Posts
Default

555567045 is all yours - good luck!
lsoule is offline   Reply With Quote
Old 2006-03-04, 09:18   #64
edorajh
 
edorajh's Avatar
 
Oct 2003
Croatia

23×3×19 Posts
Default

Thanks!

Just two questions. Should I use LLR 362 or some other (once I'm done with sieving)?

Is there a way I could find out how many digits candidate of the form k*2^n-1 has?

Edo
edorajh is offline   Reply With Quote
Old 2006-03-04, 14:10   #65
lsoule
 
lsoule's Avatar
 
Nov 2004
California

23×3×71 Posts
Default

The number of digits is log base 10 of the number which comes out
to roughly 0.3*n. To get onto the top-5000 n must be at least
220k now.

I'd stick with LLR 362 unless we find something reproducibly wrong with it.
lsoule is offline   Reply With Quote
Old 2006-03-04, 15:56   #66
edorajh
 
edorajh's Avatar
 
Oct 2003
Croatia

23×3×19 Posts
Default

Thanks.
edorajh is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Best Work for Finding Primes Unregistered Information & Answers 9 2012-06-24 13:50
Which settings to choose for best work? jmb1982 Software 2 2009-04-07 09:33
Help test 210885 - Find a new top 5000 prime! SlashDude Riesel Prime Search 121 2008-01-03 08:47
Help test 2995125705 - Find a new top 5000 prime! SlashDude Riesel Prime Search 538 2007-05-08 01:42
The fastest way to a top-5000 prime? lsoule 15k Search 13 2005-09-19 20:24

All times are UTC. The time now is 22:35.

Wed Oct 21 22:35:38 UTC 2020 up 41 days, 19:46, 0 users, load averages: 1.70, 1.67, 1.76

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.