Thread: PRP queries
View Single Post
Old 2003-04-25, 05:30   #4
wfgarnett3
 
wfgarnett3's Avatar
 
"William Garnett III"
Oct 2002
Bensalem, PA

2×43 Posts
Default

Hi Ray,

Primality is hard to prove for general numbers. For easily factorable numbers when you add or subtract one, try:
http://www.primeform.net/openpfgw/

Mersenne, Proths, Riesels, and Generalized Fermat's are all factorable 100% when you add or subtract one, that's why they are easy to prove; they use Wilson's Theorm (I think). For any random odd number, the program to use is:

http://www.ellipsa.net/

But it takes a long time to use Primo to prove an odd number prime; but it does allow any odd integer.

Regards,
william
wfgarnett3 is offline