The GCD of given numbers is 1.
Step 1 :
Divide $ 623 $ by $ 59 $ and get the remainder
The remainder is positive ($ 33 > 0 $), so we will continue with division.
Step 2 :
Divide $ 59 $ by $ \color{blue}{ 33 } $ and get the remainder
The remainder is still positive ($ 26 > 0 $), so we will continue with division.
Step 3 :
Divide $ 33 $ by $ \color{blue}{ 26 } $ and get the remainder
The remainder is still positive ($ 7 > 0 $), so we will continue with division.
Step 4 :
Divide $ 26 $ by $ \color{blue}{ 7 } $ and get the remainder
The remainder is still positive ($ 5 > 0 $), so we will continue with division.
Step 5 :
Divide $ 7 $ by $ \color{blue}{ 5 } $ and get the remainder
The remainder is still positive ($ 2 > 0 $), so we will continue with division.
Step 6 :
Divide $ 5 $ by $ \color{blue}{ 2 } $ and get the remainder
The remainder is still positive ($ 1 > 0 $), so we will continue with division.
Step 7 :
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.
| 623 | : | 59 | = | 10 | remainder ( 33 ) | ||||||||||||
| 59 | : | 33 | = | 1 | remainder ( 26 ) | ||||||||||||
| 33 | : | 26 | = | 1 | remainder ( 7 ) | ||||||||||||
| 26 | : | 7 | = | 3 | remainder ( 5 ) | ||||||||||||
| 7 | : | 5 | = | 1 | remainder ( 2 ) | ||||||||||||
| 5 | : | 2 | = | 2 | 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.