AngouriMath
Gcdf
Description
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.
Members
Codomain
PropertyDefaultCodomain
PropertyInitDirectChildren
MethodLatexizeNode
MethodNodeFirstChild
PropertyNodeSecondChild
PropertyReplace(System.Func{AngouriMath.Entity,AngouriMath.Entity})
MethodStringizeNode
MethodToString
Method
Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 4405 pages online