query: Given that $a,b \in \mathbb{Z}$ and are nonzero. Why is it that $\frac{a}{\gcd(a,b)}$ and $\frac{b}{\gcd(a,b)}$ are coprime?
positive_passages.docid: 147802
positive_passages.text: Proving that $\gcd\left(\frac a {\gcd(a,b)},\frac b {\gcd(a,b)}\right) =1$
negative_passages.docid: 118809
negative_passages.text: If $a$ divides $bc$ and $\gcd(a,b) = d$ then $\frac a d$ divides c
negative_passages.docid: 96535
negative_passages.text: Show that if $\gcd(a,3)=1$ then $a^7 \equiv a\pmod{63}$. Why is this assumption necessary?
negative_passages.docid: 91506
negative_passages.text: If $\gcd(a,b) = 1$ then $\gcd(a,a + b) = 1$
negative_passages.docid: 19822
negative_passages.text: For $D$ a GCD domain , let $a,b,x \in D \setminus \{0\}$ , then is it true that $\gcd (ax,bx)=x \cdot \gcd (a,b)$?
negative_passages.docid: 23066
negative_passages.text: If $\gcd(a, b) = 1$, then $\gcd(ab, c) = \gcd(a, c) \cdot\gcd(b, c)$
negative_passages.docid: 125737
negative_passages.text: GCD( LCM(a,b) , LCM(a,c) ) = LCM(b, GCD(b,c)) , why?
negative_passages.docid: 19656
negative_passages.text: Proving that $ \gcd(a,b) = as + bt $, i.e., $ \gcd $ is a linear combination.
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: 38295
negative_passages.text: If $\gcd (a,b) = 1$, what can be said about $\gcd (a+b,a-b)$?
negative_passages.docid: 27544
negative_passages.text: With $a,\ b,\ m,\ n\in \mathbb{Z}$. Show that if ${\rm gcd}(m,n)=1$, then ${\rm gcd}(ma+nb,mn)={\rm gcd}(a,n){\rm gcd}(b,m)$
negative_passages.docid: 145354
negative_passages.text: What is $\gcd(0,0)$?
negative_passages.docid: 11600
negative_passages.text: $\gcd(a,\operatorname{lcm}(b,c))=\operatorname{lcm}(\gcd(a,b),\gcd(a,c))$
negative_passages.docid: 55441
negative_passages.text: Check: For the integers $a,b,c$ show that $\gcd(a,bc)=\gcd(a,\gcd(a,b)\cdot c)$
negative_passages.docid: 15168
negative_passages.text: If $a,b$ are positive integers such that $\gcd(a,b)=1$, then show that $\gcd(a+b, a-b)=1$ or $2$. and $\gcd(a^2+b^2, a^2-b^2)=1$ or $2 $
negative_passages.docid: 1991
negative_passages.text: If $\gcd(a,b)=1$ and $a$ and $b$ divide $c$, then so does $ab$
negative_passages.docid: 108450
negative_passages.text: Prove that $\gcd(a, b) = \gcd(a, b + ma)$?