hmwk_4 - (a) a + c b + d (mod m ) (b) ac bd (mod m ) Note:...

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

View Full Document Right Arrow Icon
Discrete Structures Sept 12 2011 Assignment 4: 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. (b) What is the prime factorization of 495 and of 210? (c) Is your answer to part (a) correct? 2. Prove the following theorem Theorem: If a b (mod m ) amd c d (mod m ) then
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: (a) a + c b + d (mod m ) (b) ac bd (mod m ) Note: If a = q a m + r a and b = q b m + r b where r a < m and r b < m it is possible that r a + r b m . 3. Construct the multiplication table for arithmetic mod 7. 4. (Extended Euclidean Algorithm) What is multiplicative inverse of 400 mod 997? 5. (a) Prove for relatively prime a and b that if a divides bc , then a divides c . Hint : First show that there exist s and t such that sac + tbc = c and then argue that a divides c . (b) Give counter example when a and b are not relatively prime. 1...
View Full Document

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

Ask a homework question - tutors are online