AngouriMath
Gcd(AngouriMath.Entity,AngouriMath.Entity)
Method (no overloads)
Summary
The greatest common divisor of a and b .
Parameter "a"
The first argument.
Parameter "b"
The second argument.
Returns
The gcd where it can be computed, the unevaluated node otherwise.
Remarks
Integers and rationals are computed — gcd(1/2, 1/3) is 1/6 , as
SymPy gives. The polynomial case is left unevaluated for now, though this library
does compute polynomial gcds elsewhere.
SymPy gives. The polynomial case is left unevaluated for now, though this library
does compute polynomial gcds elsewhere.
Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 1953 pages online