We described an algorithm for constructing Carmichael numbers N with a
large number of prime factors p(1),p2,...,p(k); This algorithm starts
with a given number Lambda = lcm(p(1) - 1,p(2) - 1,...,p(k) - 1), rep
resenting the value of the Carmichael function lambda(N). We found Car
michael numbers with up to 1101518 factors.