hmwk_4_sol - Discrete Structures Sept 12 2011 Assignment 4...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Discrete Structures Sept 12 2011 Assignment 4 Solutions: Due at beginning of class Mon, Sept 26 Prof. Hopcroft *******Note: this homework is subject to the style guide on the website. Points will be deducted for homeworks not following the guidelines.******** *******Please print out and staple the grade sheet to the back of your homework!****** 1. (a) Use Euclid’s algorithm to compute the gcd of 495 and 210. Write out the steps. gcd (495 , 210) = gcd (495 - 210 , 210) = gcd (285 , 210) = gcd (285 - 210 , 210) = gcd (75 , 210) = gcd (75 , 210 - 75) = gcd (75 , 135) = gcd (75 , 135 - 75) = gcd (75 , 60) = gcd (75 - 60 , 60) = gcd (15 , 60) = 15 (b) What is the prime factorization of 495 and of 210? 495 = 3 * 3 * 5 * 11 210 = 2 * 3 * 5 * 7 (c) Is your answer to part (a) correct? Yes. 2. Prove the following theorem Theorem: If a b (mod m ) amd c d (mod m ) then (a) a + c b + d (mod m ) Proof. If a b (mod m ), then a = b + im , for some integer i . Similarly, c = d + jm . Now: a
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/11/2011 for the course CS 2800 at Cornell University (Engineering School).

Page1 / 2

hmwk_4_sol - Discrete Structures Sept 12 2011 Assignment 4...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online