query: Let $m$ and $n$ be integers such that $\gcd (m, n) = 1$. Show that $\gcd (m + n, m - n) = 1$ or $2$
positive_passages.docid: 27250
positive_passages.text: Greatest common divisor of two relatively primes
negative_passages.docid: 73391
negative_passages.text: Prove that if $\gcd(a,b)=1$, then $\gcd(a^2,b^2)=1$
negative_passages.docid: 116175
negative_passages.text: Show that $\gcd(3k+2,5k+3)=1$
negative_passages.docid: 31331
negative_passages.text: $|a|=m,\,\gcd(m,n)=1 \implies a$ is an $n$'th power
negative_passages.docid: 14783
negative_passages.text: A Number Theory problem (GCD)
negative_passages.docid: 128199
negative_passages.text: Proving gcd(a, a+2) is 1 or 2 for every integer a?
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: 147246
negative_passages.text: If $\gcd(a,c)=1=\gcd(b,c)$, then $\gcd(ab,c)=1$
negative_passages.docid: 69967
negative_passages.text: How to prove $\gcd(a^m-b^m,a^n-b^n) = a^{\gcd(m,n)} - b^{\gcd(m,n)} $?
negative_passages.docid: 69279
negative_passages.text: If $\gcd(a,b)=1$ then, $\gcd(a^2,b^2)=1$
negative_passages.docid: 108450
negative_passages.text: Prove that $\gcd(a, b) = \gcd(a, b + ma)$?
negative_passages.docid: 48839
negative_passages.text: Show that the order of $a\times b$ is equal to $nm$ if gcd(n,m)=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: 67660
negative_passages.text: Prove $\,b\equiv c\pmod{\!m}\Rightarrow \gcd(b,m)=\gcd(c,m)$ i.e. $\gcd(c+km,m) = \gcd(c,m)$
negative_passages.docid: 138058
negative_passages.text: Prove that $\mathbb Z_{m}\times\mathbb Z_{n} \cong \mathbb Z_{mn}$ implies $\gcd(m,n)=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: 14693
negative_passages.text: $d = \gcd(c,m),\ ac≡bc\pmod{\! m}\Rightarrow a≡b\pmod {\!m/d}\ $ [Congruence Cancellation & Division Rule]