enow.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

    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. So g is a primitive root modulo n if and only if g is a generator of the multiplicative group of integers modulo n.

  3. Multiplicative group of integers modulo n - Wikipedia

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

    Weisstein, Eric W. "Primitive Root". MathWorld. Web-based tool to interactively compute group tables by John Jones; OEIS sequence A033948 (Numbers that have a primitive root (the multiplicative group modulo n is cyclic)) Numbers n such that the multiplicative group modulo n is the direct product of k cyclic groups:

  4. Root of unity modulo n - Wikipedia

    en.wikipedia.org/wiki/Root_of_unity_modulo_n

    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.

  5. Wilson's theorem - Wikipedia

    en.wikipedia.org/wiki/Wilson's_theorem

    f has degree at most p − 2 (since the leading terms cancel), and modulo p also has the p − 1 roots 1, 2, ..., p − 1. But Lagrange's theorem says it cannot have more than p − 2 roots. Therefore, f must be identically zero (mod p ), so its constant term is ( p − 1)! + 1 ≡ 0 (mod p ) .

  6. Modular arithmetic - Wikipedia

    en.wikipedia.org/wiki/Modular_arithmetic

    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. If a primitive root modulo m exists, then there are exactly φ(φ(m)) such primitive roots, where φ is the Euler's totient function.

  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. Carmichael function - Wikipedia

    en.wikipedia.org/wiki/Carmichael_function

    Such an element is called a primitive λ-root modulo n. The Carmichael function is named after the American mathematician Robert Carmichael who defined it in 1910. [ 1 ] It is also known as Carmichael's λ function , the reduced totient function , and the least universal exponent function .

  9. Dirichlet character - Wikipedia

    en.wikipedia.org/wiki/Dirichlet_character

    As in the prime-power case, if the conductor equals the modulus the character is primitive, otherwise imprimitive. If imprimitive it is induced from the character with the smaller modulus. For example, χ 15 , 11 {\displaystyle \chi _{15,11}} is induced from χ 3 , 2 {\displaystyle \chi _{3,2}} and χ 15 , 13 {\displaystyle \chi _{15,13}} is ...