AngouriMath
Binomial(AngouriMath.Entity,AngouriMath.Entity)
Method (no overloads)
Summary
The binomial coefficient binomial(n, k) , "n choose k"
Parameter "n"
The upper argument, which need not be a whole number
Parameter "k"
The lower argument
Returns
The Binomialf node
Remarks
Whole arguments are computed, by the falling factorial where n is negative --
binomial(-1, 3) is -1 -- and a whole k below zero, or above a
non-negative wholen , is 0 . A symbolic argument is kept as the node,
which is the shape Pascal's identity and the binomial theorem read.
https://github.com/asc-community/AngouriMath/issues/1409
non-negative whole
which is the shape Pascal's identity and the binomial theorem read.
https://github.com/asc-community/AngouriMath/issues/1409
Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 4378 pages online