From mboxrd@z Thu Jan  1 00:00:00 1970
Message-ID: <46425662.4050403@gmail.com>
Date: Wed,  9 May 2007 17:16:50 -0600
From: don bailey <don.bailey@gmail.com>
User-Agent: Thunderbird 1.5.0.10 (X11/20070417)
MIME-Version: 1.0
To: 9fans@cse.psu.edu
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: 7bit
Subject: [9fans] probably problematic primes
Topicbox-Message-UUID: 610f7ca6-ead2-11e9-9d60-3106f5b1d025

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

Is the implementation of Fermat's probably prime algorithm in
probably_prime.c:probably_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)

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