Let n = pq be the product of two odd primes. Recall that there are no primitive roots modulo n. Show that there are in fact 3 incongruent values of a such that ordn(a) = 2. Using this in combination with part (a), present an alternate proof that there are no primitive roots modulo pq. Where does this proof break down if p = 2? (Hint: Chinese Remainder Theorem.)

Q: Exercise 7.2.10. Let G be a group of order pq for primes p and q. Prove all proper subgroups of G…

A:

Q: Show that log, q is irrational for any distinct prime numbers p and q. (Distinct here p# q.) means

A: To Determine :-  logp q is irrational for any distinct prime numbers p and q.

Q: Let p + 7 be an odd prime. Determine the value of the Legendre symbol (7/p).

A: Let p be an odd prime number. An integer a is a quadratic residue modulo p if it is congruent to a…

Q: Work the modular arithmetic problem. (9.7)(mod 5). (9.7)(mod 5) = (mod 5)

A:

Q: Prove that for all positive integers n, 1 3 2n – 1 1 X...X 4 V3n 2n HINT: You will find it difficult…

A:

Q: Prove that if p and q are distinct primes, then pq | (p9-1+qp-1-1).

A: p and q are distinct prime. We have to show that pq|pq-1+qp-1-1

Q: 3. Define primitive root and find all primitive root of following. (b) 19 (c) 15 25

A:

Q: There exists an integer m > 3 such that m2 – 1 is prime. The above statement is due to proof by…

A: We have to complete the given sentence.

Q: Find a positive integer less than 6 for x that sat 2x + 340 = 1703 (mod 5).

A:

Q: Work the modular arithmetic problem. (11.10)(mod 7). (11 10) (mod 7) = (mod 7)

A: (a)   (11.10)mod 7  =  110 mod 7                            The remainder when 110 is…

Q: Show that n := e2™i/n is a primitive nth root of unity in C. Verify that (S3 - )? = -3 in C. Verify…

A:

Q: Suppose that m, n are two integers such that m 2n2 = 1. Does it follow that m and n are relatively…

A: Given that m, n are two integers such that m3-2n2=1. To show m, n are relatively primes we have to…