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