ly(mod n). 2. Let n > 1 be an odd integer and suppose ? = y2...

Question

Question

ly(mod n). 2. Let n > 1 be an odd integer and suppose ? = y2 (mod n) for some x Prove that ged(x - yn) and ged(x + y, n) are

math Advanced-Math

Add a comment Improve this question Transcribed image text

Answer 1

Answer #1

Ans. - By decination af god., gedeuty,n) /n, ged (u-y, n)/n so we need to prouve ged (hay, n) & 1 , &n criven in /uz-ya nanay so god (nty, n) &n. Similarly gcd (n-9, n) n. And in scd (nry, n) = 1 then winca n uity) (ny), ged Cuty, m) = 1 contradition)

Add a comment

Answer 2

Similar Homework Help Questions

Question 1 2(a) Let m>1 be an odd natural number. Prove that 13-5.-(m-2) (- 2-4-6. (-1)...

Question 1 2(a) Let m>1 be an odd natural number. Prove that 13-5.-(m-2) (- 2-4-6. (-1) (mod m) (m-1) (mod m [Hint : 1 i-(m-1 ) (mod m), 3 Ξ-(m-3) (mod ") , . .. , m-2 1-2 (mod m)] 14 (b) If p is an odd prime, prove that Hint: Use Part (a), and rearrange the Wilson's Theorem formula in two different ways
1. Let m be a nonnegative integer, and n a positive integer. Using the division algorithm...

1. Let m be a nonnegative integer, and n a positive integer. Using the division algorithm we can write m=qn+r, with 0 <r<n-1. As in class define (m,n) = {mc+ny: I,Y E Z} and S(..r) = {nu+ru: UV E Z}. Prove that (m,n) = S(n,r). (Remark: If we add to the definition of ged that gedan, 0) = god(0, n) = n, then this proves that ged(m, n) = ged(n,r). This result leads to a fast algorithm for computing ged(m,...
6. Let n be any positive integer which n = pq for distinct odd primes p....

6. Let n be any positive integer which n = pq for distinct odd primes p. q for each i, jE{p, q} Let a be an integer with gcd(n, a) 1 which a 1 (modj) Determine r such that a(n) (mod n) and prove your answer.

P-1 mod 4, prove that Σ k ( )-0. Let p be an odd prıme. Suppose that p k=1

p-1 mod 4, prove that Σ k ( )-0. Let p be an odd prıme. Suppose that p k=1 p-1 mod 4, prove that Σ k ( )-0. Let p be an odd prıme. Suppose that p k=1
(b) Prove that n is an odd pseudoprime number if and only if 2"-1-1 mod n.

(b) Prove that n is an odd pseudoprime number if and only if 2"-1-1 mod n. (b) Prove that n is an odd pseudoprime number if and only if 2"-1-1 mod n.
5. (a) Show that 26 = 1 mod 9. (b) Let m be a positive integer,...

5. (a) Show that 26 = 1 mod 9. (b) Let m be a positive integer, and let m = 6q+r where q and r are integers with 0 <r < 6. Use (a) and rules of exponents to show that 2" = 2 mod 9 (c) Use (b) to find an s in {0,1,...,8} with 21024 = s mod 9.

Q 3 a) Let n > 2 be an integer. Prove that the set {z ET:z”...

Q 3 a) Let n > 2 be an integer. Prove that the set {z ET:z” = 1} is a subgroup of (T, *). Show that it is isomorphic to (Zn, + mod n). b) Show that Z2 x Z2 is not isomorphic to Z4. c) Show that Z2 x Z3 is isomorphic to 26.
Question 2. Let a, b, c be natural numbers. (a) Suppose that g specific a, b,...

Question 2. Let a, b, c be natural numbers. (a) Suppose that g specific a, b, c eN where d > g. ged(a, b) ged(b, c). Let d ged(a, c); prove that d > g. Provide an example of (b) Let d gcd(a, b). By definition of the ged being a divisor of a, b, this implies that we may write a and b jd for some j,k E N. Prove that ged(j, k) = 1. kd -
Problem 7. Let M = 2" – 1, where n is an odd prime. Let p...

Problem 7. Let M = 2" – 1, where n is an odd prime. Let p be any prime factor of M. Prove that p=n·2j + 1 for some positive integer j.

g(p+1)/2 (a) Suppose 9 is a p rimitive root of an odd prime p. Prove that- (mod p) g(p+1)/2 (a) Suppose 9 is a p rimitive root of an odd prime p. Prove that- (mod p)

g(p+1)/2 (a) Suppose 9 is a p rimitive root of an odd prime p. Prove that- (mod p) g(p+1)/2 (a) Suppose 9 is a p rimitive root of an odd prime p. Prove that- (mod p)

ly(mod n). 2. Let n > 1 be an odd integer and suppose ? = y2...

Homework Answers

Add Answer to:
ly(mod n). 2. Let n > 1 be an odd integer and suppose ? = y2...

Post as a guest

Earn Coins

Question 1 2(a) Let m>1 be an odd natural number. Prove that 13-5.-(m-2) (- 2-4-6. (-1)...

1. Let m be a nonnegative integer, and n a positive integer. Using the division algorithm...

6. Let n be any positive integer which n = pq for distinct odd primes p....

P-1 mod 4, prove that Σ k ( )-0. Let p be an odd prıme. Suppose that p k=1

(b) Prove that n is an odd pseudoprime number if and only if 2"-1-1 mod n.

5. (a) Show that 26 = 1 mod 9. (b) Let m be a positive integer,...

Q 3 a) Let n > 2 be an integer. Prove that the set {z ET:z”...

Question 2. Let a, b, c be natural numbers. (a) Suppose that g specific a, b,...

Problem 7. Let M = 2" – 1, where n is an odd prime. Let p...

g(p+1)/2 (a) Suppose 9 is a p rimitive root of an odd prime p. Prove that- (mod p) g(p+1)/2 (a) Suppose 9 is a p rimitive root of an odd prime p. Prove that- (mod p)

ly(mod n). 2. Let n > 1 be an odd integer and suppose ? = y2...

Homework Answers

Add Answer to: ly(mod n). 2. Let n > 1 be an odd integer and suppose ? = y2...

Post as a guest

Earn Coins

Add Answer to:
ly(mod n). 2. Let n > 1 be an odd integer and suppose ? = y2...