Unformatted text preview: n below. (a) n = 5 182 , m = 77. (b) n = 3 1000000 , m = 14. 4. Use Euler’s theorem to ﬁnd all incongruent solutions of each congruence below: (a) 3 x ≡ 1 (mod 5). (b) 10 x ≡ 15 (mod 55). 5. Let p and q be distinct prime numbers. Prove that p q1 + q p1 ≡ 1 (mod pq ). 1...
View
Full Document
 Spring '08
 YEE
 Number Theory, Congruence, Prime number, mod m1, nonnegative residue modulo

Click to edit the document details