-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

Is the implementation of Fermat's probably prime algorithm in
probably_prime.crobably_prime( correct? I thought the algorithm is:

isPrime = (2^(n-1) mod n == 1)

not
isPrime = (2^(n-1) mod n == 2)

Don
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.6 (GNU/Linux)

iD8DBQFGQlZiyWX0NBMJYAcRAroLAJ0cu1prgXdaym7M5ytpK7 LQEV//uQCfYw6w
N+H8XC+ZXUnHqn35Ha0B5Qs=
=Ir4C
-----END PGP SIGNATURE-----