This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: a,b ] /b is an integer. Hence a = ab [ a,b ] · [ a,b ] b = k · [ a,b ] b and so k  a . By deﬁnition of greatest common divisor, it follows that k ≤ ( a,b ), i.e., (1) ab [ a,b ] ≤ ( a,b ) . Finally, we claim that p := ab/ ( a,b ) is a common multiple of a and b , i.e., a  p and b  p . From the deﬁnition of greatest common divisor, we know that ( a,b )  b , whence b/ ( a,b ) is an integer. Then p = ab ( a,b ) = a · b ( a,b ) Date : April 10th, 2008. 1 shows that a  p . The claim that b  p is proved similarly. It follows from the deﬁnition of least common multiple that (2) ab ( a,b ) ≥ [ a,b ] Combining ( 1 ) and ( 2 ) we obtain ( a,b )[ a,b ] = ab, as desired. To compute [612 , 696], ﬁrst use the Euclidean algorithm to show that (612 , 696) = 12. Now [612 , 696] = 612 × 696 (612 , 696) = 612 × 696 12 = 51 × 696 = 35 , 496 . 2...
View
Full
Document
This note was uploaded on 06/15/2009 for the course MATH 74 taught by Professor Courtney during the Spring '07 term at Berkeley.
 Spring '07
 COURTNEY
 Division, Integers

Click to edit the document details