Compute an integer modulo


Question:

The idea of this problem is to investigate solutions to x2≡1(mod pq) where p and q are distinct odd primes.

(a) Show that if p is an odd prime, then there are exactly two solutions modulo p to x2≡1(mod p).

(b) Find all pairs (a,b) ? Zp x Zq such that a2≡1(mod p) and b2≡1(mod q).

(c) Let p=17 and q=23. For each pair (a,b) from part (b), compute an integer modulo such that and .

(d) Verify that each integer found in part (c) is a solution to .

Solution Preview :

Prepared by a verified Expert
Algebra: Compute an integer modulo
Reference No:- TGS01932293

Now Priced at $20 (50% Discount)

Recommended (91%)

Rated (4.3/5)