query: Use induction to prove $\gcd(m, n) = am + bn$
positive_passages.docid: 25907
positive_passages.text: Show $a\Bbb Z+b\Bbb Z = \gcd(a,b)\Bbb Z$
negative_passages.docid: 18772
negative_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: 39175
negative_passages.text: Prove by induction that $\forall n \in\mathbb N$, $3\mid4^{n}-1$.
negative_passages.docid: 147902
negative_passages.text: Prove $a \mid m$ and $b \mid m \implies \frac{a \cdot b}{\text{gcd}(a, b)} \mid m$
negative_passages.docid: 158308
negative_passages.text: Proving that if $a,b$ are even, then $\gcd(a,b) = 2 \gcd(a/2, b/2)$
negative_passages.docid: 34738
negative_passages.text: Prove that $\gcd(n!+1,(n+1)!+1)=1$
negative_passages.docid: 95000
negative_passages.text: Using induction to prove that $2 \mid (n^2 − n)$ for $n\geq 1$
negative_passages.docid: 66785
negative_passages.text: Find $\gcd(p^n-1,p^m+1)$.
negative_passages.docid: 61635
negative_passages.text: Proving AM-GM with induction
negative_passages.docid: 10348
negative_passages.text: Prove that if the $\gcd(a,b)=1$, then $\gcd(a+b,ab)=1$
negative_passages.docid: 63965
negative_passages.text: How can I compute the sum of $ {m\over\gcd(m,n)}$?
negative_passages.docid: 19656
negative_passages.text: Proving that $ \gcd(a,b) = as + bt $, i.e., $ \gcd $ is a linear combination.
negative_passages.docid: 59566
negative_passages.text: Proving that $ka \equiv kb \pmod{m} \iff a \equiv b \pmod{m/\gcd(k,m)}$
negative_passages.docid: 45760
negative_passages.text: if G is generated by {a,b} and ab=ba, then prove G is Abelian
negative_passages.docid: 95889
negative_passages.text: Prove that $\gcd(n! + 1, 3n! + 1) = 1$, $\forall n \in \mathbb{N}$, $n \geq 2$.
negative_passages.docid: 113641
negative_passages.text: Suppose the gcd (a,b) = 1 and c divides a + b. Prove that gcd (a,c) = 1 = gcd (b,c)
negative_passages.docid: 105832
negative_passages.text: prove that if $\gcd(a,b)=1$ then $\gcd(a^2, b^2)=1$