This preview shows pages 1–5. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 6) Yes or No: Is 3709 ≡ 37 (mod 51) ? Justify your answer. (5 points) 7) Prove: If a ≡ b (mod m ) and c ≡ d (mod m ), then a + c ≡ b + d (mod m ). Assume that a , b , c , d , and m are integers, with m > 2. (10 points) 8) The binary representation of a positive integer is 1001001. What is the decimal representation of this integer? (5 points) 9) The decimal representation of a positive integer is 182. What is the binary representation of this integer? (5 points) 10) Use the method shown in class to find two integers s and t such that 1 = 59 s + 56 t . (10 points) 11) Use the method shown in class to find three positive integer solutions to the linear congruence 11 x + 4 ≡ 13 (mod 15). • Hint: 1 = (15)(3)  (11)(4). • A "bruteforce" approach will not receive full credit! (10 points)...
View
Full
Document
This note was uploaded on 09/08/2011 for the course MATH 245 taught by Professor Staff during the Spring '11 term at Mesa CC.
 Spring '11
 staff
 Math, Number Theory

Click to edit the document details