Lucas Pseudoprimes
From MaRDI portal
Publication:3907627
DOI10.2307/2006406zbMath0458.10003OpenAlexW4240102284MaRDI QIDQ3907627
Robert Baillie, Samuel S. jun. Wagstaff
Publication date: 1980
Full work available at URL: https://doi.org/10.2307/2006406
Software, source code, etc. for problems pertaining to number theory (11-04) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Power residues, reciprocity (11A15) Primes (11A41)
Related Items
An efficient probabilistic public-key cryptosystem over quadratic fields quotients, Hidden multiscale order in the primes, Primitive abundant and weird numbers with many prime factors, Pseudoprimality related to the generalized Lucas sequences, Unnamed Item, Primality testing of large numbers in Maple, Unnamed Item, The generation of random numbers that are probably prime, Looking for Fibonacci base-2 pseudoprimes, Certifying giant nonprimes, Unnamed Item, Unnamed Item, Unnamed Item, Fast tabulation of challenge pseudoprimes, Frobenius pseudoprimes, Carmichael numbers with \(p+1\mid n+1\), Statistical Evidence for Small Generating Sets, Generalized Repunit Primes, The structure factor of primes, The error probability of the Miller-Rabin primality test, The Distribution of Lucas and Elliptic Pseudoprimes, On the effectiveness of a generalization of Miller's primality theorem, Unnamed Item, Square-free Lucas d-pseudoprimes and Carmichael-Lucas numbers, An unconditional improvement to the running time of the quadratic Frobenius test, Some thoughts on pseudoprimes, Average liar count for degree-$2$ Frobenius pseudoprimes, Primality tests, linear recurrent sequences and the Pell equation, Strengthening the Baillie-PSW primality test, Weak pseudoprimality associated with the generalized Lucas sequences, Generalized strong pseudoprime tests and applications, On the Number of Elliptic Pseudoprimes, The Rabin-Monier theorem for Lucas pseudoprimes, Higher-order Carmichael numbers, Some remarks on strong Fibonacci pseudoprimes, Computation of Fermat’s pseudoprimes (Dedicated to the Memory of Professor Leetsch C. Hsu), A one-parameter quadratic-base version of the Baillie-PSW probable prime test
Cites Work
- Riemann's hypothesis and tests for primality
- On Character Sums and L-Series†
- The Pseudoprimes to 25 ⋅10 9
- New Primality Criteria and Factorizations of 2 m ± 1
- Determination of the Primality of N by Using Factors of N 2 ± 1
- Some Algorithms for Prime Testing Using Generalized Lehmer Function
- On Numbers Analogous to the Carmichael Numbers
- Some Observations on Primality Testing
- On Pseudoprimes Which are Products of Distinct Primes
- On the Mean Value of f (p )
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
