mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Conjectures 'R Us

Reply
 
Thread Tools
Old 2007-02-09, 01:24   #78
Citrix
 
Citrix's Avatar
 
Jun 2003

2·33·29 Posts
Default

Quote:
Originally Posted by tcadigan View Post
for my 2 cents....I've thought about bumping to 5 million. I wouldn't be opposed to the 2^23 limit either

I don't recommend the idea. It will take alot of computers to reach that goal. With only 4 users working on this project, it will take a long time to finish.


edit: I will be moving to work on k=3^16 once I am done with my range.
Jean, is it possible to speed up the PRP test for 3^16? It is a generalized fermat as well as k*2^n+1? Could a smaller FFT lenght be used?

Last fiddled with by Citrix on 2007-02-09 at 02:57
Citrix is offline   Reply With Quote
Old 2007-02-09, 09:06   #79
tcadigan
 
tcadigan's Avatar
 
Sep 2004
UVic

2×5×7 Posts
Default

Quote:
Originally Posted by Citrix View Post
I don't recommend the idea. It will take alot of computers to reach that goal. With only 4 users working on this project, it will take a long time to finish.
as I said I use this project as a extra cycle sink...and every little bit helps...I don't see this as all that pointless of a project and I think users could come someday in the future. we've got fewer than SOB, I don't mind just letting it sit in teh background of my comp and LLR....or sieve....but that's just me
tcadigan is offline   Reply With Quote
Old 2007-02-12, 20:59   #80
Mystwalker
 
Mystwalker's Avatar
 
Jul 2004
Potsdam, Germany

3×277 Posts
Default

Well, I've started NewPGen for k=18534, 1M < n < 2.5M (base 4), as there are the fewest tests left for this k.
I haven't done any work for the other k's so far. But I think we should be ready for a combined sieve effort with sr2sieve once we reach the limit of the current candidate files.

Geoff:
Is there a lower limit for p values in sr2sieve?
So far, I've sieved to p=40M.
Mystwalker is offline   Reply With Quote
Old 2007-02-13, 03:13   #81
geoff
 
geoff's Avatar
 
Mar 2003
New Zealand

13×89 Posts
Default

Quote:
Originally Posted by Mystwalker View Post
Geoff:
Is there a lower limit for p values in sr2sieve?
So far, I've sieved to p=40M.
p must be greater than the greatest k value.
geoff is offline   Reply With Quote
Old 2007-02-13, 18:32   #82
Mystwalker
 
Mystwalker's Avatar
 
Jul 2004
Potsdam, Germany

3×277 Posts
Default

Great (pun not intended)!
So we could prepare the sieving within the next weeks.
Mystwalker is offline   Reply With Quote
Old 2007-03-03, 21:25   #83
Jean Penné
 
Jean Penné's Avatar
 
May 2004
FRANCE

10608 Posts
Default My to-day status...

k = 23451 is up to n = 1,703,768 base two, no prime, continuing...

k = 60849 is up to n = 1,555,134 base two, no prime, continuing...

Regards,
Jean
Jean Penné is offline   Reply With Quote
Old 2007-03-10, 21:18   #84
jasong
 
jasong's Avatar
 
"Jason Goatcher"
Mar 2005

5×701 Posts
Default

I'm interested in helping this project, just not in the immediate(within the next week or so) future.

Has anyone thought about setting up an LLR server for these numbers? If you did, it would probably be a good idea to set up the numbers as k*2^n+1 , rather than k*4^n+1 . Wouldn't want to get errors from people having their computer set up improperly. :)
jasong is offline   Reply With Quote
Old 2007-03-11, 01:42   #85
thommy
 
thommy's Avatar
 
Dec 2006

3×11 Posts
Default

Quote:
Originally Posted by jasong View Post
I'm interested in helping this project, just not in the immediate(within the next week or so) future.

Has anyone thought about setting up an LLR server for these numbers? If you did, it would probably be a good idea to set up the numbers as k*2^n+1 , rather than k*4^n+1 . Wouldn't want to get errors from people having their computer set up improperly. :)

Not worth it with just 4 ks remaining. And llr handles 4^n as 2^m... that wouldnt be a problem at all.
thommy is offline   Reply With Quote
Old 2007-03-11, 21:04   #86
jasong
 
jasong's Avatar
 
"Jason Goatcher"
Mar 2005

5×701 Posts
Default

Quote:
Originally Posted by thommy View Post
Not worth it with just 4 ks remaining. And llr handles 4^n as 2^m... that wouldnt be a problem at all.
If I'm not mistaken(I may be), when the LLR program contacts the server, the only thing transmitted is the k/n pair, not necessarily the b in k*b^n+c.

Am I wrong?
jasong is offline   Reply With Quote
Old 2007-03-14, 07:28   #87
Jean Penné
 
Jean Penné's Avatar
 
May 2004
FRANCE

24×5×7 Posts
Default

Quote:
Originally Posted by jasong View Post
If I'm not mistaken(I may be), when the LLR program contacts the server, the only thing transmitted is the k/n pair, not necessarily the b in k*b^n+c.

Am I wrong?
It is not quite exact ; the LLRNET server takes into account the header of the Newpgen file, and sends the info to the client, so, the base info is not lost.
Jean Penné is offline   Reply With Quote
Old 2007-04-02, 20:10   #88
Jean Penné
 
Jean Penné's Avatar
 
May 2004
FRANCE

24×5×7 Posts
Default My to-day's status

k = 23451 is up to n = 1,736,684 base two, no prime, continuing...

k = 60849 is up to n = 1,600,626 base two, no prime, continuing...

Regards,
Jean
Jean Penné is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Sierpinski/Riesel Base 5: Post Primes Here robert44444uk Sierpinski/Riesel Base 5 358 2008-12-08 16:28
Sierpinski/Riesel Base 10 rogue Conjectures 'R Us 11 2007-12-17 05:08
Sierpinski / Riesel - Base 23 michaf Conjectures 'R Us 2 2007-12-17 05:04
Sierpinski / Riesel - Base 22 michaf Conjectures 'R Us 49 2007-12-17 05:03
Sierpinski Base 5 Reservations geoff Sierpinski/Riesel Base 5 2 2006-08-29 18:23

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

Wed Aug 5 13:19:14 UTC 2020 up 19 days, 9:06, 1 user, load averages: 1.47, 1.77, 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.