Euclidean algorithm (polynomial ring)/Gcd/Q/X^9-1 and X^3-1/Exercise

Determine in ${}\mathbb {Q} [X]$, using the Euclidean algorithm, the greatest common divisor of the polynomials ${}P=X^{9}-1$ and ${}Q=X^{3}-1$.

Create a solution