mersenneforum.org  

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

Reply
 
Thread Tools
Old 2005-11-02, 10:32   #12
BotXXX
 
BotXXX's Avatar
 
Aug 2003
Europe

19410 Posts
Default New forum?

Shouldn't the posts concerning RPS be moved to the newly created forum? http://mersenneforum.org/forumdisplay.php?f=59
BotXXX is offline   Reply With Quote
Old 2006-03-17, 10:56   #13
edorajh
 
edorajh's Avatar
 
Oct 2003
Croatia

23·3·19 Posts
Default

Quote:
Originally Posted by Flatlander
Should new prover codes include 'NewPGen'?
I can't find answer to this question. Should we include NewPGen in prover code even if we find prime in Team Drive? Not that I find one (but I hope I will ), I'm just curious.
edorajh is offline   Reply With Quote
Old 2012-08-17, 09:47   #14
Kosmaj
 
Kosmaj's Avatar
 
Nov 2003

2×1,811 Posts
Default

I'll try to collect answers to some frequent questions, a kind of FAQ, and the first one is:

Q: What does the first line of the LLR input (NewPGen output) file means?
A: this thread
Kosmaj is offline   Reply With Quote
Old 2012-08-17, 10:05   #15
Kosmaj
 
Kosmaj's Avatar
 
Nov 2003

2·1,811 Posts
Default

Q: Can I sieve myself?
A: Yes, for k*2^n-1 and k*2^n+1, fixed k, the fastest sieving program to use is srsieve.
Use sr1sieve to sieve a single k, or sr2sieve to sieve multiple k's at once.

However, for k<10000 (=10^4), on both plus and minus side, Psieve already sieved deep enough all n<3M (3E6). Larger exponents up to about n=6M are still being sieved but the latest output files are already well sieved and can be used for prime search.

In short, for k<10000 use the Psieve files and give credit to them, for k>10000 sieve yourself using srsieve.
Kosmaj is offline   Reply With Quote
Old 2012-09-13, 05:08   #16
shanecruise
 
shanecruise's Avatar
 
Mar 2012
Hyderabad, India

3·17 Posts
Default

i'm trying to run srseive on linux
can you help me with a sample input
shanecruise is offline   Reply With Quote
Old 2012-09-13, 09:32   #17
Thomas11
 
Thomas11's Avatar
 
Feb 2003

1,901 Posts
Default

Quote:
Originally Posted by shanecruise View Post
i'm trying to run srseive on linux
can you help me with a sample input
Let's assume that you want to sieve k=12345 for nmin=1M and nmax=1.2M:
Code:
./srsieve 12345*2^n-1 -n 1000000 -N 1200000 -f
The option "-f" means that the factors are written to a logfile (srfactors.txt). You may omit this.
Of course, you may specify more than one sequence (multiple k).
pmin and pmax can be specified by "-p" and "-P". If not given, the sieve will start at p=2 and will run until manually stopped (by pressing Ctrl-C).

The output will be written to the file "srsieve.out".
This file may be converted by using the tool called "srfile":
Code:
./srfile -g srsieve.out
This will create individual files for each k in NewPGen format. The option "-G" will create a combined file ("PRP" format). The option "-a" converts to "abcd" format. You will need this file format when you want to use sr2sieve.

Hope this helps...

Last fiddled with by Thomas11 on 2012-09-13 at 09:38
Thomas11 is offline   Reply With Quote
Old 2012-09-14, 03:33   #18
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

104A16 Posts
Default

I believe srsieve accepts the srfile flags for file type directly. So, you can end your srsieve command with a -g or -G to produce LLR-readable output directly.
-Curtis
VBCurtis is offline   Reply With Quote
Old 2012-09-14, 04:36   #19
shanecruise
 
shanecruise's Avatar
 
Mar 2012
Hyderabad, India

3·17 Posts
Default

ok so far so good

I figured out srseive and sr1seive, playing with them :)

now how do i give multiple k's?

Last fiddled with by shanecruise on 2012-09-14 at 05:05 Reason: made some progress :D
shanecruise is offline   Reply With Quote
Old 2012-09-14, 08:11   #20
Thomas11
 
Thomas11's Avatar
 
Feb 2003

76D16 Posts
Default

Quote:
Originally Posted by shanecruise View Post
ok so far so good

I figured out srseive and sr1seive, playing with them :)

now how do i give multiple k's?
Just by entering all expressions one after another separated by spaces, e.g. this way:
Code:
./srsieve 12345*2^n-1 12347*2^n-1 12349*2^n-1 -n 1000000 -N 1200000
Note that sr1sieve works for single k only. If you want to sieve multiple k at once you should use sr2sieve.

Quote:
Originally Posted by shanecruise
Also is this sr1sieve great for mersenne prime? k=1
I never tried. But why should you do this?
Thomas11 is offline   Reply With Quote
Old 2012-09-14, 09:34   #21
Kosmaj
 
Kosmaj's Avatar
 
Nov 2003

70468 Posts
Default

Of course you can sieve Mersenne primes with srsieve but it will very unefficient, because srsieve is a general purpose sieving software not employing the fact that factors can be only of form 2*m*n+1 (of 2^n-1). So even PrimeForm which has this feature will be faster than srsieve. But Gimps has many more speed-ups, and can do P-1 test, ecm curves and so on. You can download Gimps and try sieving without joining the project.

Regarding 5*n^2-1, can you tell us which file have you tried to sieve, and what factors have you found? Those test files are not the latest version, but they are fairly new, from a sieving file released a few months ago.
Kosmaj is offline   Reply With Quote
Old 2012-09-14, 09:51   #22
shanecruise
 
shanecruise's Avatar
 
Mar 2012
Hyderabad, India

3×17 Posts
Default

told you just playing with things :)
shanecruise 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 04:33.

Mon May 25 04:33:49 UTC 2020 up 61 days, 2:06, 0 users, load averages: 2.60, 2.42, 2.45

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.