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