Global Information Lookup Global Information

Root of unity modulo n information


In number theory, 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 (or congruence) . If k is the smallest such exponent for x, then x is called a primitive kth root of unity modulo n.[1] See modular arithmetic for notation and terminology.

The roots of unity modulo n are exactly the integers that are coprime with n. In fact, these integers are roots of unity modulo n by Euler's theorem, and the other integers cannot be roots of unity modulo n, because they are zero divisors modulo n.

A primitive root modulo n, is a generator of the group of units of the ring of integers modulo n. There exist primitive roots modulo n if and only if where and are respectively the Carmichael function and Euler's totient function.

A root of unity modulo n is a primitive kth root of unity modulo n for some divisor k of and, conversely, there are primitive kth roots of unity modulo n if and only if k is a divisor of

  1. ^ Finch, Stephen; Martin, Greg; Sebah, Pascal (2010). "Roots of unity and nullity modulo n" (PDF). Proceedings of the American Mathematical Society. 138 (8): 2729–2743. doi:10.1090/s0002-9939-10-10341-4. Retrieved 2011-02-20.

and 24 Related for: Root of unity modulo n information

Request time (Page generated in 1.021 seconds.)

Root of unity modulo n

Last Update:

number theory, 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...

Word Count : 2091

Primitive root modulo n

Last Update:

a primitive root modulo n if every number a coprime to n is congruent to a power of g modulo n. That is, g is a primitive root modulo n if for every...

Word Count : 2530

Root of unity

Last Update:

of modular integers, see Root of unity modulo n. Every nth root of unity z is a primitive ath root of unity for some a ≤ n, which is the smallest positive...

Word Count : 5939

Finite field

Last Update:

number of nth roots of unity in GF(q) is gcd(n, q − 1). In a field of characteristic p, every (np)th root of unity is also a nth root of unity. It follows...

Word Count : 6162

Primitive root

Last Update:

mathematics, a primitive root may mean: Primitive root modulo n in modular arithmetic Primitive nth root of unity amongst the solutions of zn = 1 in a field...

Word Count : 63

Principal root of unity

Last Update:

n/2-th root of −1 is a principal n-th root of unity. A non-example is 3 {\displaystyle 3} in the ring of integers modulo 26 {\displaystyle 26} ; while 3...

Word Count : 226

Cyclotomic polynomial

Last Update:

the field of the rational numbers of any primitive nth-root of unity ( e 2 i π / n {\displaystyle e^{2i\pi /n}} is an example of such a root). An important...

Word Count : 5019

Square root

Last Update:

above. Apotome (mathematics) Cube root Functional square root Integer square root Nested radical Nth root Root of unity Solving quadratic equations with...

Word Count : 6180

Cyclic group

Last Update:

integers. Every finite cyclic group of order n is isomorphic to the additive group of Z/nZ, the integers modulo n. Every cyclic group is an abelian group...

Word Count : 4113

Ideal class group

Last Update:

J ≠ R {\displaystyle J\neq R} , because the quotient ring of R {\displaystyle R} modulo the ideal ( 1 + − 5 ) {\displaystyle (1+{\sqrt {-5}})} is isomorphic...

Word Count : 2149

Galois ring

Last Update:

group of (pr – 1)-th roots of unity. It is a cyclic group of order pr – 1. The subgroup G2 is 1+pR, consisting of all elements congruent to 1 modulo p. It...

Word Count : 1534

Quadratic field

Last Update:

th root of unity, with p {\displaystyle p} an odd prime number. The uniqueness is a consequence of Galois theory, there being a unique subgroup of index...

Word Count : 1288

Kummer theory

Last Update:

contains n distinct nth roots of unity, which implies that the characteristic of K doesn't divide n, then adjoining to K the nth root of any element a of K creates...

Word Count : 1970

Splitting field

Last Update:

Q and p(x) = x3 − 2. Each root of p equals 3√2 times a cube root of unity. Therefore, if we denote the cube roots of unity by ω 1 = 1 , {\displaystyle...

Word Count : 2870

Gaussian period

Last Update:

the seventeenth root of unity ζ = exp ⁡ ( 2 π i 17 ) . {\displaystyle \zeta =\exp \left({\frac {2\pi i}{17}}\right).} Given an integer n > 1, let H be any...

Word Count : 1130

Discrete Fourier transform over a ring

Last Update:

principal nth root of unity, defined by: The discrete Fourier transform maps an n-tuple ( v 0 , … , v n − 1 ) {\displaystyle (v_{0},\ldots ,v_{n-1})} of elements...

Word Count : 2816

Cyclotomic field

Last Update:

adjoining a complex root of unity to Q, the field of rational numbers. Cyclotomic fields played a crucial role in the development of modern algebra and...

Word Count : 1713

Algebraically closed field

Last Update:

Then the quotient of F[x] modulo the ideal generated by p(x) is an algebraic extension of F whose degree is equal to the degree of p(x). Since it is not...

Word Count : 1673

Quadratic reciprocity

Last Update:

the law of quadratic reciprocity is a theorem about modular arithmetic that gives conditions for the solvability of quadratic equations modulo prime numbers...

Word Count : 8540

Eisenstein integer

Last Update:

{-1+i{\sqrt {3}}}{2}}=e^{i2\pi /3}} is a primitive (hence non-real) cube root of unity. The Eisenstein integers form a triangular lattice in the complex plane...

Word Count : 1640

Quadratic Gauss sum

Last Update:

g(a;p)=∑n=0p−1ζpan2,{\displaystyle g(a;p)=\sum _{n=0}^{p-1}\zeta _{p}^{an^{2}},} where ζp{\displaystyle \zeta _{p}} is a primitive pth root of unity, for...

Word Count : 1437

Cubic reciprocity

Last Update:

the cubic residue character of α {\displaystyle \alpha } modulo π {\displaystyle \pi } and is denoted by ( α π ) 3 = ω k ≡ α N ( π ) − 1 3 mod π . {\displaystyle...

Word Count : 4061

Quadratic residue code

Last Update:

th root of unity in some finite extension field of G F ( l ) {\displaystyle GF(l)} . The condition that l {\displaystyle l} is a quadratic residue of p...

Word Count : 891

Reciprocity law

Last Update:

element of Z[ζ] that is coprime to a and l {\displaystyle l} and congruent to a rational integer modulo (1–ζ)2. Suppose that ζ is an lth root of unity for...

Word Count : 1830

PDF Search Engine © AllGlobal.net