How to Find GCF using Successive Division Method?

TopIn mathematics GCF is also called as greatest common factor. We also call it greatest common divisor or highest common factor. Gcf is an Integer value. This gcf is greatest common integer number which divides two integer Numbers but that number can be a non zero number. For Example: Gcf of 8 and 12 is 4. Let us see how to find gcf using successive division method.

We can get gcf of two numbers using Factorization, using prime factorization and using Euclid’s algorithm.
Let us see how this method successive division works:
When we want to get gcf using successive division method then we have to follow some steps shown below:

Step 1: First we need two integer values. These numbers should not be zero.

Step 2: We have two numbers. Now we will divide larger number of two by smaller number.

Step 3: When we divide larger number by smaller number then we will get remainder value. This remainder is a smaller number than dividend. We will divide the dividend by the remainder.

Step 4: We will follow this process until we get remainder as zero.

Step 5: Very last divisor is the greatest common factor of two numbers.

Let us have an example to understand the working of the successive division method:Step 1: We have two numbers 24 and 36. We want to find the gcf of these numbers.

Step 2: Here we will divide 36 by 24.

Step 3: When we divide 36 by 24 we get 12 as remainder number.

Step 4: 12 is smaller than 24 so we will divide 24 by 12.

Step 5: When we divide number 24 by 12 we get zero as remainder. So here 12 is the last divisor and gcf of numbers 24 and 36.