query: If $\gcd(a,b)=1$, $\gcd(a,y)=1$ and $\gcd(b,x)=1$ then prove that $ax+by$ is prime to $ab$
positive_passages.docid: 27544
positive_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: 31465
negative_passages.text: Prove that if $a \mid b$ then $\gcd(a,b) = |a|$
negative_passages.docid: 2289
negative_passages.text: Prove that if $\gcd( a, b ) = 1$ then $\gcd( ac, b ) = \gcd( c, b ) $
negative_passages.docid: 36
negative_passages.text: Prove: If $\gcd(a,b,c)=1$ then there exists $z$ such that $\gcd(az+b,c) = 1$
negative_passages.docid: 65687
negative_passages.text: $\gcd(a,b)\gcd(x,y)\mid ax+by$
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: 37596
negative_passages.text: If $\gcd(a,b)= 1$ and $a$ divides $bc$ then $a$ divides $c\ $ [Euclid's Lemma]
negative_passages.docid: 27170
negative_passages.text: $a\in \mathbb{N}$, $p$ prime, $a<p$ prove that $a\mid p+1\iff\exists\, b,c\in\Bbb N:\dfrac{a}{p}=\dfrac{1}{b}+\dfrac{1}{c}$
negative_passages.docid: 5708
negative_passages.text: Prove that if $k\ge 1\,$ and $\,a^k\equiv 1\pmod{\! n}$ then $\gcd(a,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: 126358
negative_passages.text: Prove for $\gcd$ of two integers $a,b$, that $(a^n,b^n) = (a,b)^n$
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: 127993
negative_passages.text: Let $p$ be a prime. Suppose that $\gcd(a, b) = p$. Find $\gcd(a^2,b)$ for all integers $a$ and $b$.
negative_passages.docid: 24845
negative_passages.text: Let $a\mid c$ and $b\mid c$ such that $\gcd(a,b)=1$, Show that $ab\mid 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: 31895
negative_passages.text: Prove that if $a$ and $b$ are odd, coprime numbers, then $\gcd(2^a +1, 2^b +1) = 3$
negative_passages.docid: 32344
negative_passages.text: Let $a,k,m$ be integers. Prove that $\gcd(ka,km) = k\gcd(a,m)$.