*In an infinite set of odd composite numbers, called Carmichael numbers, every relatively prime…

*In an infinite set of odd composite numbers, called
Carmichael numbers, every relatively prime smaller number is a Fermat liar. In
other words, p is a Carmichael number if p is odd and every n where 1 n p and
GCD p, n 1 is a Fermat liar. Write an algorithm to list the Carmichael numbers
between 1 and 10,000 and their prime factors.