query: If $\gcd (a,b)=1$, and $\gcd(a,c)=1$, then $\gcd (a,bc)=1$
positive_passages.docid: 75974
positive_passages.text: $\gcd(a,b)\!=\!1\!=\!\gcd(a,c)\Rightarrow\gcd(a,bc)\!=\!1$ [coprimes to $\,a\,$ are product closed]
negative_passages.docid: 52546
negative_passages.text: How can I find the possible values that $\gcd(a+b,a^2+b^2)$ can take, if $\gcd(a,b)=1$
negative_passages.docid: 157508
negative_passages.text: prove $lcm(a,gcd(b,c))=gcd(lcm(a,b),lcm(a,c))$
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: 66748
negative_passages.text: Show that if $a \equiv b \pmod n$, $\gcd(a,n)=\gcd(b,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: 25713
negative_passages.text: If $a$ and $b$ commute and $\text{gcd}\left(\text{ord}(a),\text{ord}(b)\right)=1$, then $\text{ord}(ab)=\text{ord}(a)\text{ord}(b)$.
negative_passages.docid: 49109
negative_passages.text: Proving $\gcd \left(\frac{a}{\gcd (a,b)},\frac{b}{\gcd (a,b)}\right)=1$
negative_passages.docid: 84417
negative_passages.text: Prove that if $\gcd(a,b)=1$ then $\gcd(a^m, b)=1$
negative_passages.docid: 25907
negative_passages.text: Show $a\Bbb Z+b\Bbb Z = \gcd(a,b)\Bbb Z$
negative_passages.docid: 85688
negative_passages.text: How to show $\gcd(ac, bd) = \gcd(a,d) * \gcd(b,c)$
negative_passages.docid: 18772
negative_passages.text: If $a,b \in\mathbb N$ and $\gcd(a,b)=1$, prove that $\gcd(a+b;a^2+b^2)= 1$ or $2$.
negative_passages.docid: 63758
negative_passages.text: $c\mid ab\Rightarrow c\mid \gcd(a,c)\gcd(b,c),\,$ for integers $a, b, c$
negative_passages.docid: 1713
negative_passages.text: number theory $\gcd(a,bc)=\gcd(a,c)$
negative_passages.docid: 101872
negative_passages.text: Prove that $\gcd(a^2, b^2) = \gcd(a, b)^2$
negative_passages.docid: 55673
negative_passages.text: Alternate proof that $\exists\ x \in \Bbb{Z}$ such that $ \gcd (a+bx,c) = 1$?
negative_passages.docid: 35945
negative_passages.text: Proof that if $\gcd(a,b) = 1$ and $a\mid n$ and $b\mid n$, $ab \mid n$