hw4 - are co-prime ). (b) Let a, b, d be integers such that...

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

View Full Document Right Arrow Icon
ECE 103 Discrete Math for Engineers University of Waterloo Spring 2010 Instructors: Koray Karabina, Ashwin Nayak Homework 4, due June 7, 2010 Note: All questions carry 5 marks. Question 1. Calculate gcd( - 1137 , - 419) using the Euclidean algorithm. Show all your calculations. Question 2. Find gcd(19201 , 3587) and integers x, y such that 19201 x + 3587 y = gcd(19201 , 3587). Show all your calculations. Question 3. (a) Prove that for any integer n , we have gcd( n, n +1) = 1 (i.e., any two consecutive integers
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: are co-prime ). (b) Let a, b, d be integers such that 0 6 = d = gcd( a, b ). Show that gcd( a/d, b/d ) = 1. Question 4. Let a, b, c be integers. Are the following statements true or false? Explain. (a) gcd( ab, c ) = gcd( a, c ) gcd( b, c ). (b) If c is prime, and c | ( ab ), then c | a or c | b . Question 5. Find all the prime numbers between 160 and 170, prove that these are prime. 1...
View Full Document

This note was uploaded on 09/28/2011 for the course ECE 103 taught by Professor Nayak during the Spring '11 term at Waterloo.

Ask a homework question - tutors are online