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

    If g is a primitive root modulo p, then g is also a primitive root modulo all powers p k unless g p −1 ≡ 1 (mod p 2); in that case, g + p is. [14] If g is a primitive root modulo p k, then g is also a primitive root modulo all smaller powers of p. If g is a primitive root modulo p k, then either g or g + p k (whichever one is odd) is a ...

  3. Multiplicative group of integers modulo n - Wikipedia

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

    The generating set is also chosen to be as short as possible, and for n with primitive root, ... 25 C 20: 20: 20: 2 57 C 2 ×C 18: 36: 18: 2, 20 89 C 88: 88: 88: 3 121

  4. Canon arithmeticus - Wikipedia

    en.wikipedia.org/wiki/Canon_arithmeticus

    Jacobi's original tables use 10 or –10 or a number with a small power of this form as the primitive root whenever possible, while the second edition uses the smallest possible positive primitive root (Fletcher 1958). The term "canon arithmeticus" is occasionally used to mean any table of indices and powers of primitive roots.

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

  6. Primitive root - Wikipedia

    en.wikipedia.org/wiki/Primitive_root

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

  7. Root of unity modulo n - Wikipedia

    en.wikipedia.org/wiki/Root_of_unity_modulo_n

    For a primitive () th root x, the number () / is a primitive th root of unity. If k does not divide λ ( n ) {\displaystyle \lambda (n)} , then there will be no k th roots of unity, at all. Finding multiple primitive k th roots modulo n

  8. 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]

  9. Carmichael function - Wikipedia

    en.wikipedia.org/wiki/Carmichael_function

    There are four primitive λ-roots modulo 15, namely 2, 7, 8, and 13 as . The roots 2 and 8 are congruent to powers of each other and the roots 7 and 13 are congruent to powers of each other, but neither 7 nor 13 is congruent to a power of 2 or 8 and vice versa.