When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Primitive root modulo n - Wikipedia

    en.wikipedia.org/wiki/Primitive_root_modulo_n

    In modular arithmetic, 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. That is, g is a primitive root modulo n if for every integer a coprime to n, there is some integer k for which g k ≡ a (mod n). Such a value k is called the index or discrete logarithm of a to the base g modulo n.

  3. Multiplicative group of integers modulo n - Wikipedia

    en.wikipedia.org/wiki/Multiplicative_group_of...

    Equivalently, the elements of this group can be thought of as the congruence classes, also known as residues modulo n, that are coprime to n. Hence another name is the group of primitive residue classes modulo n. In the theory of rings, a branch of abstract algebra, it is described as the group of units of the ring of integers modulo n.

  4. Cyclotomic polynomial - Wikipedia

    en.wikipedia.org/wiki/Cyclotomic_polynomial

    It may also be defined as the monic polynomial with integer coefficients that is the minimal polynomial over the field of the rational numbers of any primitive nth-root of unity (/ is an example of such a root). An important relation linking cyclotomic polynomials and primitive roots of unity is

  5. Cyclotomic field - Wikipedia

    en.wikipedia.org/wiki/Cyclotomic_field

    In number theory, a cyclotomic field is a number field obtained by adjoining a complex root of unity to , the field of rational numbers. [1]Cyclotomic fields played a crucial role in the development of modern algebra and number theory because of their relation with Fermat's Last Theorem.

  6. Modular arithmetic - Wikipedia

    en.wikipedia.org/wiki/Modular_arithmetic

    Primitive root modulo m: A number g is a primitive root modulo m if, for every integer a coprime to m, there is an integer k such that g k ≡ a (mod m). A primitive root modulo m exists if and only if m is equal to 2, 4, p k or 2p k, where p is an odd prime number and k is a positive integer.

  7. Artin's conjecture on primitive roots - Wikipedia

    en.wikipedia.org/wiki/Artin's_conjecture_on...

    In number theory, Artin's conjecture on primitive roots states that a given integer a that is neither a square number nor −1 is a primitive root modulo infinitely many primes p. The conjecture also ascribes an asymptotic density to these primes. This conjectural density equals Artin's constant or a rational multiple thereof.

  8. Cyclic group - Wikipedia

    en.wikipedia.org/wiki/Cyclic_group

    An nth root of unity is a complex number whose nth power is 1, a root of the polynomial x n − 1. The set of all nth roots of unity forms a cyclic group of order n under multiplication. [1] The generators of this cyclic group are the nth primitive roots of unity; they are the roots of the nth cyclotomic polynomial.

  9. Dirichlet character - Wikipedia

    en.wikipedia.org/wiki/Dirichlet_character

    In analytic number theory and related branches of mathematics, a complex-valued arithmetic function: is a Dirichlet character of modulus (where is a positive integer) if for all integers and : [1] χ ( a b ) = χ ( a ) χ ( b ) ; {\displaystyle \chi (ab)=\chi (a)\chi (b);} that is, χ {\displaystyle \chi } is completely multiplicative .