Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » Software » comp.soft-sys.math.mathematica

Topic: Prime numbers and primality tests
Replies: 4   Last Post: Jan 22, 2013 11:18 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
bobbaillie@frii.com

Posts: 18
Registered: 11/27/06
Re: Prime numbers and primality tests
Posted: Jan 20, 2013 1:25 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

I wouldn't use the Lucas pseudoprime test by itself. The key is to
use a regular pseudoprime test a^(N-1) = 1 (mod N) (like Miller-Rabin)
AND a Lucas test.

The types of pseudoprimes that pass a regular test tend to have differ
characteristics than those that pass a Lucas test. In other words, if
you make a list of regular pseudoprimes (say, base 2) and another list
of Lucas pseudoprimes, then the two lists tend to avoid each other and
there is very little overlap, that is, few numbers that can survive
both tests.

This is explained in a paper, "Lucas Pseudoprimes", which you can find
at http://mpqs.free.fr/LucasPseudoprimes.pdf

Robert Baillie





Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.