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