Bad witnesses for a composite number
From MaRDI portal
Publication:6606883
Recommendations
Cites work
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 3141365 (Why is no real title available?)
- scientific article; zbMATH DE number 3943948 (Why is no real title available?)
- scientific article; zbMATH DE number 799757 (Why is no real title available?)
- scientific article; zbMATH DE number 6308078 (Why is no real title available?)
- A faster pseudo-primality test
- Average liar count for degree-\(2\) Frobenius pseudoprimes
- Elliptic periods and primality proving
- Four primality testing algorithms
- Frobenius pseudoprimes
- Lucas Pseudoprimes
- On the Number of False Witnesses for a Composite Number
- On the normal number of prime factors of \(p - 1\) and some related problems concerning Euler's \(\varphi\)-function.
- Popular values of Euler's function
- Probabilistic algorithm for testing primality
- Riemann's hypothesis and tests for primality
- Shifted primes without large prime factors
- Strengthening the Baillie-PSW primality test
- There are infinitely many Carmichael numbers
- Некоторые критерии простоты чисел, связанные с малой теоремой Ферма
This page was built for publication: Bad witnesses for a composite number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606883)