AngouriMath
WithThePrimitiveDenominator(AngouriMath.Entity)
Method (no overloads)
Summary
up: the denominator's coefficients whole and coprime with a positive leading one,
and the numerator scaled by what that took out.
Remarks
The polynomial gcd normalizes its divisor to whole coprime coefficients, so it
never cancels a number, and two sides without a variable in common are coprime to
it before it looks. Newton's iteration for the inverse modulo a power of a
quadratic squares its iterate every round, and an uncancelled1024/1024 after the first round was integers of twelve hundred digits after the third and
a minute of gcd on them fortanh(x)^6/(a + a sech(x)) , which is a sum of
small fractions.
https://github.com/asc-community/AngouriMath/issues/718
never cancels a number, and two sides without a variable in common are coprime to
it before it looks. Newton's iteration for the inverse modulo a power of a
quadratic squares its iterate every round, and an uncancelled
a minute of gcd on them for
small fractions.
https://github.com/asc-community/AngouriMath/issues/718
Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 4378 pages online