Riesel base 3 reservations/statuses/primes

[henryzz]

2794756*3^27174-1 is prime

[em99010pepe]

That was fast!

[henryzz]

yep
im gonna start on 3591446 now

[gd_barnes]

Originally Posted by henryzz

yep
im gonna start on 3591446 now

That was quick work on that first one. If you don't find a prime on one of them, just let us know how far you tested them.

Primes have now been found for all k<3.5M. Excellent!


Thanks,
Gary

[henryzz]

at 80k with 3591446 now
when i get to 100k i will start the next three together and take them to 100k
after that any remaining ks i will take higher

u dont mind me doing all of them i hope?

[gd_barnes]

Originally Posted by henryzz

at 80k with 3591446 now
when i get to 100k i will start the next three together and take them to 100k
after that any remaining ks i will take higher

u dont mind me doing all of them i hope?

No, no problem with you doing them 2-3 k's at a time.

I would suggest limiting them to just 2-3 at a time at this point. My intent is to start a team drive for ALL k's < 100M and take them to n=100K within the next couple of weeks. So whatever k's you can find primes for before that will help speed the drive along in the future.


Gary

[henryzz]

3591446 is at 100k unreserving it

3677878, 4223272, and 4245112 are sieved and at 29k so far

[KEP]

Originally Posted by henryzz

3591446 is at 100k unreserving it

3677878, 4223272, and 4245112 are sieved and at 29k so far

Wow henryzz, KEP is reporting his great admirasion towards your effort. Maybe in the future, you could be interested in running some n>=1 to n<=25,000 work for Riesel base 3 I'm only suggesting this, since it takes a lot of work to produce a small amount of work.

And to Gary, I'm not sure how much maintenance it will require, but I think it could make the CRUS project more interesting for those who hasn't joined us, or at least for me, if we could keep the "ZERO k's remaining below (k-value left, -1 or -2)". So is such feature acceptable for you to maintain and carry out maintenance? It's really not that important with such a feature, but I think its a need statement allowing for people with no clue whatsoever about this project and what we are doing, to determine themself how we progress.

Also I can say, the Riesel Base 3 attack website is no longer going to be maintenanced, but eventually a list containing the PRPs that is actually later verified as composites will be posted on my site. Once such a list containing not only the k/n pair being "composite PRP" but also the "proven prime" k/n pair, is existing, then I'll let you all know about it.

Now every one, go ahead and kille those 620 k's remaining. Happy "war" everyone

Take care!

Kenneth!

EDIT: I can say, that hopefully by mid next week, all k<=250M will have been tested to n<=25,000 and all redundant k's will have been removed as well all remaining k's will have been send to Gary. It requires quite some manual work, and my computers say that they have at lest 36 hours of testing remaining at current time, so I want bet on anything earlier than mid next week to finish the Riesel base 3 k<=250M range... at that level I figure that at least 1100 k's will remain, maybe as much as 1300 k's will remain

[henryzz]

i would quite happily help you to prp low n values at some point
once a team drive is set up covering the ks i am currently working on would probably be a good time

how long does it take to take 1M ks to 25k on one core of a Q6600?

4245112*3^34528-1 is prime
this just about halved the remaining candidates

[KEP]

Originally Posted by henryzz

i would quite happily help you to prp low n values at some point
once a team drive is set up covering the ks i am currently working on would probably be a good time

how long does it take to take 1M ks to 25k on one core of a Q6600?

4245112*3^34528-1 is prime
this just about halved the remaining candidates

Thanks for wanna help out It takes approximately 8-12 hours on a single core, to PRP test 500000 k's (1M k since only even k's is tested) on a Q6600. The fastest and easiest appears to be to take all k to n<=2500 and then sieve the remaining candidates. But you can do it however you decide to do it, I've just learned a lot on working with the k<=500M, and my experience is that to test all k's to n<=500 is to low, but to test any k to n>2500 is to slow compared to sieving

By the way, good prime you got there. It actually helps us make 8 other k's prime later on when constructing the proof. So at current, you have also primed following k/n pairs:

4245112*3^34528-1 (yours prime)
12735336*3^34527-1 (removed by your prime)
38206008*3^34526-1 (removed by your prime)
114618024*3^34525-1 (removed by your prime)
343854072*3^34524-1 (removed by your prime)
1031562216*3^34523-1 (removed by your prime)
3094686648*3^34522-1 (removed by your prime)
9284059944*3^34521-1 (removed by your prime)
27852179832*3^34520-1 (removed by your prime)

So pretty good work. And again thanks for wanna help out later. I actually hope that this conjecture can be taken to n<=25K for all k's before I get 30. This gives us 1435 days from today to reach that goal

Regards

Kenneth!

[henryzz]

sounds good
what scripts do u use for this
do u just manually use srfile to remove ks from a file when llring or does a script do it for you