4023s04exs1-3

4023s04exs1-3 - t 8633. (c) Find the least common multiple...

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

View Full Document Right Arrow Icon
Math 4023 Section 1 Section 1.3 Exercises From the Text: Page 27, # 1, 3, 4, 5, 7, 8 1. (a) Find the greatest common divisor d = (792 , 882) of 792 and 882, using the Euclidean Algorithm. (b) Write d = (792 , 882) in the form d = s · 792 + t · 882. (c) Find the least common multiple [792 , 882]. ( Hint: The formula [ a,b ]( a,b ) = ab proved in Exercise 8, Page 27, may be useful.) 2. (a) Find the greatest common divisor d = (8051 , 8633) of 8051 and 8633, using the Euclidean Algorithm. (b) Write d = (8051 , 8633) in the form d = s · 8051 +
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: t 8633. (c) Find the least common multiple [8051 , 8633]. 3. (a) Find the greatest common divisor d = (7605 , 5733) of 7605 and 5733, using the Euclidean Algorithm. (b) Write d = (7605 , 5733) in the form d = s 7605 + t 5733. (c) Find the least common multiple [7605 , 5733]. 4. Suppose that a = 2 10 3 7 13 6 29 8 and b = 2 9 5 3 11 4 13 8 . Find the prime factorizations of ( a,b ), [ a,b ], and ab . February 2, 2004 1...
View Full Document

This document was uploaded on 12/28/2011.

Ask a homework question - tutors are online