A new algorithm for constructing large Carmichael numbers

@article{Lh1996ANA,
  title={A new algorithm for constructing large Carmichael numbers},
  author={G{\"u}nter L{\"o}h and W. Niebuhr},
  journal={Math. Comput.},
  year={1996},
  volume={65},
  pages={823-836}
}
We describe an algorithm for constructing Carmichael numbers N with a large number of prime factors p 1 ,p 2 ,...,p k . This algorithm starts with a given number Λ = lcm(p 1 −1,p 2 −1,..., p k −1), representing the value of the Carmichael function λ(N). We found Carmichael numbers with up to 1101518 factors. 
View via Publisher
ams.org
12 Citations
Highly Influential Citations
2
Background Citations
5
Methods Citations
3

Tables and Topics from this paper

12 Citations

Citation Type

Citation Type

Constructing Carmichael numbers through improved subset-product algorithms
Generalizations of Carmichael numbers I
Carmichael numbers and the sieve
Carmichael Numbers of the form ( 6 m + 1 ) ( 12 m + 1 ) ( 18 m + 1 )
Generalizations of Carmichael numbers I
On k-Lehmer Numbers
New polynomials producing absolute pseudoprimes with any number of prime factors
A Note on Strong Dickson Pseudoprimes
  • Siguna Müller
  • Mathematics, Computer Science
  • Applicable Algebra in Engineering, Communication and Computing
  • 1998
Product Subset Problem : Applications to number theory and cryptography
Wie kann man Primzahlen erkennen
...
1
2
...

References

SHOWING 1-10 OF 41 REFERENCES
A new method for producing large Carmichael numbers
Building Carmichael numbers with a large number of prime factors and generalization to other numbers
The Carmichael numbers up to $10^{16}$
Larger Carmichael numbers
Long chains of nearly doubled primes
On Fermat's simple theorem
On Highly Composite Numbers
Prime numbers and computer methods for factorization
An Introduction to the Theory of Numbers
Twenty-two primes in arithmetic progression
...
1
2
3
4
5
...