Hw4 - 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

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
University of California, Santa Barbara CMPSC 40 FALL 2009 HOMEWORK ASSIGNMENT IV Due 4:00 pm, Friday October 30 in CS 40 HW box in 2108 HFH. Please note that no late homeworks are allowed. Solve the following problems. The sections refer to “Discrete Mathematics and Its Ap- plications”, Kenneth H. Rosen, McGraw-Hill, 2007 (Sixth Edition). 1. Section 3.4, Problem 24. 2. Section 3.5, Problem 26. 3. Section 3.7, Problem 18. 4. Section 3.7, Problem 36. 5. Chapter 3, Supplementary Exercises, Problem 40.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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.

Ask a homework question - tutors are online