17 Dec
2003
17 Dec
'03
11:17 p.m.
Nathan Zook wrote:
don't have a GNU ftp site to hand.
There's a function
int mpz_probab_prime_p(mpnum, SURETY)
which returns true if the prime passes SURETY probablistic prime tests.
I think if it passes say 25 tests, then there will be less than a 1/2^25 chance that it is not prime.
Also, on:
The proper thing to do is to then search for a number which demonstrates p is prime....
And how do you do this? I'm not aware of any deterministic primality test which isn't atleast as hard as factoring. P-1 factorial is such a number which could demonstrate P is prime (compute the gcd, check if they are relatively prime). Good luck computing it. -Ray