* [9fans] probably problematic primes
@ 2007-05-09 23:22 don bailey
0 siblings, 0 replies; 2+ messages in thread
From: don bailey @ 2007-05-09 23:22 UTC (permalink / raw)
To: 9fans
-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
Oops, didn't register the 2^n instead of 2^(n-1). Nevermind.
Don
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.6 (GNU/Linux)
iD8DBQFGQlemyWX0NBMJYAcRAoeXAJ4jgwz2etD7Cdbb5MUbzCEezo/YugCdEHkc
8kkyHoTH29qjvD0BCBcFepI=
=k7L2
-----END PGP SIGNATURE-----
^ permalink raw reply [flat|nested] 2+ messages in thread
* [9fans] probably problematic primes
@ 2007-05-09 23:16 don bailey
0 siblings, 0 replies; 2+ messages in thread
From: don bailey @ 2007-05-09 23:16 UTC (permalink / raw)
To: 9fans
-----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-----
^ permalink raw reply [flat|nested] 2+ messages in thread
end of thread, other threads:[~2007-05-09 23:22 UTC | newest]
Thread overview: 2+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2007-05-09 23:22 [9fans] probably problematic primes don bailey
-- strict thread matches above, loose matches on Subject: below --
2007-05-09 23:16 don bailey
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).