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