Problem 49788. Carmichael Number

• Created by Gifari Zulkarnaen
• Appears in Easy Sequences Volume III

×

Like (3)

• Solve Later   
• Add To GroupÂ

Car michael number is a composite number n which satisfy following relation:

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.

Hint: Since can become a big number, using a modular exponentiation algorithm may help.

Solve

Solution Stats

29.09% Correct | 70.91% Incorrect

• 55 Solutions
• 10 Solvers

Last Solution submitted on Dec 13, 2023

Last 200 Solutions

Solution Comments

Problem Recent Solvers10

Suggested Problems

• Scoring for oriented dominoes

  875 Solvers

• Generate a random matrix A of (1,-1)

  362 Solvers

• Given a matrix, swap the 2nd & 3rd columns

  1163 Solvers

• Moving average (variable kernel length)

  129 Solvers

• Calendar Matrix

  124 Solvers

More from this Author1

• Decimal to Binary conversion for Large Integers

  4 Solvers