Carmichael number
Composite number in number theory
Carmichael number
In number theory, a Carmichael number is a composite number n {\displaystyle n} which in modular arithmetic satisfies the congruence relation: b n ≡ b ( mod n ) {\displaystyle b^{n}\equiv b{\pmod {n}}} for all integers b {\displaystyle b} . The relation may also be expressed in the form: b n − 1 ≡ 1 ( mod n ) {\displaystyle b^{n-1}\equiv 1{\pmod {n}}} for all integers b {\displaystyle b} that are relatively prime to n...
Read on Wikipedia · Image no coneguts, CC BY-SA 4.0
Open boosters, collect cards and trade them. Free to play.
Play for free