Find gcd and lcm of two polynomials
Let $f(x)=x^3+x^2+x+1$ and $g(x)=x^3+1$. Then in $\mathbb{Q}[x]$
$\gcd (f(x),g(x))=x+1$
$ \gcd(f(x),g(x))=x^3-1$
$\operatorname{lcm}(f(x),g(x))=x^5+x^3+x^2+1$
$\operatorname{lcm}(f(x),g(x))=x^5+x^4+x^3+x^2+1$
I know how to find the greatest common divisor(gcd) and the least common multiple(lcm) of numbers. But how can I find the gcd and lcm of polynomials?
$\endgroup$2 Answers
$\begingroup$In pretty much the same way -- by using Euclidean algorithm!
Dividing $f(x)$ by g(x) you get quotient 1 and remainder $x^2+x$, so you continue like this: $x^3+x^2+x+1=(x^3+1)\cdot1 + x^2+x$,
$x^3+1=(x^2+x)\cdot x + (-x^2+1)$,
$x^2+x = (-x^2+1)\cdot (-1) + x+1$,
$-x^2+1 = (x+1)\cdot (-x+1)$
so their gcd is $x+1$. Finding lcm now should not be hard.
$\endgroup$ 1 $\begingroup$$f(x)=x^3+x^2+x+1=(x+1)(x^2+1)$ and $g(x)=x^3+1=(x+1)(x^2-x+1)$ $$lcm(f,g)=(x+1)(x^2+1)(x^2-x+1)$$ $$gcd(f,g)=(x+1)$$
$\endgroup$ 1
