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