query: about GCD, please help me
positive_passages.docid: 19700
positive_passages.text: Prove that if $a$ and $b$ are relatively prime, then $\gcd(a+b, a-b) = 1$ or $2$
negative_passages.docid: 76507
negative_passages.text: $\gcd(b^x - 1, b^y - 1, b^ z- 1,\dots) = b^{\gcd(x, y, z,\dots)} -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)$
negative_passages.docid: 110313
negative_passages.text: Prove that $\gcd(f(x),g(x)) = 1$.
negative_passages.docid: 40848
negative_passages.text: $a\mid b,c\mid d\Rightarrow\,\gcd(a,c)\mid \gcd(b,d)$
negative_passages.docid: 105832
negative_passages.text: prove that if $\gcd(a,b)=1$ then $\gcd(a^2, b^2)=1$
negative_passages.docid: 53777
negative_passages.text: Why is $\gcd(x^4+1,x^2-1) = 1$ but I get $2$? [unit normalization of gcds]
negative_passages.docid: 59006
negative_passages.text: Proof of $\gcd(n!+1, (n+1)!+1)=1$?
negative_passages.docid: 19164
negative_passages.text: On the GCD of a Pair of Fermat Numbers
negative_passages.docid: 36862
negative_passages.text: A question about proving that there is no greatest common divisor
negative_passages.docid: 135086
negative_passages.text: GCD of two numbers divided by their greatest common divisor is 1
negative_passages.docid: 154959
negative_passages.text: Proof of associativity of GCD?
negative_passages.docid: 25573
negative_passages.text: If $\gcd(a,b)=1$, then $\gcd(a+b,a^2 -ab+b^2)=1$ or $3$.
negative_passages.docid: 63965
negative_passages.text: How can I compute the sum of $ {m\over\gcd(m,n)}$?
negative_passages.docid: 130112
negative_passages.text: If $\gcd(a,n) = 1$ and $\gcd(b,n) = 1$, then $\gcd(ab,n) = 1$.
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: 82777
negative_passages.text: If $\gcd(a, b) = 1$ then prove that $\gcd(a+b, a^2-ab+b^2) = 1$ or $3$?