AngouriMath
Navigation
QuotientOfFactorials(AngouriMath.Entity.Number.Complex[],AngouriMath.Entity.Number.Complex[])
Method (no overloads)
Summary
The product of the factorials of over over that of under ,
numerically, or null where one of them has no value. Each factorial and the quotient are
taken at the caller's precision with no bound on the exponent, and rounded into the
caller's context only at the end: the factorials leave its range long before the quotient
does, and in itbinomial(10000, 1.43) was +oo/+oo , which is NaN , where
it is about 414190. A whole number is taken as a decimal, whose factorial is not built
exactly once it is large. Real arguments are taken as decimals throughout: a complex
product adds a zero imaginary part's terms, and adding to a number whose exponent is in
the millions aligns the two digit by digit, which madebinomial(10000000, 1.43) take longer than twenty seconds. The quotient is made as one that cancels nothing, and is
never rounded onto zero: made as any number, a value under the downcasting tolerance was
taken for a residual, andfallingfactorial(0.5, -100.5) , 9.4e-161, was 0 .
numerically, or null where one of them has no value. Each factorial and the quotient are
taken at the caller's precision with no bound on the exponent, and rounded into the
caller's context only at the end: the factorials leave its range long before the quotient
does, and in it
it is about 414190. A whole number is taken as a decimal, whose factorial is not built
exactly once it is large. Real arguments are taken as decimals throughout: a complex
product adds a zero imaginary part's terms, and adding to a number whose exponent is in
the millions aligns the two digit by digit, which made
never rounded onto zero: made as any number, a value under the downcasting tolerance was
taken for a residual, and
Angouri © 2019-2026 · Project's repo · Site's repo · Octicons · Transparency · 5629 pages online