query: CHECK: Let a and b be relatively prime integers. Show that $\gcd(a^2+b^2,a+b)=$1 or 2
positive_passages.docid: 18772
positive_passages.text: If $a,b \in\mathbb N$ and $\gcd(a,b)=1$, prove that $\gcd(a+b;a^2+b^2)= 1$ or $2$.
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: 101872
negative_passages.text: Prove that $\gcd(a^2, b^2) = \gcd(a, b)^2$
negative_passages.docid: 157784
negative_passages.text: Prove that if $\gcd(ab,c)=1$, then $\gcd(a,c)=1$.
negative_passages.docid: 3694
negative_passages.text: Show $GCD(a_1, a_2, a_3, \ldots , a_n)$ is the least positive integer that can be expressed in the form $a_1x_1+a_2x_2+ \ldots +a_nx_n$
negative_passages.docid: 18714
negative_passages.text: $\gcd\left(a+b,\frac{a^p+b^p}{a+b}\right)=1$, or $p$
negative_passages.docid: 128820
negative_passages.text: Prove that if $\gcd(a,b)=1$ then $\gcd(ab,c) = \gcd(a,c) \gcd(b,c)$
negative_passages.docid: 4141
negative_passages.text: Prove: If $a\mid m$ and $b\mid m$ and $\gcd(a,b)=1$ then $ab\mid m$
negative_passages.docid: 84417
negative_passages.text: Prove that if $\gcd(a,b)=1$ then $\gcd(a^m, b)=1$
negative_passages.docid: 89329
negative_passages.text: If a and b are relatively prime and ab is a square, then a and b are squares.
negative_passages.docid: 37808
negative_passages.text: Show that $\gcd(a^2, b^2) = \gcd(a,b)^2$
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: 147802
negative_passages.text: Proving that $\gcd\left(\frac a {\gcd(a,b)},\frac b {\gcd(a,b)}\right) =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: 24160
negative_passages.text: Show that if $a$ is an odd integer and $b$ is an even integer then $\gcd(a,b)=\gcd(a,b/2)$
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: 135779
negative_passages.text: Prove the following: If $a \mid bc$, then $a \mid \gcd(a, b)c$.