Building pseudoprimes with a large number of prime factors (Q1919698)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Building pseudoprimes with a large number of prime factors |
scientific article; zbMATH DE number 909642
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Building pseudoprimes with a large number of prime factors |
scientific article; zbMATH DE number 909642 |
Statements
Building pseudoprimes with a large number of prime factors (English)
0 references
10 October 1996
0 references
In this highly readable paper, the authors begin with a review of \textit{G. Löh} and \textit{W. Niebuhr}'s method for generating large Carmichael numbers [Math. Comput. 65, 823-836 (1996; Zbl 0855.11066)]. They then proceed to extend this algorithm for use in generating other types of pseudoprimes. In particular, they find large Williams pseudoprimes, elliptic pseudoprimes, and strong and superstrong Dickson pseudoprimes. There is an extensive bibliography.
0 references
primality testing
0 references
Lucas sequences
0 references
generating pseudoprimes
0 references
bibliography
0 references
large Carmichael numbers
0 references
large Williams pseudoprimes
0 references
elliptic pseudoprimes
0 references
superstrong Dickson pseudoprimes
0 references
