query: GCD: If $d\mid a, d\mid b$, and $d\mid c$, then $d|\mid \gcd(a,b,c)$
positive_passages.docid: 2208
positive_passages.text: $\gcd(a,b,c)=\gcd(\gcd(a,b),c)\,$ [GCD Associative Law]
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: 7091
negative_passages.text: If $\gcd(a,b)=1$, then $\gcd(a^n,b^n)=1$
negative_passages.docid: 87013
negative_passages.text: If $\gcd(a,b)=1$, then there exists integers $x$ and $y$ such that $xa + yb = 1$
negative_passages.docid: 156966
negative_passages.text: Prove that if $b = dk$ where $gcd(m, a) = d$, there are $d$ solutions to $ax \equiv b \mod m$
negative_passages.docid: 75974
negative_passages.text: $\gcd(a,b)\!=\!1\!=\!\gcd(a,c)\Rightarrow\gcd(a,bc)\!=\!1$ [coprimes to $\,a\,$ are product closed]
negative_passages.docid: 101872
negative_passages.text: Prove that $\gcd(a^2, b^2) = \gcd(a, b)^2$
negative_passages.docid: 107095
negative_passages.text: Prove $\gcd(a,b) \gcd(a,c) \gcd(b,c) \,\text{lcm} (a,b,c)^2=$ $\text{lcm}(a,b)\,\text{lcm}(a,c) \,\text{lcm}(b,c) \gcd(a,b,c)^2$
negative_passages.docid: 142693
negative_passages.text: $\gcd(a,b) = \gcd(a + b, \mathrm{lcm}[a,b])$
negative_passages.docid: 1713
negative_passages.text: number theory $\gcd(a,bc)=\gcd(a,c)$
negative_passages.docid: 84417
negative_passages.text: Prove that if $\gcd(a,b)=1$ then $\gcd(a^m, b)=1$
negative_passages.docid: 24160
negative_passages.text: Show that if $a$ is an odd integer and $b$ is an even integer then $\gcd(a,b)=\gcd(a,b/2)$
negative_passages.docid: 7316
negative_passages.text: How to prove that $z\gcd(a,b)=\gcd(za,zb)$
negative_passages.docid: 48622
negative_passages.text: Given an integer $a$, suppose $d=\gcd(3a+5,\,5a+7)>2$. Determine $d$.
negative_passages.docid: 51538
negative_passages.text: Intuition for $\,c\mid a,b \iff c\mid \gcd(a,b)$
negative_passages.docid: 128820
negative_passages.text: Prove that if $\gcd(a,b)=1$ then $\gcd(ab,c) = \gcd(a,c) \gcd(b,c)$