mersenneforum.org  

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

Reply
 
Thread Tools
Old 2007-03-09, 08:33   #1
Skligmund
 
Skligmund's Avatar
 
Dec 2006
Anchorage, Alaska

7810 Posts
Default Question: PRP and LLR

I'm still a noob (with lots of computing power) at this prime stuff. I'm just curious, what is the difference between proth.exe (PRP) and LLR.exe (LLR)?

I'm just messing around checking out how they work, and I don't know what the difference is between the two. If I was to be looking for a standard k*2^n-1 prime, what program would be the choice? Thanks for any info!
Skligmund is offline   Reply With Quote
Old 2007-03-09, 12:26   #2
gribozavr
 
gribozavr's Avatar
 
Mar 2005
Internet; Ukraine, Kiev

1100101112 Posts
Default

Basically, the difference is:
LLR gives you a definite answer: (1) this number is prime or (2) it isn't.
PRP can say: (1) this number is definitely composite, or (2) this number is probably prime, but there are still chances that it isn't.

Last fiddled with by gribozavr on 2007-03-09 at 12:37
gribozavr is offline   Reply With Quote
Old 2007-03-09, 13:53   #3
Jean Penné
 
Jean Penné's Avatar
 
May 2004
FRANCE

2·281 Posts
Default

Quote:
Originally Posted by gribozavr View Post
Basically, the difference is:
LLR gives you a definite answer: (1) this number is prime or (2) it isn't.
PRP can say: (1) this number is definitely composite, or (2) this number is probably prime, but there are still chances that it isn't.
Note that Yves Gallot's Proth.exe ALSO gives a definite answer! Not to be confused with George Woltman's PRP, which is a probable prime asserting program (but which is very fast).
Jean Penné is offline   Reply With Quote
Old 2007-03-09, 16:13   #4
MooooMoo
Apprentice Crank
 
MooooMoo's Avatar
 
Mar 2006

2×227 Posts
Default

Quote:
Originally Posted by Jean Penné View Post
Note that Yves Gallot's Proth.exe ALSO gives a definite answer! Not to be confused with George Woltman's PRP, which is a probable prime asserting program (but which is very fast).
Also, both PRP and LLR are much faster than Gallot's Proth.exe. For n=195,000, I needed about 5 minutes to verify a prime using proth.exe, while the same verification on LLR would have been done in less than 2 minutes.
MooooMoo is offline   Reply With Quote
Old 2007-03-09, 16:41   #5
Skligmund
 
Skligmund's Avatar
 
Dec 2006
Anchorage, Alaska

10011102 Posts
Default

Oh! Okay!

Hey, thanks for the info. I did a little digging around and came up with some of that, but now everything is clear.

Thank you sirs!
Skligmund is offline   Reply With Quote
Old 2007-03-09, 17:16   #6
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

22×1,543 Posts
Default

You can perform a primality test on any k*b^n+-1 numbers with PFGW, which is built on George's FFT code and is much faster than Proth as well. Primality testing with PFGW is slower than PRP testing with LLR/PRP.
rogue is online now   Reply With Quote
Reply

Thread Tools


All times are UTC. The time now is 15:44.

Thu Jan 21 15:44:08 UTC 2021 up 49 days, 11:55, 0 users, load averages: 2.17, 1.94, 1.95

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, 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.