query: Prove that if the $\gcd(a,b)=1$, then $\gcd(a+b,ab)=1$
positive_passages.docid: 20878
positive_passages.text: If $(a,b)=1$ then prove $(a+b, ab)=1$.
negative_passages.docid: 34738
negative_passages.text: Prove that $\gcd(n!+1,(n+1)!+1)=1$
negative_passages.docid: 33996
negative_passages.text: Proving that $\gcd(2^m - 1, 2^n - 1) = 2^{\gcd(m,n )} - 1$
negative_passages.docid: 19656
negative_passages.text: Proving that $ \gcd(a,b) = as + bt $, i.e., $ \gcd $ is a linear combination.
negative_passages.docid: 66748
negative_passages.text: Show that if $a \equiv b \pmod n$, $\gcd(a,n)=\gcd(b,n)$
negative_passages.docid: 121156
negative_passages.text: Prove that: $\gcd[a,b,c]=\frac{abc.\operatorname{lcm}(a,b,c)}{\operatorname{lcm}(a,b)\operatorname{lcm}(a,c)\operatorname{lcm}(b,c)}$
negative_passages.docid: 7151
negative_passages.text: Let $a,m,n \in \mathbf{N}$. Show that if $\gcd(m,n)=1$, then $\gcd(a,mn)=\gcd(a,m)\cdot\gcd(a,n)$.
negative_passages.docid: 80148
negative_passages.text: Prove $\gcd(a+b,a^2+b^2)$ is $1$ or $2$ if $\gcd(a,b) = 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: 31465
negative_passages.text: Prove that if $a \mid b$ then $\gcd(a,b) = |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: 158308
negative_passages.text: Proving that if $a,b$ are even, then $\gcd(a,b) = 2 \gcd(a/2, b/2)$
negative_passages.docid: 21788
negative_passages.text: Proving that if $ad-bc = \pm 1$, then $\gcd(x,y) = \gcd(ax +by, cx + dy)$
negative_passages.docid: 105832
negative_passages.text: prove that if $\gcd(a,b)=1$ then $\gcd(a^2, b^2)=1$
negative_passages.docid: 135779
negative_passages.text: Prove the following: If $a \mid bc$, then $a \mid \gcd(a, b)c$.
negative_passages.docid: 65218
negative_passages.text: Let $m \in \mathbb{Z^+} , n \in \mathbb{Z^+}$ and let $d=\gcd(m,n)$. Prove that $m\mathbb{Z}+n\mathbb{Z}=d\mathbb{Z}$
negative_passages.docid: 4141
negative_passages.text: Prove: If $a\mid m$ and $b\mid m$ and $\gcd(a,b)=1$ then $ab\mid m$