Pochhammer
The rising factorial (a)_n = a(a+1)(a+2)…(a+n−1).
✓ checked against that system · ! checked, with disagreements (hover a chip)Wikipedia
Falling and rising factorialsMathWorldPochhammerSymbolWikidataQ2339261DLMF5.2FungrimRisingFactorialWolfram LanguagePochhammer✓Pochhammer(a, n)the rising factorial .SageMath
rising_factorial(a, n)SymPyrf(a, n)mpmathrf(a, n)Juliaenumeratio_ball(_rising, a, n)Typed signatures
| Type | Package | Applies |
|---|---|---|
(complex | infinity, complex | infinity) -> number | compute-engine | always |
(complex | infinity, complex | infinity) -> number | number-theoryreplaces compute-engine | always |
Details
- Closed form via the Gamma function: .
- , since the rising factorial from 1 just counts up to n.
- Negative order gives the falling reciprocal: .
- Dividing by counts multisets: .
- If a is a non-positive integer with , the product picks up a zero factor and vanishes.
- A building block of hypergeometric series, where it appears in both numerator and denominator terms.
Plot
Examples
1 more kept as data, checked against the oraclesAbout
| Examples | 24 |
|---|---|
| Checked against | Wolfram Language 24 agreeSageMath 22 agree2 errorSymPy 24 agreempmath 20 agreemathlib4 8 agree9 errorJulia 20 agree |
| Crosswalk | WikipediaMathWorldWikidataDLMFFungrimWolfram 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.ascFactorial n k = n(n+1)...(n+k-1) since Mathlib's 2024 redefinition; natural arguments only, so a rational, real or negative argument fails to typecheck.