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