(a) Assume that a and m are odd positive integers with ged(a,m) = 1. Compute a(16m)...

 

Transcribed Image Text:

(a) Assume that a and m are odd positive integers with ged(a,m) = 1. Compute a(16m) mod 2m. (b) If ged(m, n) = gcd(a,m) = gcd(b, n) 1, show that gcd(an + bm, mn) = 1. (c) Use above fact to compute Z70 from Z your computation!] = {1, 2, 3, 4, 5, 6} and Zio = {1,3,7,9}. [Show how you use the fact for (a) Assume that a and m are odd positive integers with ged(a,m) = 1. Compute a(16m) mod 2m. (b) If ged(m, n) = gcd(a,m) = gcd(b, n) 1, show that gcd(an + bm, mn) = 1. (c) Use above fact to compute Z70 from Z your computation!] = {1, 2, 3, 4, 5, 6} and Zio = {1,3,7,9}. [Show how you use the fact for