|
20
|
On the Distribution of Pseudoprimes
– Carl Pomerance
- 1981
|
|
8
|
jr, The pseudoprimes up to 25.10
– C Pomerance, J L Selfridge, S S Wagstaff
- 1980
|
|
61
|
There are infinitely many Carmichael numbers
– W. R. Alford, Andrew Granville, Carl Pomerance
- 1982
|
|
5
|
Review 13[9] — table of Carmichael numbers to 10 9
– J D Swift
- 1975
|
|
3
|
On Fermat d-pseudoprimes
– Lawrence Somer
|
|
8
|
Nagaraj, Density of Carmichael numbers with three prime factors
– R. Balasubramanian, S. V. Nagaraj
|
|
4
|
On composite numbers n for which a n−1 ≡ 1 mod n for every a prime to n, Scripta Mathematica 16
– N G W H Beeger
- 1950
|
|
163
|
Probabilistic algorithm for testing primality
– Michael Rabin
- 1980
|
|
4
|
The Number of Distinct Prime Factors for Which oe(N
– M Kishore
- 1977
|
|
3
|
Do there exist composite numbers for which kφ(M
– E Lieuwens
- 1970
|
|
34
|
Unsolved Problems in Number Theory. Second edition
– R K Guy
- 1994
|
|
4
|
On Carmichael numbers, Simon Stevin 29
– H J A Duparc
- 1952
|
|
2
|
composite numbers P which satisfy the Fermat congruence a P −1
– On
- 1912
|
|
64
|
Prime Numbers and Computer Methods for Factorization
– Hans Riesel
- 1994
|
|
181
|
Riemann’s hypothesis and tests for primality
– G Miller
- 1976
|
|
1
|
jr, On the number of prime factors of n if φ(n
– G L Cohen, P Hagis
- 1980
|
|
1
|
On Fermat d-pseudoprimes, in De Koninck and Levesque [2
– Lawrence Somer
- 2006
|
|
1
|
jr, On the number of prime factors of n if φ(n)|n − 1, Nieuw
– G L Cohen, P Hagis
- 1980
|
|
2
|
Some asymptotic formulae in number theory
– Pál Erdős
- 1948
|
