Grade 6 - Mathematics1.37 GCD - Division Method (Euclid Algorithm)

G.C.D. by Division Method

Euclid's Algorithm:
Divide the bigger number by the smaller number. Then the divisors are divided in succession by the remainders obtained. This division should be carried on till we get the remainder zero. The last divisor is the G.C.D. of the given numbers.

The division method is useful for finding the G.C.D. of large numbers. In order to find the G.C.D. of more than two numbers, first find the G.C.D. of any two of them. Then find the G.C.D. of the third number and the G.C.D. so obtained of the first two numbers. Continue this method in order till all the numbers are over.

Example: Find the G.C.D. of 48, 60 by using the Division Method.

Directions: Find the G.C.D. of the given numbers using the Division Method. Also write at least 10 examples of your own.