query: If $m$ and $n$ are integers and $7m =n^2$, then $7\mid \gcd(m,n)$.
positive_passages.docid: 834
positive_passages.text: If $p$ is a prime and $p \mid ab$, then $p \mid a$ or $p \mid b$.
negative_passages.docid: 63774
negative_passages.text: If a and b are odd integers, then $8\mid (a^2-b^2)$
negative_passages.docid: 31555
negative_passages.text: Divisor of $m$ and $n$ divides $m - qn$ (in proof of Euclidean algorithm)
negative_passages.docid: 102757
negative_passages.text: Prove that either $m$ divides $n$ or $n$ divides $m$ given that $\operatorname{lcm}(m,n) + \operatorname{gcd}(m,n) = m + n$?
negative_passages.docid: 69279
negative_passages.text: If $\gcd(a,b)=1$ then, $\gcd(a^2,b^2)=1$
negative_passages.docid: 90962
negative_passages.text: For positive integers $m,n$ if $\sqrt 7 - \frac{m}{n} > 0$ then prove that $\sqrt 7 - \frac{m}{n} > \frac{1}{{mn}}$
negative_passages.docid: 130112
negative_passages.text: If $\gcd(a,n) = 1$ and $\gcd(b,n) = 1$, then $\gcd(ab,n) = 1$.
negative_passages.docid: 25573
negative_passages.text: If $\gcd(a,b)=1$, then $\gcd(a+b,a^2 -ab+b^2)=1$ or $3$.
negative_passages.docid: 52483
negative_passages.text: Showing that $(m)\cap (n)=(\operatorname{lcm}(m,n))$ and $(m)+(n)=(\gcd(m,n))$ for any $m,n\in\mathbb{Z}$
negative_passages.docid: 31331
negative_passages.text: $|a|=m,\,\gcd(m,n)=1 \implies a$ is an $n$'th power
negative_passages.docid: 106416
negative_passages.text: If $n,m \in \mathbb{N}$ then there are $c,d$ such that $cd = (m,n)$, $(c,d) = 1$ and $(m/c,n/d) = 1$.
negative_passages.docid: 51858
negative_passages.text: Showing $\gcd(2^m-1,2^n+1)=1$
negative_passages.docid: 5223
negative_passages.text: $\mathbb{Z}_m \times \mathbb Z_n$ is cyclic if and only if $\gcd(m,n)=1$
negative_passages.docid: 6410
negative_passages.text: Prove that $(ma, mb) = |m|(a, b)\ $ [GCD & LCM Distributive Law]
negative_passages.docid: 101872
negative_passages.text: Prove that $\gcd(a^2, b^2) = \gcd(a, b)^2$
negative_passages.docid: 59533
negative_passages.text: If $\gcd(m,n)=1$, then $\mathbb{Z}_n \times \mathbb{Z}_m$ is cyclic.
negative_passages.docid: 27544
negative_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)$