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