Common · Knowledge
Carmichael function
Arithmetic function
In number theory, a branch of mathematics, the Carmichael function λ(n) of a positive integer n is the smallest positive integer m such that a m ≡ 1 ( mod n ) {\displaystyle a^{m}\equiv 1{\pmod {n}}} holds for every integer a coprime to n. In algebraic terms, λ(n) is the exponent of the multiplicative group of integers modulo n.
From Wikipedia
In number theory, a branch of mathematics, the Carmichael function λ(n) of a positive integer n is the smallest positive integer m such that a m ≡ 1 ( mod n ) {\displaystyle a^{m}\equiv 1{\pmod {n}}} holds for every integer a coprime to n. In algebraic terms, λ(n) is the exponent of the multiplicative group of integers modulo n. As this is a finite abelian group, there must exist an element whose order equals the exponent, λ(n). Such an element is called a primitive λ-root modulo n. The Carmichael function is named after the American mathematician Robert Carmichael who defined it in 1910. It is also known as Carmichael's λ function, the reduced totient function, and the least universal exponent function. The order of the multiplicative group of integers modulo n is φ(n), where φ is Euler's totient function. Since the order of an element of a finite group divides the order of the group, λ(n) divides φ(n). The following table compares the first 36 values of λ(n) (sequence A002322 in the OEIS) and φ(n) (in bold if they are different; the values of n such that they are different are listed in (sequence A033949 in the OEIS)).
Text: Wikipédia, CC BY-SA 4.0. · Image: Proz (CC0) ·
Related cards
-
★★★
Lambert W function
Multivalued function that is the inverse of the map z ↦ z exp(z)
-
★★★★
Gamma function
Extension of the factorial function, with its argument shifted down by 1, to real and complex numbers
-
C★
Cramér's conjecture
Conjecture
-
★★★
Fermat's little theorem
Mathematical theorem that, for any prime 𝑝, the 𝑝th power of any integer 𝑛 is congruent to 𝑛 modulo 𝑝
-
F★
Factorial number system
Mixed radix numeral system adapted to numbering permutations; represents a number as a×0! + b×1! + c×2! + ⋯
-
★★★
Euler's totient function
Function which gives the number of integers relatively prime to and not greater than its input
-
S★★
Superfactorial
Function
-
★★★
Cayley–Hamilton theorem
Theorem that a square matrix satisfies its own characteristic equation
-
M★
Minimal polynomial (linear algebra)
Minimal polynomial of a matrix
-
★
Cayley's formula
Result in graph theory
-
M★
Modular multiplicative inverse
Element which, once multiplied by a given element, gives a congruent of one
-
★
Algebraic function
Function that can be defined as the root of a polynomial equation
-
★★★
Cauchy sequence
Sequence whose elements become arbitrarily close to each other
-
★★
Partition function (number theory)
Number of partitions of an integer, often used in number theory
-
★
Chebyshev function
Mathematical function
-
★★
Euler's theorem
Generalization of Fermat's little theorem, that given coprime positive integers 𝑛 and 𝑎, then the φ(𝑛)-th power of 𝑎 is congruent to 1 modulo 𝑛, where φ is Euler’s totient function
-
F★★
Fibonorial
Mathematical series, portmanteau of "Fibonacci" and "factorial"
-
★★★
Common logarithm
The logarithm with base 10, formerly widely used for calculations