# modern alg

• Nov 7th 2008, 08:58 AM
wvlilgurl
modern alg
Let F be a field and let e(x), g(x), h(x), and f(x) be polynomials in F[x] with h(x) of positive degree. Prove that if e(x) = gcd(g(x),h(x)) and e(x) divides f(x), then there is a polynomial j(x)in F[x] such that
g(x)j(x)= f(x)(modh(x)).
• Nov 7th 2008, 10:42 AM
ThePerfectHacker
Quote:

Originally Posted by wvlilgurl
Let F be a field and let e(x), g(x), h(x), and f(x) be polynomials in F[x] with h(x) of positive degree. Prove that if e(x) = gcd(g(x),h(x)) and e(x) divides f(x), then there is a polynomial j(x)in F[x] such that
g(x)j(x)= f(x)(modh(x)).

Since $e(x)=\gcd(g(x),h(x))$ it means we can write $e(x) = a(x)g(x)+b(x)h(x)$. But $e(x)|f(x)$ it means $f(x) = e(x)d(x)$. Therefore, $f(x) = e(x)d(x) = a(x)d(x)g(x)+b(x)d(x)h(x)$. It follows that $g(x)j(x) \equiv g(x) ~ \bmod h(x)$ where $j(x)=a(x)d(x)$.