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