Quadratic Congruence and Primitive Roots

Related BrainMass Solutions

• Euclidean algorithm, primes and unique factorization, congruences, Chinese Remainder Theorem, Hensel's Lemma, Diophantine equations, arithmetic in polynomial rings, primitive roots, quadratic reciprocity and quadratic fields.

  primitive roots, quadratic reciprocity and quadratic fields.

• Congruences, Primitive Roots, Indices and Table of Indices

  Congruences, Primitive Roots, Indices and Table of Indices are investigated. The solution is detailed and well presented.

• Euclidean algorithm, primes and unique factorization, congruences, Chinese Remainder Theorem, Hensel's Lemma, Diophantine equations, arithmetic in polynomial rings, primitive roots, quadratic reciprocity and quadratic fields.

  Topics usually include the Euclidean algorithm, primes and unique factorization, congruences, Chinese Remainder Theorem, Hensel's Lemma, Diophantine equations, arithmetic in polynomial rings, primitive roots, quadratic reciprocity and quadratic fields

• the Euclidean algorithm, primes and unique factorization, congruences, Chinese Remainder Theorem, Hensel's Lemma, Diophantine equations, arithmetic in polynomial rings, primitive roots, quadratic reciprocity and quadratic fields.

  Topics usually include the Euclidean algorithm, primes and unique factorization, congruences, Chinese Remainder Theorem, Hensel's Lemma, Diophantine equations, arithmetic in polynomial rings, primitive roots, quadratic reciprocity and quadratic fields

• Finding a Primitive Element of GF(49)

  This is true since the roots of f are (-a +/- sqrt(D)) / 2, which lie in Z_7 (and hence f is reducible over Z_7) if and only if D is a quadratic residue (QR) modulo 7. Next we try monic quadratic irreducible polynomials with a = 0.

• Euclidean algorithm, primes and unique factorization, congruences, Chinese Remainder Theorem, Hensel's Lemma, Diophantine equations, arithmetic in polynomial rings, primitive roots, quadratic reciprocity and quadratic fields.

  polynomial rings, primitive roots, quadratic reciprocity and quadratic fields.

• Primitive roots

  Thus all the primitive roots in Z_7 are 3 and 5. This solution is comprised of a detailed explanation to determine which elements of Z_7 (Z sub 7) are primitive roots.

• Quadratic congruences

  By inspection, there is no integer k and x which can satisfy the above relation. There is no solution for this quadratic congruence.

• The Mobius Inversion Formula

  roots modulo p 2) Find all primitive roots modulo 5, modulo 9, modulo 11, modulo 13 and modulo 15.