mersenneforum.org  

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

Reply
 
Thread Tools
Old 2005-10-31, 14:31   #1
Kosmaj
 
Kosmaj's Avatar
 
Nov 2003

2×1,811 Posts
Default Welcome to "Riesel Prime Search"

The new project was established less than 30 minutes ago and we are now ready to go! We already have two pending primes. I'm sure more will come soon!

When you submit your primes please be sure to create a new prover's code and to include "RPS", the user-ID of the project, in the field next to the sieving program you used.

The first team effort has already started.

Finally, thanks to everybody who decided to join us and who helped us decide the name of the project quickly!

The project descriptive data (to be included in the Top-5000) page:

Quote:
The project is searching for Riesel primes k*2^n-1, k>1.
We have three subprojects as follows.
(1) k's that can produce many primes in the given range of exponent n,
(2) low-weight k's that produce a very small number of primes
[opposite to (1) above],
(3) small k < 300 (with exception of those k's already reserved by
other projects).
If you have any comments on this please let me know.

Last fiddled with by Kosmaj on 2005-10-31 at 15:06
Kosmaj is offline   Reply With Quote
Old 2005-10-31, 14:53   #2
Flatlander
I quite division it
 
Flatlander's Avatar
 
"Chris"
Feb 2005
England

31×67 Posts
Default

Quote:
Originally Posted by Citrix
Please start a new sub-forum, instead of having new threads in this sub-forum. Talk to the admins for this. This will help keep things seperate in terms of which project is doing what. (What shane's 15K is doing and what your rieselsearch is doing)

Citrix

Also I vote for rieselsearch as the name.
So will there be a new sub-forum?
Flatlander is offline   Reply With Quote
Old 2005-10-31, 14:59   #3
Kosmaj
 
Kosmaj's Avatar
 
Nov 2003

2·1,811 Posts
Default

There will be soon a new forum in the "Other Projects" section.
Kosmaj is offline   Reply With Quote
Old 2005-10-31, 15:02   #4
fatphil
 
fatphil's Avatar
 
May 2003

E716 Posts
Default

Quote:
Originally Posted by Kosmaj
If you have any comments on this please let me know.
How is an outsider supposed to know which k are '15k', and which k are 'RPS'?

My back-filling of small primes for dense k's (be they 15*k for some k or not, but of course all the dense ones are) is done purely for the completeness of the record, and it would be nice to know how this split of ownership/responsibility will take place? Potentially, the tables at 15k.org look like the best record, but if they're not updated by dint of the k values being now RPS owned, then confusion will ensue -- at least for me. How is maintainance of those tables now going to be handled -- to whom should I report factors?
fatphil is offline   Reply With Quote
Old 2005-10-31, 15:04   #5
OmbooHankvald
 
OmbooHankvald's Avatar
 
May 2005
Copenhagen, Denmark

4418 Posts
Default

Quote:
Originally Posted by Kosmaj
(2) low-wight k's that produce a very small number of primes
[opposite to (1) above],
You should fix this typo before submitting the text ;)
OmbooHankvald is offline   Reply With Quote
Old 2005-10-31, 15:14   #6
Kosmaj
 
Kosmaj's Avatar
 
Nov 2003

2×1,811 Posts
Default

Phil, we are now in the transition phase, please be patient for a while.

Omboo, thanks, it's fixed now.
Kosmaj is offline   Reply With Quote
Old 2005-10-31, 17:03   #7
Flatlander
I quite division it
 
Flatlander's Avatar
 
"Chris"
Feb 2005
England

31·67 Posts
Default

Should new prover codes include 'NewPGen'?
Flatlander is offline   Reply With Quote
Old 2005-10-31, 18:00   #8
Citrix
 
Citrix's Avatar
 
Jun 2003

2·32·5·17 Posts
Default

If you guys have decided on using this sub forum please rename it to rps than 15k search.
Citrix is online now   Reply With Quote
Old 2005-10-31, 18:52   #9
lsoule
 
lsoule's Avatar
 
Nov 2004
California

23×3×71 Posts
Default

There will be a new RPS sub-forum soon (off of "Other Projects")
lsoule is offline   Reply With Quote
Old 2005-10-31, 20:56   #10
gribozavr
 
gribozavr's Avatar
 
Mar 2005
Internet; Ukraine, Kiev

11·37 Posts
Default

What should old 15k searchers do with their current reservations? I'm testing a low-weight k=177941 n=1 to 1M, now n=710722. What project does this k belong to? What k's belong to the other (with forum on yahoo) project?
gribozavr is offline   Reply With Quote
Old 2005-10-31, 21:21   #11
Kosmaj
 
Kosmaj's Avatar
 
Nov 2003

2×1,811 Posts
Default

1) All low-weight and all k<300 stay with RPS.

2) If you already have a reserved 15k multiplier and find a prime it depends on you do you wish to report it using an RPS or 15k prover's code. In any case it "belongs" to you until you stop working on it.

3) Team work on k=2995125705, k=210885, and k=355424355 all stay with RPS but note that the last one has no new ranges to reserve.

4) If you want to reserve a new 15k multiplier from the "Robinson weight" page there is currently no sharing system with 15k in place. If you just want one or two of them in a coming week or so you can reserve them I think, then (2) above applies. Something general will be worked out soon.
Kosmaj is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Aouessare-El Haddouchi-Essaaidi "test": "if Mp has no factor, it is prime!" wildrabbitt Miscellaneous Math 11 2015-03-06 08:17
Riesel Primes k*2^n-1, k<300 [Was "k=1"] wpolly Riesel Prime Search 599 2007-07-08 00:12
Would Minimizing "iterations between results file" may reveal "is not prime" earlier? nitai1999 Software 7 2004-08-26 18:12
Search for a number theoretic function related to "prime divisor sums" juergen Math 2 2004-07-10 23:01
The "Aaron Blosser" Search Warrant Gary Edstrom Lounge 6 2003-11-06 21:47

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

Wed May 27 12:37:26 UTC 2020 up 63 days, 10:10, 1 user, load averages: 1.89, 2.04, 1.91

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.