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