Finding the gcd of polynomials $p,q$ and writing $\gcd(p,q)=d_1(x)p+d_2(x)q$
40122
Why does the Euclidean algorithm work for polynomials? What is the proof?
117098
Properties of the greatest common divisor: $\gcd(a, b) = \gcd(a, b-a)$ and $\gcd(a, b) = \gcd(a, b \text{ mod } a)$
95889
Prove that $\gcd(n! + 1, 3n! + 1) = 1$, $\forall n \in \mathbb{N}$, $n \geq 2$.
120459
Problem with finding the GCD in the Field of Polynomials mod p
14693
$d = \gcd(c,m),\ ac≡bc\pmod{\! m}\Rightarrow a≡b\pmod {\!m/d}\ $ [Congruence Cancellation & Division Rule]
65687
$\gcd(a,b)\gcd(x,y)\mid ax+by$
69279
If $\gcd(a,b)=1$ then, $\gcd(a^2,b^2)=1$
2289
Prove that if $\gcd( a, b ) = 1$ then $\gcd( ac, b ) = \gcd( c, b ) $
18714
$\gcd\left(a+b,\frac{a^p+b^p}{a+b}\right)=1$, or $p$
77403
Finding the minimal polynomial of $\sqrt 2 + \sqrt[3] 2$ over $\mathbb Q$.
18772
If $a,b \in\mathbb N$ and $\gcd(a,b)=1$, prove that $\gcd(a+b;a^2+b^2)= 1$ or $2$.
15168
If $a,b$ are positive integers such that $\gcd(a,b)=1$, then show that $\gcd(a+b, a-b)=1$ or $2$. and $\gcd(a^2+b^2, a^2-b^2)=1$ or $2 $
77064
Proving $\gcd((a+b)^m,(a-b)^m)\le2^m$ for coprime $a,b$ and $m \in \Bbb N$
43155
Cyclotomic Polynomials and GCD
25573
If $\gcd(a,b)=1$, then $\gcd(a+b,a^2 -ab+b^2)=1$ or $3$.
97196
$k^{\phi(l)} + l^{\phi(k)} \equiv1\pmod{lk}\,$ if $\,\gcd(l,k)=1$
60596
Euclidean Algorithm for GCD of polynomials