Purchase Solution

primitive root and its residue set

Not what you're looking for?

Ask Custom Question

I need help with this problem. It has two parts a) and b).

(a) Show that if m is a number having primitive roots, then the product of the positive integers less than or equal to m and relatively prime to is congruent to -1(mod m).

(b) Show that the result in (a) is not always true if m does not have primitive roots.

Purchase this Solution
Solution Summary

This solution helps go through problems with regards to primitive roots and its residue set.

Purchase this Solution
Free BrainMass Quizzes
Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

Probability Quiz

Some questions on probability

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

View More Free Quizzes
Related BrainMass Solutions

  • Quadratic Congruence and Primitive Roots

    Proof: Note that the property does not hold for (please see the attached file) since the only primitive root of 2 is 1 and (please see the attached file). Now suppose p is an odd prime and g is a primitive root of p.

  • Finding a Primitive Element of GF(49)

    Let r be a root of f.

  • Theory of Numbers - Primitive Root

    87354 Theory of Numbers - Primitive Root Assume that n is odd and a is a primitive root mod n. Let b be an integer with b ≡ a(mod n) and gcd (b, 2n) =1. Show that b is a primitive root mod 2n. Please see the attached file.

  • Pythagorean Triangles

    By Theorem 3, p has a primitive root. Let g be a primitive of p. Then g is a least residue modulo p and the order of g modulo p is p-1; that is, g^(p-1)≡1 "(mod " p), and the powers of g, g,g^2,...

  • Maximal Ideals of Prime and Primitive Polynomials

    459465 Maximal Ideals of Prime and Primitive Polynomials Please help with the following problem. Suppose that p is a prime and f is a primitive polynomial in Z[x] which is irreducible modulo p.

  • Primitive root

    87355 Primitive Root Modulo Find a primitive root modulo 17 if it exists.

  • Modular proofs

    Proof: is a primitive root module , then (mod ) and (mod ) for any . and are relative to each other, then . Now I claim that is a primitive root module . If not, we can find some , such that (mod ).

  • Palindromic and Reciprocal Polynomials

    Also f(x) is irreducible if its reciprocal polynomial is irreducible, and f(x) is primitive iff its reciprocal polynomial is primitive. Please see the attached file for the complete solution. Palindromic and reciprocal polynomials are investigated.

  • Residue calculus

    Let and we consider the following figure We make the integral of along . So we need to find poles of in the region . So we set , then we get two poles in . They are and .

View More Related Solutions