The GCD of given numbers is 5.
Step 1 :
Divide $ 15635 $ by $ 2945 $ and get the remainder
The remainder is positive ($ 910 > 0 $), so we will continue with division.
Step 2 :
Divide $ 2945 $ by $ \color{blue}{ 910 } $ and get the remainder
The remainder is still positive ($ 215 > 0 $), so we will continue with division.
Step 3 :
Divide $ 910 $ by $ \color{blue}{ 215 } $ and get the remainder
The remainder is still positive ($ 50 > 0 $), so we will continue with division.
Step 4 :
Divide $ 215 $ by $ \color{blue}{ 50 } $ and get the remainder
The remainder is still positive ($ 15 > 0 $), so we will continue with division.
Step 5 :
Divide $ 50 $ by $ \color{blue}{ 15 } $ and get the remainder
The remainder is still positive ($ 5 > 0 $), so we will continue with division.
Step 6 :
Divide $ 15 $ 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.
| 15635 | : | 2945 | = | 5 | remainder ( 910 ) | ||||||||||
| 2945 | : | 910 | = | 3 | remainder ( 215 ) | ||||||||||
| 910 | : | 215 | = | 4 | remainder ( 50 ) | ||||||||||
| 215 | : | 50 | = | 4 | remainder ( 15 ) | ||||||||||
| 50 | : | 15 | = | 3 | remainder ( 5 ) | ||||||||||
| 15 | : | 5 | = | 3 | remainder ( 0 ) | ||||||||||
| GCD = 5 | |||||||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.