Problem 49788. Carmichael Number
for all integers b which are coprime to n.
For example, the smallest Carmichael number is 561. It has prime factors 3, 11, and 17, thus it is a composite number (not prime and not 1). The relation
is true for all integers b that are not divisible by 3, 11, or 17 (coprime to 561).
Build a function isCarmichael(x) that returns true if x is a Carmichael number and false otherwise.
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers10
Suggested Problems
-
1537 Solvers
-
Is my wife right? Now with even more wrong husband
1319 Solvers
-
Smallest distance between a point and a rectangle
177 Solvers
-
We love vectorized solutions. Problem 1 : remove the row average.
810 Solvers
-
13769 Solvers
More from this Author1
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!