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)

Printable View

- Jun 29th 2010, 08:11 AMstephandersonProof Help
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)