The GCD of given numbers is 15.
Step 1 :
Divide $ 54585 $ by $ 4920 $ and get the remainder
The remainder is positive ($ 465 > 0 $), so we will continue with division.
Step 2 :
Divide $ 4920 $ by $ \color{blue}{ 465 } $ and get the remainder
The remainder is still positive ($ 270 > 0 $), so we will continue with division.
Step 3 :
Divide $ 465 $ by $ \color{blue}{ 270 } $ and get the remainder
The remainder is still positive ($ 195 > 0 $), so we will continue with division.
Step 4 :
Divide $ 270 $ by $ \color{blue}{ 195 } $ and get the remainder
The remainder is still positive ($ 75 > 0 $), so we will continue with division.
Step 5 :
Divide $ 195 $ by $ \color{blue}{ 75 } $ and get the remainder
The remainder is still positive ($ 45 > 0 $), so we will continue with division.
Step 6 :
Divide $ 75 $ by $ \color{blue}{ 45 } $ and get the remainder
The remainder is still positive ($ 30 > 0 $), so we will continue with division.
Step 7 :
Divide $ 45 $ by $ \color{blue}{ 30 } $ and get the remainder
The remainder is still positive ($ 15 > 0 $), so we will continue with division.
Step 8 :
Divide $ 30 $ 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.
| 54585 | : | 4920 | = | 11 | remainder ( 465 ) | ||||||||||||||
| 4920 | : | 465 | = | 10 | remainder ( 270 ) | ||||||||||||||
| 465 | : | 270 | = | 1 | remainder ( 195 ) | ||||||||||||||
| 270 | : | 195 | = | 1 | remainder ( 75 ) | ||||||||||||||
| 195 | : | 75 | = | 2 | remainder ( 45 ) | ||||||||||||||
| 75 | : | 45 | = | 1 | remainder ( 30 ) | ||||||||||||||
| 45 | : | 30 | = | 1 | remainder ( 15 ) | ||||||||||||||
| 30 | : | 15 | = | 2 | remainder ( 0 ) | ||||||||||||||
| GCD = 15 | |||||||||||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.