Results 1 
4 of
4
The Carmichael Numbers up to 10^15
, 1992
"... There are 105212 Carmichael numbers up to 10 : we describe the calculations. ..."
Abstract

Cited by 18 (7 self)
 Add to MetaCart
There are 105212 Carmichael numbers up to 10 : we describe the calculations.
Building Pseudoprimes With A Large Number Of Prime Factors
, 1995
"... We extend the method due originally to Loh and Niebuhr for the generation of Carmichael numbers with a large number of prime factors to other classes of pseudoprimes, such as Williams's pseudoprimes and elliptic pseudoprimes. We exhibit also some new Dickson pseudoprimes as well as superstrong ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We extend the method due originally to Loh and Niebuhr for the generation of Carmichael numbers with a large number of prime factors to other classes of pseudoprimes, such as Williams's pseudoprimes and elliptic pseudoprimes. We exhibit also some new Dickson pseudoprimes as well as superstrong Dickson pseudoprimes.
A new algorithm for constructing large Carmichael
 Ken Nakamula, Department of Mathematics and Information Sciences, Tokyo Metropolitan University, MinamiOsawa, Hachioji
, 1996
"... Abstract. We describe an algorithm for constructing Carmichael numbers N with a large number of prime factors p1,p2,...,pk. This algorithm starts with a given number Λ = lcm(p1 − 1,p2 −1,...,pk − 1), representing the value of the Carmichael function λ(N). We found Carmichael numbers with up to 11015 ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We describe an algorithm for constructing Carmichael numbers N with a large number of prime factors p1,p2,...,pk. This algorithm starts with a given number Λ = lcm(p1 − 1,p2 −1,...,pk − 1), representing the value of the Carmichael function λ(N). We found Carmichael numbers with up to 1101518 factors. 1.
ANEWALGORITHM FOR CONSTRUCTING LARGE CARMICHAEL NUMBERS
"... Abstract. We describe an algorithm for constructing Carmichael numbers N with a large number of prime factors p1,p2,...,pk. This algorithm starts with a given number Λ = lcm(p1 − 1,p2 −1,...,pk −1), representing the value of the Carmichael function λ(N). We found Carmichael numbers with up to 110151 ..."
Abstract
 Add to MetaCart
Abstract. We describe an algorithm for constructing Carmichael numbers N with a large number of prime factors p1,p2,...,pk. This algorithm starts with a given number Λ = lcm(p1 − 1,p2 −1,...,pk −1), representing the value of the Carmichael function λ(N). We found Carmichael numbers with up to 1101518 factors. 1.