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