(hint use the
Division Algorithm and Binomial Theorem)
be relatively prime. Prove that if a is primitive root modulo mn, then
a is primitive root modulo both m and n
is not congruent to
(p-1), then m is a primitive root modulo p
Mathematics Homework Solutions
#43351
Group theory proofs
a. Let =2 +1 (2 (Power 2(power n))) Plus 1. Prove that P is a prime Dividing , then the smallest m such that P (2 -1) is m = 2 (hint use the
Division Algorithm and Binomial Theorem)
Please see attached.
There are a variety of proofs in this solution regarding modular arithmetic.
What is this?
By OTA - Overall OTA Rating
Yupei Xiong, PhD - 4.8/5
Purchase Cost Now
$2.19 CAD (was ~$31.92)
Included in Download
- Plain text response
- Attached file(s):
- 43351.doc
Why you can trust BrainMass.com
- Your Information is Secure
- Best Online Academic Help Service
- Students find real academic Success
- When is Z/nZ a field? - Show that Z/nZ is a field if and only if n is a prime.
- Congruences : Primes, Inverse Modulo, GCD and Wilson's theorem - Please assist me with the attached congruence problems (hint: use Wilson's Theorem) a)Prove if a,b,c Z, N and gcd (c, ) = , then ac bc(mod ) if and only if a b (mod ). b) Let a Z, N, ...
- Complete Residue System : Suppose that p is a prime number. Show that 0, (p-1)!/2, (p-1)!/3, ..., (p-1)!/(p-1) is a complete residue system modulo p. - Suppose that p is a prime number. Show that 0, (p-1)!/2, (p-1)!/3, ..., (p-1)!/(p-1) is a complete residue system modulo p.
- Quadratic Congruences - (See attached file for full problem description) Suppose that is a prime. Prove that if a is a quadratic nonresidue modulo p, then a is a primitive root modulo p.
- Discrete Logarithm Problem via Shank's Algorithm - Please see the attached file. 1. Solve the following Discrete Logarithm Problem via Shank's Algorithm: 12295 modulo 79839983 2. Solve the following Discrete Logarithm Problem via Pollard R ...
