query: If $\exists a,b \in \mathbb{N}$ then $\exists k,l \in \mathbb{Z}$ s.t. GCD(a,b)=ak+bl, $l,b\in \mathbb{Z}$
positive_passages.docid: 56612
positive_passages.text: Proof of $\gcd(a,b)=ax+by\ $ [Bezout's identity]
negative_passages.docid: 135779
negative_passages.text: Prove the following: If $a \mid bc$, then $a \mid \gcd(a, b)c$.
negative_passages.docid: 7091
negative_passages.text: If $\gcd(a,b)=1$, then $\gcd(a^n,b^n)=1$
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: 78031
negative_passages.text: $c\mid a,b\iff c\mid\gcd(a,b)$ [GCD Universal Property]
negative_passages.docid: 155784
negative_passages.text: If $\gcd(a, b) = 1$ and if $ab = x^2$, prove that $a, b$ must also be perfect squares; where $a,b,x$ are in the set of natural numbers
negative_passages.docid: 91113
negative_passages.text: $ \exists a, b \in \mathbb{Z} $ such that $ a^2 + b^2 = 5^k $
negative_passages.docid: 37596
negative_passages.text: If $\gcd(a,b)= 1$ and $a$ divides $bc$ then $a$ divides $c\ $ [Euclid's Lemma]
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: 126280
negative_passages.text: In a P.I.D., if $a^m = b^m$ and $a^n = b^n$ for $m, n \in \mathbb{N}$ with $\gcd(m,n) = 1$, then $a=b$
negative_passages.docid: 101872
negative_passages.text: Prove that $\gcd(a^2, b^2) = \gcd(a, b)^2$
negative_passages.docid: 114780
negative_passages.text: $\forall a,b,c \in \mathbb{N}\!:\ a\mid b \Rightarrow ac\mid bc. $ Divisibility Proof
negative_passages.docid: 76680
negative_passages.text: Prove that if $\gcd(a,c)=1$ and $\gcd(b,c)=1$ then $\gcd(ab,c)=1$
negative_passages.docid: 44076
negative_passages.text: Proving if $d_0$ is the smallest positive integer in $S$ then $d_0 = \gcd(a,b)$
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: 31331
negative_passages.text: $|a|=m,\,\gcd(m,n)=1 \implies a$ is an $n$'th power
negative_passages.docid: 17677
negative_passages.text: Prove or show a counter example for: $\forall a, b, c \in \mathbb Z$, if $ab\mid c$ then $a\mid c$ and $b\mid c$