The GCD of given numbers is 18.
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 zero => GCD is the last divisor .
We can summarize an algorithm into a following table.
234 | : | 216 | = | 1 | remainder ( 18 ) | ||
216 | : | 18 | = | 12 | remainder ( 0 ) | ||
GCD = 18 |
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.