FallingFactorial
The falling factorial -- Wolfram's own FactorialPower(x, n).
✓ checked against that system · ! checked, with disagreements (hover a chip)Fungrim
FallingFactorial✓Fungrim entry1d5e92355c22✓5b414d✓a7b330✓e78989✓Wolfram LanguageFactorialPower✓FallingFactorial(x, n)exact for an integer x and n, numeric otherwiseSageMath
falling_factorial(x, n)SymPyff(x, n)mpmathff(x, n)Juliaenumeratio_ball((a, n) -> _rising(a - n + 1, n), x, n)Typed signatures
| Type | Package | Applies |
|---|---|---|
(number, number) -> number | analytic | always |
Plot
Examples
About
| Examples | 13 |
|---|---|
| Checked against | Wolfram Language 11 agree2 unevaluatedSageMath 10 agreeSymPy 10 agreempmath 6 agreemathlib4 5 agree1 errorJulia 6 agree |
| Crosswalk | FungrimFungrim entry ×5Wolfram LanguageSageMathSymPympmathJulia |
Implementation
mapped
sympypackages/oracle/src/mappings.tsmapped
mpmathpackages/oracle/src/mappings.tsmapped
sagepackages/oracle/src/mappings.tsmapped
juliapackages/oracle/src/mappings.tsmapped
mathlib4packages/oracle/src/mappings.tsNat.descFactorial n k = n(n-1)...(n-k+1), which is 0 for k > n like the product through 0; natural arguments only.
See also: RisingFactorial