The GCD of given numbers is 6.
Step 1 :
Divide by and get the remainder
The remainder is positive (), so we will continue with division.
Step 2 :
Divide by and get the remainder
The remainder is still positive (), so we will continue with division.
Step 3 :
Divide by and get the remainder
The remainder is still positive (), so we will continue with division.
Step 4 :
Divide by and get the remainder
The remainder is still positive (), so we will continue with division.
Step 5 :
Divide by and get the remainder
The remainder is still positive (), so we will continue with division.
Step 6 :
Divide by and get the remainder
The remainder is still positive (), so we will continue with division.
Step 7 :
Divide by and get the remainder
The remainder is still positive (), so we will continue with division.
Step 8 :
Divide by and get the remainder
The remainder is still positive (), so we will continue with division.
Step 9 :
Divide by and get the remainder
The remainder is still positive (), so we will continue with division.
Step 10 :
Divide by and get the remainder
The remainder is zero => GCD is the last divisor .
We can summarize an algorithm into a following table.
93149832 | : | 73482 | = | 1267 | remainder ( 48138 ) | ||||||||||||||||||
73482 | : | 48138 | = | 1 | remainder ( 25344 ) | ||||||||||||||||||
48138 | : | 25344 | = | 1 | remainder ( 22794 ) | ||||||||||||||||||
25344 | : | 22794 | = | 1 | remainder ( 2550 ) | ||||||||||||||||||
22794 | : | 2550 | = | 8 | remainder ( 2394 ) | ||||||||||||||||||
2550 | : | 2394 | = | 1 | remainder ( 156 ) | ||||||||||||||||||
2394 | : | 156 | = | 15 | remainder ( 54 ) | ||||||||||||||||||
156 | : | 54 | = | 2 | remainder ( 48 ) | ||||||||||||||||||
54 | : | 48 | = | 1 | remainder ( 6 ) | ||||||||||||||||||
48 | : | 6 | = | 8 | remainder ( 0 ) | ||||||||||||||||||
GCD = 6 |
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.