Chapter 3 Greatest Common Divisor

Euclidean Algorithm Relatively Prime Integers Least Common Multiple

Mrs. Jonelyn A. Capalad

MAT Mathematics

Reporter

Greatest Common Divisor

It involves the repeated application of the Division Algorithm

Definition:
a positive integer f is said to be a common divisor of a and b if f | a and f | b. the greatest common divisor of a and b is the positive integer d denoted by d = (a,b) satisfying
i. d | a, d | b and ii. if f | a and f | b, then f d iii. whenever f | a and f | b, then f | d

example:
d = (a,b) 4 = (12, 8)

4|12 and 4|8, and we can take f = 1 or 2

Euclidean Algorithm
The last nonzero remainder in the division process is the greatest common divisor of a and b

example:
consider a = 36 and b = 123, by performing repeated division, we get the following set of equations 123 = 36 (3) + 15 36 = 15 (2) + 6 15 = 6 (2) + 3 6 = 3 (2)

Relatively Prime Number

Prime Numbers the only positive divisors of a number are only 1 and itself 2 13 31 3 17 37 5 19 41 7 23 43 11 29 47

Relatively Prime Number

Relatively Prime if the greatest common divisor of two integers is 1  2 and 3  7 and 19  101 and 5  11 and 23

Least Common Multiple

The least common multiple of a and b is the positive integer m, denoted by m = [a, b], satisfying the following conditions: i. a | m and b | m ii. if a | n and b | n, then m n iii. if a | n and b | n, then m | n

example:
What is the LCM of 12 and 18? multiples of 12 = {12,24,36, 48, 60, 72, } multiples of 18 = {18, 36, 54, 72, 90, } The set of common multiples of 12 and 18 is {36, 72, } But the least common multiple of 12 and 18 is 36

Thank you for listening