AngouriMath

Navigation

Home Quick start Wiki Almanac Research What's new Try Use Angouri.org GitHub Report a bug ~~Donate~~ Contacts

← Back to list of members

MultivariateSquareFreePart(AngouriMath.Entity,AngouriMath.Entity.Variable)

Method (no overloads)

Summary

The same, where the coefficients in variable are polynomials
themselves rather than rational numbers.

Remarks

p / gcd(p, dp/dx) is the square-free part whatever ring the coefficients
live in — a repeated factor appears in the derivative one time fewer than in the
polynomial, so dividing by the common part leaves each distinct factor exactly
once. The univariate path above says exactly that over ℤ. Nothing about it is
univariate except the representation it was written against, and the multivariate
one has all three operations: DerivativeIn, the recursive
PolynomialGcd that Gcd(AngouriMath.Entity,AngouriMath.Entity) is already built from, and
exact division.
Reached only where the rational path declined, so nothing that already answered
can change.

AngouriMath

Table of contents

AngouriMath

MultivariateSquareFreePart​(AngouriMath.​Entity,​AngouriMath.​Entity.​Variable)

MultivariateSquareFreePart(AngouriMath.Entity,AngouriMath.Entity.Variable)