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