[fpc-pascal]isprime()

astlab at inwind.it astlab at inwind.it
Sun Feb 9 19:01:24 CET 2003


Hi Mark

> Just out of curiosity, is Franco's algorithm based upon the recent
> discovery by mathematicians in India?

No, the method of Agrawal, Kayal and Saxena is still in a theoretical
state and we have to wait for an efficient algorithm to apply it.
I used an old Miller-Rabin method. By testing the strong probable
primality to some bases, in particular ranges we can have the certainty
that the number is prime.
See for example http://www.utm.edu/research/primes/prove/prove2_3.html

Franco




More information about the fpc-pascal mailing list