The GCD of given numbers is 23.
Step 1 :
Divide $ 161 $ by $ 69 $ and get the remainder
The remainder is positive ($ 23 > 0 $), so we will continue with division.
Step 2 :
Divide $ 69 $ by $ \color{blue}{ 23 } $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 23 }} $.
We can summarize an algorithm into a following table.
| 161 | : | 69 | = | 2 | remainder ( 23 ) | ||
| 69 | : | 23 | = | 3 | remainder ( 0 ) | ||
| GCD = 23 | |||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.