Let S be the set: S={p(x)m(x)+q(x)n(x) l n(x) and m(x) are polynomials} d(x) is an element of smallest degree Show d(x) is gcd of p(x) and q(x) (using division algorithm) Argue every element in S is a multiple of d(x)
Follow Math Help Forum on Facebook and Google+
View Tag Cloud