AngouriMath
IsPolynomialShaped(AngouriMath.Entity)
Method (no overloads)
Summary
Adds up the terms of an expanded sum that differ only by a numeric factor, so
that expanding actually finishes:(x+1)^2 * (x+1)^2 multiplied out gives
sixteen terms, of which only five are distinct.
that expanding actually finishes:
sixteen terms, of which only five are distinct.
Remarks
Deliberately not Simplify(System.Int32), which is far too expensive to run
inside Expand(System.Int32). Each term is reduced to a coefficient and a
product of powers, and terms whose products agree are added together --
enough to collect like terms and nothing more.
inside Expand(System.Int32). Each term is reduced to a coefficient and a
product of powers, and terms whose products agree are added together --
enough to collect like terms and nothing more.
Summary
Whether every node of the expression is one that monomial collection describes:
numbers, variables, and the operations that build a polynomial out of them.
numbers, variables, and the operations that build a polynomial out of them.
Remarks
Opening a product to reach its numeric factor is what lets like terms meet, and
it is also what stops a product cancelling as a whole -- lifting the 1/2 out of
(1/2 * sin(2t))^2 * csc(t)^2 costs the cancellation to cos(t)^2 .
Collection is a statement about polynomials, so it opens polynomials and leaves
anything carrying a function intact for the rules that do know it.
https://github.com/asc-community/AngouriMath/issues/855
it is also what stops a product cancelling as a whole -- lifting the 1/2 out of
Collection is a statement about polynomials, so it opens polynomials and leaves
anything carrying a function intact for the rules that do know it.
https://github.com/asc-community/AngouriMath/issues/855
Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 1953 pages online