query: Simple question about GCD
positive_passages.docid: 40848
positive_passages.text: $a\mid b,c\mid d\Rightarrow\,\gcd(a,c)\mid \gcd(b,d)$
negative_passages.docid: 113641
negative_passages.text: Suppose the gcd (a,b) = 1 and c divides a + b. Prove that gcd (a,c) = 1 = gcd (b,c)
negative_passages.docid: 10348
negative_passages.text: Prove that if the $\gcd(a,b)=1$, then $\gcd(a+b,ab)=1$
negative_passages.docid: 57281
negative_passages.text: Is Bezout's lemma enough to confirm the GCD of a number.
negative_passages.docid: 76126
negative_passages.text: How to find the GCD of two polynomials
negative_passages.docid: 74924
negative_passages.text: identity element of $(D_n ,\gcd)$
negative_passages.docid: 34330
negative_passages.text: How to prove $\gcd(a^2,b^2) = (\gcd(a,b))^2$?
negative_passages.docid: 94722
negative_passages.text: GCD expressed with irreducible elements in a unique factorization domain
negative_passages.docid: 112486
negative_passages.text: Bounds on a sum of gcd's
negative_passages.docid: 20823
negative_passages.text: If $\gcd(a,b) = 1$ and $a,b\mid x$ then $ab\mid x$.
negative_passages.docid: 92645
negative_passages.text: Why isn't $\gcd(x^2+3x+2,x^2+x)=(x+1)$? [unit normalization of gcds]
negative_passages.docid: 63965
negative_passages.text: How can I compute the sum of $ {m\over\gcd(m,n)}$?
negative_passages.docid: 7090
negative_passages.text: Show that $\gcd(a,bc)=1$ if and only if $\gcd(a,b)=1$ and $\gcd(a,c)=1$
negative_passages.docid: 19164
negative_passages.text: On the GCD of a Pair of Fermat Numbers
negative_passages.docid: 112345
negative_passages.text: In an Integral Domain is it true that $\gcd(ac,ab) = a\gcd(c,b)$?
negative_passages.docid: 83871
negative_passages.text: GCDs in integral domains are unique up to unit factors (associates)
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$?