Live briefing
Everything about Primitive root modulo n
Modular arithmetic concept
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 root modulo n if for every integer a coprime to n, there is some integer k for which gk ≡ a (mod n). Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Primitive root modulo nA 5-minute orientation
- Skim a recent paper: On the distribution of consecutive (k, r)-integer primitive roots modulo pInfluential work since 2022
- Read the landmark paper: On additive decompositions of the set of primitive roots modulo pCited 15 times
- Go sideways: Multiplicative group of integers modulo nA closely related topic
- Go sideways: Multiplicative orderA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
On additive decompositions of the set of primitive roots modulo p
Lehmer numbers and primitive roots modulo a prime
Pairs of consecutive primitive roots modulo a prime
On the Average of the Least Primitive Root Modulo p
On the least square-free primitive root modulo p
On the Least Primitive Root Modulo p 2
The average of the least primitive root modulo $p^2$
Fibonacci Primitive Roots and the Period of the Fibonacci Numbers Modulo p
🆕 Influential since 2022
📚 Books worth reading
Open Library didn't respond; try again in a moment.
🔗 Related topics
- 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…
- 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…
- 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…
- Carmichael 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 am≡1(modn)…
- 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…
- Root of unity In mathematics, a root of unity is any complex number that yields 1 when raised to some positive integer power n. Roots of unity are used in many branches…
- Gauss's lemma (number theory) Gauss's lemma in number theory gives a condition for an integer to be a quadratic residue. Although it is not useful computationally, it has theoretical…
- 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…