compute a greatest factorial factorization of a univariate polynomial
polynomial in x
The GreatestFactorialFactorization command computes a greatest factorial factorization [c,[[g1,e1],[g2,e2],...]] of f w.r.t. x. It satisfies the following properties.
gcd⁡gi⁡x⁢gi⁡x−1⁢...⁢gi⁡x−e1+1,gj⁡x+1⁢gj⁡x+ej=1 for 1<=i<=j
c is constant w.r.t. x, and g1,... are nonconstant primitive polynomials w.r.t. x, and 0<e1<e2<... are integers.
The greatest factorial factorization is unique up to multiplication by units.
GreatestFactorialFactorization can handle the same types of coefficients as the Maple function gcd.
If f is constant w.r.t. x, then the return value is f,.
Partial factorizations of the input are not taken into account.
Paule, Peter. "Greatest factorial factorization and symbolic summation." Journal of Symbolic Computation Vol. 20, (1995): 235-268.
Gerhard, Juergen. "Modular algorithms for polynomial basis conversion and greatest factorial factorization." Proceedings of the Seventh Rhine Workshop on Computer Algebra, RWCA pp. 125-141 ed. T. Mulders, 2000.
Download Help Document
What kind of issue would you like to report? (Optional)
Thank you for submitting feedback on this help document. Your feedback will be used
to improve Maple's help in the future.