On Numbers Analogous to the Carmichael Numbers
From MaRDI portal
Publication:4145779
Cited in
(17)- On generalized Lucas pseudoprimes
- Carmichael numbers with \(p+1\mid n+1\)
- Lucas Pseudoprimes
- Building pseudoprimes with a large number of prime factors
- On strong Dickson pseudoprimes
- Square-free Lucas d-pseudoprimes and Carmichael-Lucas numbers
- Fermat test with Gaussian base and Gaussian pseudoprimes.
- The Korselt set of a power of a prime
- On Williams numbers with three prime factors
- KORSELT NUMBERS AND SETS
- Fast tabulation of challenge pseudoprimes
- Some primality conditions for \(N=2p^n -1\)
- Estimating the counts of Carmichael and Williams numbers with small multiple seeds
- Strengthening the Baillie-PSW primality test
- Higher-order Carmichael numbers
- The Rabin-Monier theorem for Lucas pseudoprimes
- A one-parameter quadratic-base version of the Baillie-PSW probable prime test
This page was built for publication: On Numbers Analogous to the Carmichael Numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4145779)