|
Organizers |
Carmichael numbers with exactly k prime factors
by
Jon Grantham
Center for Computing Sciences
Coauthors: W. R. Alford
We present an algorithm for generating many Carmichael numbers with exactly k prime factors, for all 3 <= k <= B, where B is some large number. Results of preliminary computations will be presented.
Date received: April 13, 1998
Copyright © 1998 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caar-04.