query: Greatest Common Divisor question (involving Bezout's theorem)
positive_passages.docid: 56612
positive_passages.text: Proof of $\gcd(a,b)=ax+by\ $ [Bezout's identity]
negative_passages.docid: 10966
negative_passages.text: gcd and lcm from prime factorization proof
negative_passages.docid: 57281
negative_passages.text: Is Bezout's lemma enough to confirm the GCD of a number.
negative_passages.docid: 117777
negative_passages.text: What are the zero divisors of $C[0,1]$?
negative_passages.docid: 71392
negative_passages.text: Is $\operatorname{lcm}(a,\gcd(b,c))=\gcd(\operatorname{lcm}(a,b),\operatorname{lcm}(a,c))$
negative_passages.docid: 152878
negative_passages.text: calculate the gcd of $a+b$ and $p^4$
negative_passages.docid: 108450
negative_passages.text: Prove that $\gcd(a, b) = \gcd(a, b + ma)$?
negative_passages.docid: 4648
negative_passages.text: Proving that $\mathbb{Z}_m\oplus \mathbb{Z}_n \cong \mathbb{Z}_d\oplus \mathbb{Z}_l $ as groups, where $l=\mathrm{lcm}(m,n)$ and $d=\gcd(m,n)$
negative_passages.docid: 135571
negative_passages.text: Bézout Identity with coefficient divisibility constraints
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: 37808
negative_passages.text: Show that $\gcd(a^2, b^2) = \gcd(a,b)^2$
negative_passages.docid: 125737
negative_passages.text: GCD( LCM(a,b) , LCM(a,c) ) = LCM(b, GCD(b,c)) , why?
negative_passages.docid: 139833
negative_passages.text: Prove that $\gcd(M, N)\times \mbox{lcm}(M, N) = M \times N$.
negative_passages.docid: 120459
negative_passages.text: Problem with finding the GCD in the Field of Polynomials mod p
negative_passages.docid: 92630
negative_passages.text: How to prove $\gcd(a^m,b^m) = \gcd(a,b)^m$ using Bézout's Lemma
negative_passages.docid: 33996
negative_passages.text: Proving that $\gcd(2^m - 1, 2^n - 1) = 2^{\gcd(m,n )} - 1$
negative_passages.docid: 110313
negative_passages.text: Prove that $\gcd(f(x),g(x)) = 1$.