Question 5: 1. Let p and q be two different primes, and n = p.q. Say that y is not a square root mod n. Show that this i
Posted: Thu May 05, 2022 1:34 pm
No code, please explain.
Question 5: 1. Let p and q be two different primes, and n = p.q. Say that y is not a square root mod n. Show that this implies that y can not be both a square mod p and mod q. Prove the same for -y. 2. Again say that q is prime. Also say that (q − 1)/2 is odd, and y is not a square root mod q. Show that -y is a square root modulo q.
Question 5: 1. Let p and q be two different primes, and n = p.q. Say that y is not a square root mod n. Show that this implies that y can not be both a square mod p and mod q. Prove the same for -y. 2. Again say that q is prime. Also say that (q − 1)/2 is odd, and y is not a square root mod q. Show that -y is a square root modulo q.