Find gcd($2^{19} + 1$; $2^{86} + 1$)
It would be easy to give a formal proof for any gcd($2^{n} + 1$; $2^{m} + 1$) based on Proving that $\gcd(2^m - 1, 2^n - 1) = 2^{\gcd(m,n )} - 1$ if $m$, $n$ were uneven but the problem is: $86$ is an even number. What to do then? Can i solve it without finding an ultimate solution for any n, m? (Like, an easier way for this exact problem)
Let $d$ be the gcd. Note: $$d\mid 2^{67}(2^{19}+1)-(2^{86}+1)=2^{67}-1\\ d\mid 2^{48}(2^{19}+1)-(2^{67}-1)=2^{48}+1\\ d\mid 2^{29}(2^{19}+1)-(2^{48}+1)=2^{29}-1\\ d\mid 2^{10}(2^{19}+1)-(2^{29}-1)=2^{10}+1\\ d\mid 2^{9}(2^{10}+1)-(2^{19}+1)=2^{9}-1\\ d\mid (2^{10}+1)-2^{1}(2^{9}-1)=3\\ d\in \{1,3\}\\ 2^{86}+1\equiv (-1)^{86}+1\equiv 2 \pmod{3} \Rightarrow 3\not\mid 2^{86}+1$$ Hence, $\gcd(2^{19}+1,2^{86}+1)=1$.