Live briefing
Everything about Carmichael function
Function in mathematical number theory
In number theory, a branch of mathematics, the Carmichael function λ(n) of a positive integer n is the smallest positive integer m such that 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. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Carmichael functionA 5-minute orientation
- Pick up a classic book: RNA silencingThe most-reprinted book on the subject
- Read the landmark paper: On the moments of the Carmichael λ functionCited 4 times
- Go sideways: Root of unity modulo nA closely related topic
- Go sideways: Multiplicative group of integers modulo nA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
On the moments of the Carmichael λ function
Square-free values of the Carmichael function
On the Counting Function of Elliptic Carmichael Numbers
on the value set of the Carmichael λ-function
The Carmichael Function in Graph Theory
Some remarks on the Carmichael and on the Euler's ϕ function
Values of the Carmichael Function Equal to a Sum of Two Squares
📚 Books worth reading
RNA silencingGordon Carmichael · 2005
Distributions and analytic functionsRichard D. Carmichael · 1989
The House of LordsBarry Fitzpatrick · 1999- 📕Team production functionsFiona Carmichael · 1992
- 📕Distributions and analytic functionsRichard D Carmichael · 1989
The correlation of the ovarian and uterine functionsE. S. Carmichael · 1907- 📕Notes on boundary values in ultradistribution spacesRichard D. Carmichael · 1999
- 📕Boundary values and convolution in ultradistribution spacesRichard D Carmichael · 2007
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Root of unity modulo n In mathematics, a kth root of unity modulo n for positive integers k, n ≥ 2, is a root of unity in the ring of integers modulo n; that is, a solution x…
- Multiplicative group of integers modulo n In modular arithmetic, the integers coprime (relatively prime) to n from the set {0,1,…,n−1} of n non-negative integers form a group under multiplication…
- Primitive root modulo n In number theory, a number g is a primitive root modulo n if every number a coprime to n is congruent to a power of g modulo n. In symbols, g is a primitive…
- Euler's theorem In number theory, Euler's theorem (also known as the Fermat–Euler theorem or Euler's totient theorem) states that, if n and a are coprime positive integers…
- Modular arithmetic In mathematics, modular arithmetic is a system of arithmetic operations for integers, differing from the usual ones in that numbers "wrap around" when…
- Multiplicative order In number theory, given a positive integer n and an integer a coprime to n, the multiplicative order of a modulo n is the smallest positive integer k such…
- Arithmetic function This article uses technical mathematical notation for logarithms. All instances of log(x) without a subscript base should be interpreted as a natural…
- Fermat's little theorem In number theory, Fermat's little theorem states that if p is a prime number, then for any integer a, the number ap − a is an integer multiple of p. In…