| Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
| Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Tutorial LLR
Tutorial to LLR (Lucas Lehmer Riesel) and PRP:
LLR is a program used to prove primality of numbers. It can be rather slow (but faster if you support SSE2), and that's why it's a good idea to sieve first. It speeds up the process.
Also note that you operate PRP that exact same way as LLR except that it only finds numbers that are probable primes.
The projects Prime Sierpiński Project and Riesel Sieve also use LLRNET, which is recommended for people with a permanent connection to the Internet.
- Download the newest zip-file here (this is also the place to get PRP if you are from Sierpiński-Riesel Base 5
- Unzip the program
- Move the .txt-file from NewPGen, containing the k/n combinations you wish to test, to the same folder as LLR
- Start LLR by double-clicking on LLR.exe
- Choose Test and then Input Data
- Enter the name of the NewPGen-file in Input file and choose a name for the Output file (where the primes are reported)
- Click OK and the program goes to work (the icon changes from red to green). You can check the primes.log for new primes if you want.
- When the program is finished testing, the icon turns red again.
- Then you'll have to report the results
Questions
Where do I get a NewPGen file?
Sieved NewPGen-files are available for the projects 15k (phase 2), PSP and 321 (remember to reserve the range you choose).
Regarding Sierpiński-Riesel Base 5 you'll have to sieve with NewPGen yourself.
Can I run multiple NewPGen-files at once?
Yes. If you reserve multiple files you can make them one big: Just take the numbers from one of the files and paste them below the numbers in the other file.
However, line 1 must not be copied. Make sure the numbers are of the same form (normally k*2n+1 or k*2n-1).
