Uncommon · Knowledge
Carmichael number
Composite number in number theory
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 {\displaystyle n} .
From Wikipedia
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 {\displaystyle n} . They are infinite in number. They constitute the comparatively rare instances where the strict converse of Fermat's Little Theorem does not hold. This fact precludes the use of that theorem as an absolute test of primality. The Carmichael numbers form the subset K1 of the Knödel numbers. The Carmichael numbers were named after the American mathematician Robert Carmichael by Nicolaas Beeger, in 1950. Øystein Ore had referred to them in 1948 as numbers with the "Fermat property", or "F numbers" for short.
Text: Wikipédia, CC BY-SA 4.0. · Image: no coneguts (CC BY-SA 4.0) ·
Related cards
-
★
Carmichael function
Arithmetic function
-
★★
Fermat number
Positive integer of the form (2^(2^n))+1
-
★★
Primorial
Integer representing the product of the first n prime numbers
-
R★★
Ramanujan prime
Prime fulfilling an inequality related to the prime-counting function
-
★★
Hypercomplex number
Element of a unital algebra over the field of real numbers
-
★★
Fermat's theorem on sums of two squares
Theorem that an odd prime is a sum of two squares iff it is of the form 4𝑛+1