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