Let $f=X^n-1$ and $g=X^m-1$ be two polynomials. Show that:
$$\left(f,g\right)=X^{\left(n,m\right)}-1,$$
where $\left(a,b\right)=$ greatest common divisor of $a$ and $b$.
Subscribe to:
Post Comments (Atom)
-
So if I have a matrix and I put it into RREF and keep track of the row operations, I can then write it as a product of elementary matrices. ...
-
I am asked to prove the density of irrationals in $\mathbb{R}$. I understand how to do this by proving the density of $\mathbb{Q}$ first, na...
-
Can someone just explain to me the basic process of what is going on here? I understand everything until we start adding 1's then after ...
No comments:
Post a Comment