query: Prove that if $b\mid c$ then $\gcd(a,b)=\gcd(a+c,b)$.
positive_passages.docid: 190
positive_passages.text: Why $\gcd(qb+r,b)=\gcd(b,r)$?
negative_passages.docid: 2208
negative_passages.text: $\gcd(a,b,c)=\gcd(\gcd(a,b),c)\,$ [GCD Associative Law]
negative_passages.docid: 87013
negative_passages.text: If $\gcd(a,b)=1$, then there exists integers $x$ and $y$ such that $xa + yb = 1$
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: 151434
negative_passages.text: If integers $a$ and $b$ are not both zero, then $\gcd(a,b)=\gcd(a-b,b)$
negative_passages.docid: 34738
negative_passages.text: Prove that $\gcd(n!+1,(n+1)!+1)=1$
negative_passages.docid: 25825
negative_passages.text: Proof that $\gcd(ax+by,cx+dy)=\gcd(x,y)$ if $ad-bc= \pm 1$
negative_passages.docid: 147527
negative_passages.text: Let $a$ and $b$ be non-zero integers, and $c$ be an integer. Let $d = \gcd(a, b)$. Prove that if $a|c$ and $b|c$ then $ab|cd$.
negative_passages.docid: 32344
negative_passages.text: Let $a,k,m$ be integers. Prove that $\gcd(ka,km) = k\gcd(a,m)$.
negative_passages.docid: 7091
negative_passages.text: If $\gcd(a,b)=1$, then $\gcd(a^n,b^n)=1$
negative_passages.docid: 5789
negative_passages.text: $ d = \gcd(a,b)\Rightarrow\ \gcd(a/d,b/d) = 1$
negative_passages.docid: 20003
negative_passages.text: Prove for positive integers a,b,c and d (where b does not equal d), if gcd(a,b) = gcd(c,d) = 1, then a/b + c/d is not an integer
negative_passages.docid: 19656
negative_passages.text: Proving that $ \gcd(a,b) = as + bt $, i.e., $ \gcd $ is a linear combination.
negative_passages.docid: 90916
negative_passages.text: Prove that if $3\mid a^2+b^2$ then $3\mid a$ and $3\mid b$.
negative_passages.docid: 77278
negative_passages.text: If $\,\gcd(a,b) = {\rm lcm}(a,b)\,$ then prove $a=b$
negative_passages.docid: 91506
negative_passages.text: If $\gcd(a,b) = 1$ then $\gcd(a,a + b) = 1$
negative_passages.docid: 19700
negative_passages.text: Prove that if $a$ and $b$ are relatively prime, then $\gcd(a+b, a-b) = 1$ or $2$