No label defined (Q4217879)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1222361
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1222361 |
Statements
14 October 1999
0 references
primality testing
0 references
Lucas probable primes
0 references
Dickson probable primes
0 references
0.8010740280151367
0 references
0.7904615998268127
0 references
0.7876479029655457
0 references
\textit{R. Baillie} and \textit{S. Wagstaff jun.} [Math. Comput. 35, 1391-1417 (1980; Zbl 0458.10003)] proposed to combine two probable prime tests for testing primality of an odd integer \(n\). The first test is whether \(n\) is a strong probable prime in base 2, the second is whether \(n\) is a strong Lucas probable prime with parameters \(P, Q\) chosen by one of the following two algorithms: (i) take \(P=1\) and \(Q=(1-D)/4\), where \(D\) is the first element of the sequence \(5,-7,9,-11,13,\ldots\) for which \((D/n)=-1\); (ii) take \(P\) the least odd integer exceeding \(\sqrt D\) and \(Q=(P^2-D)/4\), where \(D\) is the first element of the sequence \(5,9,13,17,21,\ldots\) for which \((D/n)=-1\). The LD probable prime test, introduced by \textit{W. More} [Applications of Fibonacci numbers, Vol. 7, 283-289 (Kluwer, Dordrecht) (1998)] eliminates the search for a suitable \(D\) except in the case \(n\equiv 1 \pmod {24}\). Dickson probable primes were studied by \textit{W. Müller} and \textit{A. Oswald} [Applications of Fibonacci numbers, Vol. 5, 459-464 (Kluwer, Dordrecht) (1993; Zbl 0806.11004)]. These satisfy a single congruence where Lucas probable primes demand two. The author presents evidence that testing for Dickson pseudoprimes rather than Lucas pseudoprimes is not sufficient. For the entire collection see [Zbl 0899.00028].
0 references