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

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

  4. Artin conjecture - Wikipedia

    en.wikipedia.org/wiki/Artin_conjecture

    Artin's conjecture on primitive roots The (now proved) conjecture that finite fields are quasi-algebraically closed; see Chevalley–Warning theorem The (now disproved) conjecture that any algebraic form over the p-adics of degree d in more than d 2 variables represents zero: that is, that all p -adic fields are C 2 ; see Ax–Kochen theorem or ...

  5. Primitive element theorem - Wikipedia

    en.wikipedia.org/wiki/Primitive_element_theorem

    The primitive element theorem was proved in its modern form by Ernst Steinitz, in an influential article on field theory in 1910, which also contains Steinitz's theorem; [6] Steinitz called the "classical" result Theorem of the primitive elements and his modern version Theorem of the intermediate fields.

  6. Primitive root - Wikipedia

    en.wikipedia.org/wiki/Primitive_root

    Download as PDF; Printable version; In other projects Wikidata item; Appearance. ... In mathematics, a primitive root may mean: Primitive root modulo n in ...

  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. Primitive element (finite field) - Wikipedia

    en.wikipedia.org/wiki/Primitive_element_(finite...

    In field theory, a primitive element of a finite field GF(q) is a generator of the multiplicative group of the field. In other words, α ∈ GF( q ) is called a primitive element if it is a primitive ( q − 1) th root of unity in GF( q ) ; this means that each non-zero element of GF( q ) can be written as α i for some natural number i .

  9. Rational root theorem - Wikipedia

    en.wikipedia.org/wiki/Rational_root_theorem

    Download as PDF; Printable version; ... The integral root theorem is the special case of ... as a product of primitive polynomials. Now any rational root p/q ...