Live briefing
Everything about 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 to the equation. If k is the smallest such exponent for x, then x is called a primitive kth root of unity modulo n. See modular arithmetic for notation and terminology. Wikipedia ā
š§ Start here: a 6-step reading path
- Read the overview: Root of unity modulo nA 5-minute orientation
- Pick up a classic book: Discrete MathmaticsThe most-reprinted book on the subject
- Read the landmark paper: Roots of unity and nullity modulo šCited 14 times
- Go sideways: Carmichael functionA closely related topic
- Go sideways: Arithmetic functionA closely related topic
š Definitions
No dictionary entry for this exact phrase.
šļø The subject at a glance
š Landmark papers (most cited)
š Books worth reading
Discrete MathmaticsR. K. Bisht, H. S. Dhami Ā· 2015
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
š Related topics
- 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)ā¦
- 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ā¦
- 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ā¦
- 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ā¦
- Cyclotomic polynomial In mathematics, the n-th cyclotomic polynomial, for any positive integer n, is the unique irreducible polynomial with integer coefficients that is a divisorā¦
- Finite field In mathematics, a finite field or Galois field (so-named in honor of Ćvariste Galois) is a field that has a finite number of elements. As with any fieldā¦
- 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ā¦
- Ramanujan's sum In number theory, Ramanujan's sum, usually denoted cq(n), is a function of two positive integer variables q and n defined by the formula cq(n)=ā1ā¤aā¤q(aā¦