Loading [MathJax]/jax/output/HTML-CSS/jax.js

First time here? Check out the FAQ!

Ask Your Question

Revision history [back]

click to hide/show revision 1
initial version

asked 13 years ago

manenir gravatar image

symbolic polynomial euclidean algorithm

Hi there!

Suppose we have polynomials f(x),g(x) with coefficients in Q(a,b) for example f(x)=ax2,g(x)=x2b. How can we find polynomials f1(x),g2(x)Q(a,b)[x] such that f(x)f1(x)+g(x)g1(x)=g.c.d.(f(x),g(x))?

Thanks

click to hide/show revision 2
retagged

updated 13 years ago

Kelvin Li gravatar image

symbolic polynomial euclidean algorithm

Hi there!

Suppose we have polynomials f(x),g(x) with coefficients in Q(a,b) for example f(x)=ax2,g(x)=x2b. How can we find polynomials f1(x),g2(x)Q(a,b)[x] such that f(x)f1(x)+g(x)g1(x)=g.c.d.(f(x),g(x))?

Thanks