Find a g.c.d. of and in by the Euclidean algorithm.
So divide by :
So the g.c.d. is .
Main Page : Abstract Algebra : Rings