Purchase Solution

Theory of Numbers - Primitive Root

Not what you're looking for?

Ask Custom Question

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.

Attachments
Purchase this Solution
Solution Summary

The solution involves a result concerning primitive root.

Solution Preview

Please see the attached file.

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

Purchase this Solution
Free BrainMass Quizzes
Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

Multiplying Complex Numbers

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

Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

Graphs and Functions

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

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.

View More Free Quizzes
Related BrainMass Solutions

  • Modular proofs

    Therefore, is a primitive root module . Similarly, is also a primitive root module . c. Proof: If is not a primitive root of , then we can find some , such that (mod ). Since (mod ), then we have .

  • The Mobius Inversion Formula

    This solution is comprised of a detailed explanation of the Mobius Inversion Formula, Primitive roots modulo p and Fermat numbers.

  • Palindromic and Reciprocal Polynomials

    Theorem: If is a root of is a root of g(x), reciprocal polynomial of f(x). Also f(x) is irreducible if its reciprocal polynomial is irreducible, and f(x) is primitive iff its reciprocal polynomial is primitive.

  • Primitive root

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

  • Congruences, Primitive Roots, Indices and Table of Indices

    40182 Congruences, Primitive Roots, Indices and Table of Indices 6. Let g be a primitive root of m. An index of a number a to the base (written ing a) is a number + such that g+≡a(mod m).

  • Primitive Roots

    (b) Show that b is a primitive root modulo 2n. Please see the attachment. This solution is comprised of a detailed explanation to show that there exists and integer b such that and .

  • Solvable Roots and Solvable Group

    Consider any primitive root ζ of 1 of the degree n. Then 1=1k=(ζn)k=ζm. Since ε is a primitive root of the degree m, it follows that ζ =εl , for some l. Therefore, ζ∈K(ε). Further, n=[K(ε):F(ε)].

  • Quadratic Congruence and Primitive Roots

    387635 Quadratic Congruence and Primitive Roots 1. If g is a primitive root of p, show that two consecutive powers of g have consecutive least residues.

  • primitive root and its residue set

    259914 Primitive root and its residue set I need help with this problem. It has two parts a) and b).

View More Related Solutions