The GCD of given numbers is 19.
Step 1 :
Divide $ 2432 $ by $ 893 $ and get the remainder
The remainder is positive ($ 646 > 0 $), so we will continue with division.
Step 2 :
Divide $ 893 $ by $ \color{blue}{ 646 } $ and get the remainder
The remainder is still positive ($ 247 > 0 $), so we will continue with division.
Step 3 :
Divide $ 646 $ by $ \color{blue}{ 247 } $ and get the remainder
The remainder is still positive ($ 152 > 0 $), so we will continue with division.
Step 4 :
Divide $ 247 $ by $ \color{blue}{ 152 } $ and get the remainder
The remainder is still positive ($ 95 > 0 $), so we will continue with division.
Step 5 :
Divide $ 152 $ by $ \color{blue}{ 95 } $ and get the remainder
The remainder is still positive ($ 57 > 0 $), so we will continue with division.
Step 6 :
Divide $ 95 $ by $ \color{blue}{ 57 } $ and get the remainder
The remainder is still positive ($ 38 > 0 $), so we will continue with division.
Step 7 :
Divide $ 57 $ by $ \color{blue}{ 38 } $ and get the remainder
The remainder is still positive ($ 19 > 0 $), so we will continue with division.
Step 8 :
Divide $ 38 $ by $ \color{blue}{ 19 } $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 19 }} $.
We can summarize an algorithm into a following table.
| 2432 | : | 893 | = | 2 | remainder ( 646 ) | ||||||||||||||
| 893 | : | 646 | = | 1 | remainder ( 247 ) | ||||||||||||||
| 646 | : | 247 | = | 2 | remainder ( 152 ) | ||||||||||||||
| 247 | : | 152 | = | 1 | remainder ( 95 ) | ||||||||||||||
| 152 | : | 95 | = | 1 | remainder ( 57 ) | ||||||||||||||
| 95 | : | 57 | = | 1 | remainder ( 38 ) | ||||||||||||||
| 57 | : | 38 | = | 1 | remainder ( 19 ) | ||||||||||||||
| 38 | : | 19 | = | 2 | remainder ( 0 ) | ||||||||||||||
| GCD = 19 | |||||||||||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.