AngouriMath
Navigation
#ctor(AngouriMath.Entity,AngouriMath.Entity)
Method (no overloads)
Summary
A node of gcd: the greatest common divisor of its two arguments.
Remarks
Not integers only. SymPy's gcd is the polynomial gcd with the integer case
as a special case, and this library already computes one — see
PolynomialGcd, which the
PolynomialGcdCancellation rule set uses. What cannot be settled is left as
this node rather than guessed at.
as a special case, and this library already computes one — see
PolynomialGcd, which the
this node rather than guessed at.
Angouri © 2019-2026 · Project's repo · Site's repo · Octicons · Transparency · 5057 pages online