query: $ a , b $ are two odd integers with $\gcd(a,b)=1$. Show that $\gcd(2^a+1,2^b+1)=3$.
positive_passages.docid: 19500
positive_passages.text: How can I find $\gcd(a^m+1,a^n+1)$ with $a,m,n$ positive integers?
negative_passages.docid: 80148
negative_passages.text: Prove $\gcd(a+b,a^2+b^2)$ is $1$ or $2$ if $\gcd(a,b) = 1$
negative_passages.docid: 151434
negative_passages.text: If integers $a$ and $b$ are not both zero, then $\gcd(a,b)=\gcd(a-b,b)$
negative_passages.docid: 87846
negative_passages.text: If $\gcd (x,4) = 2$ and $\gcd(y,4) = 2$ then $\gcd(x+y,4) = 4$
negative_passages.docid: 7091
negative_passages.text: If $\gcd(a,b)=1$, then $\gcd(a^n,b^n)=1$
negative_passages.docid: 83307
negative_passages.text: If $n\mid a^2-1$, $n$ an odd integer, show $n = \gcd(a-1, n)\gcd(a+1, n)$
negative_passages.docid: 101872
negative_passages.text: Prove that $\gcd(a^2, b^2) = \gcd(a, b)^2$
negative_passages.docid: 22845
negative_passages.text: Prove that if d is a common divisor of a and b, then $d=\gcd(a,b)$ if and only if $\gcd(a/d,b/d)=1$
negative_passages.docid: 135086
negative_passages.text: GCD of two numbers divided by their greatest common divisor is 1
negative_passages.docid: 126358
negative_passages.text: Prove for $\gcd$ of two integers $a,b$, that $(a^n,b^n) = (a,b)^n$
negative_passages.docid: 12862
negative_passages.text: Prove that two distinct numbers of the form $a^{2^{n}} + 1$ and $a^{2^{m}} + 1$ are relatively prime if $a$ is even and have $\gcd=2$ if $a$ is odd
negative_passages.docid: 1713
negative_passages.text: number theory $\gcd(a,bc)=\gcd(a,c)$
negative_passages.docid: 73391
negative_passages.text: Prove that if $\gcd(a,b)=1$, then $\gcd(a^2,b^2)=1$
negative_passages.docid: 18714
negative_passages.text: $\gcd\left(a+b,\frac{a^p+b^p}{a+b}\right)=1$, or $p$
negative_passages.docid: 59006
negative_passages.text: Proof of $\gcd(n!+1, (n+1)!+1)=1$?
negative_passages.docid: 72424
negative_passages.text: Suppose 1 ≤ k ≤ n − 1 and gcd(k, n) = 1. Prove that gcd(n − k, n) = 1
negative_passages.docid: 128820
negative_passages.text: Prove that if $\gcd(a,b)=1$ then $\gcd(ab,c) = \gcd(a,c) \gcd(b,c)$