AngouriMath
Navigation
#ctor(AngouriMath.Entity,AngouriMath.Entity)
Method (no overloads)
Summary
The least common multiple of two numbers: lcm(a, b) , non-negative by the same
convention as Gcdf, and0 where either is 0 . Over
rationalslcm(a/b, c/d) is lcm(a, c) / gcd(b, d) , which is what SymPy
gives. Left as this node where it cannot be settled.
https://github.com/asc-community/AngouriMath/issues/1409
convention as Gcdf, and
rationals
gives. Left as this node where it cannot be settled.
https://github.com/asc-community/AngouriMath/issues/1409
Angouri © 2019-2026 · Project's repo · Site's repo · Octicons · Transparency · 5057 pages online