This preview shows page 1. Sign up to view the full content.
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.
 Fall '09
 Math

Click to edit the document details