The GCD of given numbers is 1.
Step 1 :
Divide $ 3255854716 $ by $ 65537 $ and get the remainder
The remainder is positive ($ 42093 > 0 $), so we will continue with division.
Step 2 :
Divide $ 65537 $ by $ \color{blue}{ 42093 } $ and get the remainder
The remainder is still positive ($ 23444 > 0 $), so we will continue with division.
Step 3 :
Divide $ 42093 $ by $ \color{blue}{ 23444 } $ and get the remainder
The remainder is still positive ($ 18649 > 0 $), so we will continue with division.
Step 4 :
Divide $ 23444 $ by $ \color{blue}{ 18649 } $ and get the remainder
The remainder is still positive ($ 4795 > 0 $), so we will continue with division.
Step 5 :
Divide $ 18649 $ by $ \color{blue}{ 4795 } $ and get the remainder
The remainder is still positive ($ 4264 > 0 $), so we will continue with division.
Step 6 :
Divide $ 4795 $ by $ \color{blue}{ 4264 } $ and get the remainder
The remainder is still positive ($ 531 > 0 $), so we will continue with division.
Step 7 :
Divide $ 4264 $ by $ \color{blue}{ 531 } $ and get the remainder
The remainder is still positive ($ 16 > 0 $), so we will continue with division.
Step 8 :
Divide $ 531 $ by $ \color{blue}{ 16 } $ and get the remainder
The remainder is still positive ($ 3 > 0 $), so we will continue with division.
Step 9 :
Divide $ 16 $ by $ \color{blue}{ 3 } $ and get the remainder
The remainder is still positive ($ 1 > 0 $), so we will continue with division.
Step 10 :
Divide $ 3 $ 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.
| 3255854716 | : | 65537 | = | 49679 | remainder ( 42093 ) | ||||||||||||||||||
| 65537 | : | 42093 | = | 1 | remainder ( 23444 ) | ||||||||||||||||||
| 42093 | : | 23444 | = | 1 | remainder ( 18649 ) | ||||||||||||||||||
| 23444 | : | 18649 | = | 1 | remainder ( 4795 ) | ||||||||||||||||||
| 18649 | : | 4795 | = | 3 | remainder ( 4264 ) | ||||||||||||||||||
| 4795 | : | 4264 | = | 1 | remainder ( 531 ) | ||||||||||||||||||
| 4264 | : | 531 | = | 8 | remainder ( 16 ) | ||||||||||||||||||
| 531 | : | 16 | = | 33 | remainder ( 3 ) | ||||||||||||||||||
| 16 | : | 3 | = | 5 | remainder ( 1 ) | ||||||||||||||||||
| 3 | : | 1 | = | 3 | remainder ( 0 ) | ||||||||||||||||||
| GCD = 1 | |||||||||||||||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.