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}}} .
![{\displaystyle {}\mathbb {R} [X]}](https://wikimedia.org/api/rest_v1/media/math/render/svg/52a170b822ae65cbe9d1cb122f493fcd88305b7f)
