Let p≥ 5 be a prime. Let g be a primitive root of p. (i). If g-¹ mod p is the modular inverse of g, prove that g-¹ is also a primitiv root of p. (ii). Prove that g‡ g-¹ (mod p). (Hint: Prove first that g = g-¹ (mod p) implies that g² = 1 (mod p).) iii). Recall that there are ((p)) (p-1) primitive roots of p among {1,2,...,p}. We denote them by 9₁, 92, ..., 96(p-1). Prove that =

Q: 1. If p>9 2 5 and p and q are both primes, prove that 24 p - q.

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: Show that if p is an odd prime and n is a positive integer then there is a primitive root of p".…

A: given :- p is an odd prime number and n is positive integer(i.e. n≥1) To prove:- there exist 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: Let n ≠ 0 and assume nZ is prime. Prove that n is prime.

A: Given n not equal to 0 and nZ is prime. We prove that n is prime. Let n be a composite number. Then…

Q: Let p be a prime larger than 3. 1. Show that the remainder, when p is divided by 6, is 1 or 5. Note:…

A:

Q: If p > 2 is a prime of the form 2m +1, prove that m is a power of 2.

A: Let p be a prime and p > 2. And, p = 2m +1 Suppose 't' is an odd prime factor of m. That is, m =…

Q: Given n > 1, let p be a prime number such that n < p < 2n (by the way, 2n there is always a prime…

A: here we need to expand  by using  nr=n!r!×n-r! and then show that expression obtained have a factor…

Q: > 2 is a prime, then (12) Prove that if p and (1 2... p-1 p) generate Sp.

A: Solution:                  Let H=1,2,  1,2,3.....n  and H be the smallest subgroupcontaing them.Then…

Q: Let p E Z Z be a prime number such that p > 2. Let n = 2p. Find all positive %3D divisors of n. NO…

A:

Q: Let n be a positive integer and p a prime that divides n. Prove that pis prime in Zn.

A: It is given that, n be a positive integer and p be a prime that divides n.  We have to prove that, p…

Q: We'll now try to prove the following result in 2 steps: Theorem: Suppose that p is an odd prime. Let…

A:

Q: Let n be an integer with n ≥ 2. Suppose that for every prime               p ≤√n, p does not divide…

A: given,                                                  p≤n p doesn't divide n. let n is not a prime…

Q: Prove that if a > 1, then there is a prime p so that a < p< a! + 1.

A:

Q: If k is a positive integer, prove the k root of 6 is irrational

A: Given:Given that k is apositive integer.To find:The kth root of 6 is Irrational.

Q: Show that if p > 1 and p divides (p − 1)! + 1, then p is prime.

A: Proof by contradiction: Assume p is not prime ⇒p is composite

Q: ) Show that if p is a prime such that m +1< p < 2m + 1, then p divides (2m+1).

A:

Q: Suppose |G| = p2q2 , where p < q are primes. Prove that if |G| ̸= 36, then nq = 1.

A:

Q: Suppose p and q are odd primes such that p = q + 8a for some positive integer a. () = () = ( ) .…

A: Legendre symbol:  For any prime number p and any integer a that is not divisible by p, the Legendre…

Q: Prove that for all primes p2 5, p + 1 cannot be a perfect square. Recall that is a perfect square if…

A:

Q: Find all the primes less than 50 with primitive root 3.

A: A primitive root modulo a prime number is an integer such that every non-zero integer less than…

Q: Let p be a prime number with p>=5. Prove that p must either be one more or one less than a multiple…

A: We use a fact that any number greater that 5 must be written as one of the form…

Q: Find the canonical prime factorization of this using Fermat’s Method and solve for the Number of…

A:

Q: Find the cananical prime factorization dnd solve no.of poritive divisor and anyisad to wns

A: We have to find canonical prime factorization, number of positive divisors and sum  of positive…

Q: (b) Find a prime p> 5 such that 2 and 3 are both primitive roots modulo P.

A: We test all the primes p&gt;5 and see which prime works.

Q: , Let p be an odd prime. Prove or disprove the following statements. (a) If p = 2 + 1, then every…

A:

Q: Sketch the graph of f by hand and use your sketch to find the absolute and local maximum and minimum…

A:

Q: Let n be a real number. Prove that if n is irrational, then 5n - 1 is also irrational.

A: Given that n is real number. If n is irrational number then we need to prove that 5n-1 is also a…

Q: Prove that Let p be a prime. Then (p−1)! ≡ −1 (p)

A:

Q: Use Fermat's theorem to show that for any two distinct odd primes P.9, and any integer C: CM-c-c +c…

A:

Q: If possible, let berational. v2 a Then, there exist positive co -primes a andb such that - -

A:

Q: Exercise 1. A student is asked to prove If m is even and n is odd, then m² + n² is odd. 2 The…

A: Let us answer above questions

Q: Let n = pq be the product of two odd primes. Recall that there are no primitive roots modulo n. Show…

A: We use the idea that if primitive root exists then x^2 = 1 mod (m) has only 2 solutions. The…