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