This preview shows page 1. Sign up to view the full content.
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
This note was uploaded on 07/23/2008 for the course MATH 465 taught by Professor Yee during the Spring '08 term at Pennsylvania State University, University Park.
 Spring '08
 YEE
 Number Theory, Congruence

Click to edit the document details