The GCD of given numbers is 6.
Step 1 :
Divide $ 564 $ by $ 234 $ and get the remainder
The remainder is positive ($ 96 > 0 $), so we will continue with division.
Step 2 :
Divide $ 234 $ by $ \color{blue}{ 96 } $ and get the remainder
The remainder is still positive ($ 42 > 0 $), so we will continue with division.
Step 3 :
Divide $ 96 $ by $ \color{blue}{ 42 } $ and get the remainder
The remainder is still positive ($ 12 > 0 $), so we will continue with division.
Step 4 :
Divide $ 42 $ by $ \color{blue}{ 12 } $ and get the remainder
The remainder is still positive ($ 6 > 0 $), so we will continue with division.
Step 5 :
Divide $ 12 $ by $ \color{blue}{ 6 } $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 6 }} $.
We can summarize an algorithm into a following table.
| 564 | : | 234 | = | 2 | remainder ( 96 ) | ||||||||
| 234 | : | 96 | = | 2 | remainder ( 42 ) | ||||||||
| 96 | : | 42 | = | 2 | remainder ( 12 ) | ||||||||
| 42 | : | 12 | = | 3 | remainder ( 6 ) | ||||||||
| 12 | : | 6 | = | 2 | remainder ( 0 ) | ||||||||
| GCD = 6 | |||||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.