(a) Write a computer program that uses Korselt’s Criterion to check if a number n is a Carmichael number.
(b) Earlier we listed all Carmichael numbers that are less than 10,000. Use your program to extend this list up to 100,000.
(c) Use your program to find the smallest Carmichael number larger than 1,000,000.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.