OFFSET
1,1
COMMENTS
If c*p is a Carmichael number, where p is a prime, then (p-1)|(c-1), so given c, the number of possible primes is bounded by the number of divisors of c-1.
The corresponding number of solutions is 0, 5, 7, 10, 12, 14, 18, 26, 30, 33, 55, 65, 71, 72, 90, 92, 112, 128, 192, 218.
EXAMPLE
1729 has 5 prime numbers p: 37, 73, 109, 433 and 577, such that 1729*p: 63973, 126217, 188461, 748657 and 997633 are also Carmichael numbers.
MATHEMATICA
carmichaelQ[n_] := Not[PrimeQ[n]] && Divisible[n - 1, CarmichaelLambda[n]];
CROSSREFS
KEYWORD
nonn
AUTHOR
Amiram Eldar, Sep 15 2017
STATUS
approved