query: Proving that there is some $x$ such that $\gcd(a + bx, c) = 1$
positive_passages.docid: 36
positive_passages.text: Prove: If $\gcd(a,b,c)=1$ then there exists $z$ such that $\gcd(az+b,c) = 1$
negative_passages.docid: 74631
negative_passages.text: For natural numbers $a$ and $b$, show that $a \Bbb Z + b \Bbb Z = \gcd(a, b)\Bbb Z $
negative_passages.docid: 116175
negative_passages.text: Show that $\gcd(3k+2,5k+3)=1$
negative_passages.docid: 10348
negative_passages.text: Prove that if the $\gcd(a,b)=1$, then $\gcd(a+b,ab)=1$
negative_passages.docid: 102133
negative_passages.text: Prove: $\gcd(a,b) = \gcd(a, b + at)$.
negative_passages.docid: 157784
negative_passages.text: Prove that if $\gcd(ab,c)=1$, then $\gcd(a,c)=1$.
negative_passages.docid: 128199
negative_passages.text: Proving gcd(a, a+2) is 1 or 2 for every integer 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: 21788
negative_passages.text: Proving that if $ad-bc = \pm 1$, then $\gcd(x,y) = \gcd(ax +by, cx + dy)$
negative_passages.docid: 91506
negative_passages.text: If $\gcd(a,b) = 1$ then $\gcd(a,a + b) = 1$
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: 422
negative_passages.text: If $\gcd(a,b)=1$, $\gcd(a,y)=1$ and $\gcd(b,x)=1$ then prove that $ax+by$ is prime to $ab$
negative_passages.docid: 142693
negative_passages.text: $\gcd(a,b) = \gcd(a + b, \mathrm{lcm}[a,b])$
negative_passages.docid: 112486
negative_passages.text: Bounds on a sum of gcd's
negative_passages.docid: 101872
negative_passages.text: Prove that $\gcd(a^2, b^2) = \gcd(a, b)^2$
negative_passages.docid: 103147
negative_passages.text: $\operatorname{gcd}(ab,a+b)=1$ if $a$ and $b$ are relatively prime
negative_passages.docid: 128820
negative_passages.text: Prove that if $\gcd(a,b)=1$ then $\gcd(ab,c) = \gcd(a,c) \gcd(b,c)$