Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.soft-sys.math.mathematica > #13221

Re: Prime numbers and primality tests

From RBaillie <bobbaillie@frii.com>
Newsgroups comp.soft-sys.math.mathematica
Subject Re: Prime numbers and primality tests
Date 2013-01-20 06:25 +0000
Message-ID <kdg2kq$hf6$1@smc.vnet.net> (permalink)
References <kd2lt4$co5$1@smc.vnet.net>
Organization Time-Warner Telecom

Show all headers | View raw


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

Back to comp.soft-sys.math.mathematica | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread


Thread

Prime numbers and primality tests johnfeth@gmail.com - 2013-01-15 04:28 +0000
  Re: Prime numbers and primality tests amzoti <amzoti@gmail.com> - 2013-01-19 06:14 +0000
  Re: Prime numbers and primality tests RBaillie <bobbaillie@frii.com> - 2013-01-20 06:25 +0000
    Re: Prime numbers and primality tests RBaillie <bobbaillie@frii.com> - 2013-01-21 05:06 +0000
  Re: Prime numbers and primality tests RBaillie <bobbaillie@frii.com> - 2013-01-23 04:18 +0000

csiph-web