The GCD of given numbers is 1.
Step 1 :
Divide $ 8051 $ by $ 4635 $ and get the remainder
The remainder is positive ($ 3416 > 0 $), so we will continue with division.
Step 2 :
Divide $ 4635 $ by $ \color{blue}{ 3416 } $ and get the remainder
The remainder is still positive ($ 1219 > 0 $), so we will continue with division.
Step 3 :
Divide $ 3416 $ by $ \color{blue}{ 1219 } $ and get the remainder
The remainder is still positive ($ 978 > 0 $), so we will continue with division.
Step 4 :
Divide $ 1219 $ by $ \color{blue}{ 978 } $ and get the remainder
The remainder is still positive ($ 241 > 0 $), so we will continue with division.
Step 5 :
Divide $ 978 $ by $ \color{blue}{ 241 } $ and get the remainder
The remainder is still positive ($ 14 > 0 $), so we will continue with division.
Step 6 :
Divide $ 241 $ by $ \color{blue}{ 14 } $ and get the remainder
The remainder is still positive ($ 3 > 0 $), so we will continue with division.
Step 7 :
Divide $ 14 $ by $ \color{blue}{ 3 } $ and get the remainder
The remainder is still positive ($ 2 > 0 $), so we will continue with division.
Step 8 :
Divide $ 3 $ by $ \color{blue}{ 2 } $ and get the remainder
The remainder is still positive ($ 1 > 0 $), so we will continue with division.
Step 9 :
Divide $ 2 $ by $ \color{blue}{ 1 } $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 1 }} $.
We can summarize an algorithm into a following table.
| 8051 | : | 4635 | = | 1 | remainder ( 3416 ) | ||||||||||||||||
| 4635 | : | 3416 | = | 1 | remainder ( 1219 ) | ||||||||||||||||
| 3416 | : | 1219 | = | 2 | remainder ( 978 ) | ||||||||||||||||
| 1219 | : | 978 | = | 1 | remainder ( 241 ) | ||||||||||||||||
| 978 | : | 241 | = | 4 | remainder ( 14 ) | ||||||||||||||||
| 241 | : | 14 | = | 17 | remainder ( 3 ) | ||||||||||||||||
| 14 | : | 3 | = | 4 | remainder ( 2 ) | ||||||||||||||||
| 3 | : | 2 | = | 1 | remainder ( 1 ) | ||||||||||||||||
| 2 | : | 1 | = | 2 | remainder ( 0 ) | ||||||||||||||||
| GCD = 1 | |||||||||||||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.