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