query: Prove: If the GCD(ab,c)=1, then GCD(a,c)=1 and GCD(b,c)=1.
positive_passages.docid: 157784
positive_passages.text: Prove that if $\gcd(ab,c)=1$, then $\gcd(a,c)=1$.
negative_passages.docid: 158308
negative_passages.text: Proving that if $a,b$ are even, then $\gcd(a,b) = 2 \gcd(a/2, b/2)$
negative_passages.docid: 37808
negative_passages.text: Show that $\gcd(a^2, b^2) = \gcd(a,b)^2$
negative_passages.docid: 20878
negative_passages.text: If $(a,b)=1$ then prove $(a+b, ab)=1$.
negative_passages.docid: 110313
negative_passages.text: Prove that $\gcd(f(x),g(x)) = 1$.
negative_passages.docid: 82938
negative_passages.text: $\gcd(a,b)=1, x^a = y^b\Rightarrow x = n^b$, $ y = n^a$ for an integer $n$.
negative_passages.docid: 157508
negative_passages.text: prove $lcm(a,gcd(b,c))=gcd(lcm(a,b),lcm(a,c))$
negative_passages.docid: 40848
negative_passages.text: $a\mid b,c\mid d\Rightarrow\,\gcd(a,c)\mid \gcd(b,d)$
negative_passages.docid: 69279
negative_passages.text: If $\gcd(a,b)=1$ then, $\gcd(a^2,b^2)=1$
negative_passages.docid: 73391
negative_passages.text: Prove that if $\gcd(a,b)=1$, then $\gcd(a^2,b^2)=1$
negative_passages.docid: 128199
negative_passages.text: Proving gcd(a, a+2) is 1 or 2 for every integer a?
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: 7091
negative_passages.text: If $\gcd(a,b)=1$, then $\gcd(a^n,b^n)=1$
negative_passages.docid: 2289
negative_passages.text: Prove that if $\gcd( a, b ) = 1$ then $\gcd( ac, b ) = \gcd( c, b ) $
negative_passages.docid: 147527
negative_passages.text: Let $a$ and $b$ be non-zero integers, and $c$ be an integer. Let $d = \gcd(a, b)$. Prove that if $a|c$ and $b|c$ then $ab|cd$.
negative_passages.docid: 32344
negative_passages.text: Let $a,k,m$ be integers. Prove that $\gcd(ka,km) = k\gcd(a,m)$.
negative_passages.docid: 5789
negative_passages.text: $ d = \gcd(a,b)\Rightarrow\ \gcd(a/d,b/d) = 1$