query: Show that two numbers divided by their GCD are coprime
positive_passages.docid: 49109
positive_passages.text: Proving $\gcd \left(\frac{a}{\gcd (a,b)},\frac{b}{\gcd (a,b)}\right)=1$
negative_passages.docid: 31465
negative_passages.text: Prove that if $a \mid b$ then $\gcd(a,b) = |a|$
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$
negative_passages.docid: 59006
negative_passages.text: Proof of $\gcd(n!+1, (n+1)!+1)=1$?
negative_passages.docid: 147802
negative_passages.text: Proving that $\gcd\left(\frac a {\gcd(a,b)},\frac b {\gcd(a,b)}\right) =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: 139350
negative_passages.text: Given two coprime integers, find multiples of them that differ by 1
negative_passages.docid: 142693
negative_passages.text: $\gcd(a,b) = \gcd(a + b, \mathrm{lcm}[a,b])$
negative_passages.docid: 77278
negative_passages.text: If $\,\gcd(a,b) = {\rm lcm}(a,b)\,$ then prove $a=b$
negative_passages.docid: 7091
negative_passages.text: If $\gcd(a,b)=1$, then $\gcd(a^n,b^n)=1$
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: 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: 108450
negative_passages.text: Prove that $\gcd(a, b) = \gcd(a, b + ma)$?
negative_passages.docid: 77064
negative_passages.text: Proving $\gcd((a+b)^m,(a-b)^m)\le2^m$ for coprime $a,b$ and $m \in \Bbb N$
negative_passages.docid: 83307
negative_passages.text: If $n\mid a^2-1$, $n$ an odd integer, show $n = \gcd(a-1, n)\gcd(a+1, n)$
negative_passages.docid: 69279
negative_passages.text: If $\gcd(a,b)=1$ then, $\gcd(a^2,b^2)=1$
negative_passages.docid: 23590
negative_passages.text: Show that $\gcd\left(\frac{a^n-b^n}{a-b},a-b\right)=\gcd(n d^{n-1},a-b)$