Note on primality testing

This library includes a Java port of Colin Plumb's implementation
of Euler's Criterion for primality testing, from his
bnlib (version 1.1) package. This test is consistently used,
throughout this package, in preference to the Miller-Rabin
probabilistic primality test—which is also implemented and
included.

During the development, and tests, of the primality testing code,
certain large numbers where found to be possible primes, even though
the invocation of the isProbablePrime() method, provided
by the java.math.BigInteger class claimed otherwise;
i.e. returned false. I then ran those numbers through a
primality proving application:
PRIMO. Consistently, PRIMO proved those numbers to be indeed
primes. I'm including the certificates PRIMO emits for review and to
help debug the code in BigInteger since I cannot myself
look at its source.