Determine in R [ X ] {\displaystyle {}\mathbb {R} [X]} , using the Euclidean algorithm, the greatest common divisor of the polynomials P = X 3 + π X 2 + 7 {\displaystyle {}P=X^{3}+\pi X^{2}+7} and Q = X 2 + 7 X − 2 {\displaystyle {}Q=X^{2}+{\sqrt {7}}X-{\sqrt {2}}} .