On Mon, 17 May 1999, Chris Nash wrote:
(talking about how maple decides that a number is "probably composite")
> The test is now tougher. If MAPLE now identifies a probable prime, it tests
> again, to another base, and if that also passes, it performs a test using a
> Lucas sequence. Again these are probable prime tests, so it is possible (and
> likely) composites exist that pass all three. I think Carl Pomerance himself
> has offered a cash prize for anyone who could find a counterexample to the
> "twice SPRP, one Lucas sequence" test - an indication that it is not an easy
> task of mere computation.
Do you have more precise information, or do you know where we can find it?
(the help function inside maple gives only a very superficial explanation)
Strong pseudoprime wrt which base? Probably not random, or the search
for a counterexample becomes meaningless. And which Lucas sequence?
http://www.mat.puc-rio.br/~nicolau
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
