This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 6. (a) Find d = GCD (36 , 55) by the Euclidean algorithm. (b) Use your work in part (a) to nd r,s ZZ such that d = 36 r + 55 s . (c) Use your work in part (b) to nd all solutions to the equation 36 x 9 mod 55. 7. The ISBN of a certain book is 0-7167-10 Q 5-4 where Q is a decimal digit. Find the value of Q . (See remarks preceding Section 3.4, Problem 33. ) 8. Find the remainder when 9 5000892 is divided by 11. (See Fermats Little Theorem, p. 239.)...
View Full Document
This note was uploaded on 03/21/2011 for the course CMPSC 40 taught by Professor Egiceoclu during the Fall '09 term at UCSB.
- Fall '09