[Maxima] Euclindean algorithm for polynomials
toy.raymond at gmail.com
Wed Mar 4 22:13:29 CST 2009
Sheldon Newhouse wrote:
> Is there a routine which performs the Euclidean algotithm for polynomials.
> I.e., p, q are polynomials with degree(p) = d > degree(q) =s,
> I want to obtain
> p = k*q + r
> where k, r are polynomials and degree(r) < s.
Will divide do what you want?
divide(x^3+x^2+x+1, x^2+2) -> [x+1, -x-1]
expand([%*(x^2+2)+%) -> x^3+x^2+x+1
More information about the Maxima