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