3 * Functions for polynomial quotient and remainder, GCD and LCM computation
4 * and square-free factorization.
6 * GiNaC Copyright (C) 1999 Johannes Gutenberg University Mainz, Germany
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation; either version 2 of the License, or
11 * (at your option) any later version.
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
18 * You should have received a copy of the GNU General Public License
19 * along with this program; if not, write to the Free Software
20 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
29 // Quotient q(x) of polynomials a(x) and b(x) in Q[x], so that a(x)=b(x)*q(x)+r(x)
30 extern ex quo(const ex &a, const ex &b, const symbol &x, bool check_args = true);
32 // Remainder r(x) of polynomials a(x) and b(x) in Q[x], so that a(x)=b(x)*q(x)+r(x)
33 extern ex rem(const ex &a, const ex &b, const symbol &x, bool check_args = true);
35 // Pseudo-remainder of polynomials a(x) and b(x) in Z[x]
36 extern ex prem(const ex &a, const ex &b, const symbol &x, bool check_args = true);
38 // Exact polynomial division of a(X) by b(X) in Q[X] (quotient returned in q), returns false when exact division fails
39 extern bool divide(const ex &a, const ex &b, ex &q, bool check_args = true);
41 // Polynomial GCD in Z[X], cofactors are returned in ca and cb, if desired
42 extern ex gcd(const ex &a, const ex &b, ex *ca = NULL, ex *cb = NULL, bool check_args = true);
44 // Polynomial LCM in Z[X]
45 extern ex lcm(const ex &a, const ex &b, bool check_args = true);
47 // Square-free factorization of a polynomial a(x)
48 extern ex sqrfree(const ex &a, const symbol &x);