Andrew Haley writes: > Johan Peeters writes: > > > > The guarantee that the result is prime seems rather weak considering > > that isProbablePrime() is called with argument 1. Assuming that the > > likelihood that steps 1 to 6 comes up with a prime is about 1/2, > > It isn't. Ron Rivest conjectures [1] that the probablility of finding > a randomly chosen 256-bit pseudoprime is less than 1 in 10^22.
Oh, silly me. Steps 1 to 6 are all before the primality test. Sorry. Andrew. _______________________________________________ Classpath mailing list [EMAIL PROTECTED] http://mail.gnu.org/mailman/listinfo/classpath
