Rising Factorial Calculator

x(x+1)(x+2)...(x+n-1)

CalculatorsFreeNo Signup
4.3(708 reviews)
All Tools

Loading tool...

About Rising Factorial Calculator

A rising factorial (Pochhammer symbol) calculator computing x^(n) = x(x+1)(x+2)...(x+n-1) = Γ(x+n)/Γ(x). Also computes falling factorial x_(n) = x(x-1)...(x-n+1). Essential for hypergeometric series, combinatorics, special functions. Client-side.

Rising Factorial Calculator Features

  • Rising x^(n)
  • Falling x_(n)
  • Step display
  • Gamma relation
  • Comparison
Rising factorial: x^(n) = x(x+1)...(x+n-1). Falling factorial: x_(n) = x(x-1)...(x-n+1). Rising = Pochhammer symbol in analysis. Falling = Pochhammer in combinatorics (confusing!). Both connect to Γ: x^(n)=Γ(x+n)/Γ(x). Fundamental in special functions.

How to Use

Enter x and n:

  • Rising: x^(n)
  • Falling: x_(n)
  • Expansion: Each factor

Key Connections

C(n,k) = n_(k)/k! (falling). Stirling numbers convert between ordinary and factorial powers. Hypergeometric series ₂F₁ uses ratios of Pochhammer symbols. Taylor series in finite calculus use falling factorials instead of ordinary powers.

Notation Warning

Confusingly: analysts write (x)_n for rising factorial. Combinatorialists write (x)_n for FALLING factorial. We use x^(n) for rising and (x)_n for falling to avoid ambiguity. Always check which convention an author uses!

Step-by-Step Instructions

  1. 1Enter x.
  2. 2Enter n.
  3. 3Compute rising.
  4. 4Compute falling.
  5. 5Compare.

Rising Factorial Calculator — Frequently Asked Questions

How do rising factorials connect to binomial coefficients?+

C(x,n) = x_(n)/n! = x(x-1)...(x-n+1)/n!. This uses the FALLING factorial. For rising: C(x+n-1,n) = x^(n)/n!. Both give elegant formulas for generalized binomial coefficients with non-integer x.

What are hypergeometric functions?+

₂F₁(a,b;c;z) = Σ (a)^(n)(b)^(n)/((c)^(n)·n!)·z^n. The ratios of rising factorials create a huge family of special functions including many classical ones: Legendre, Chebyshev, Jacobi polynomials are all special cases.

How do Stirling numbers convert between factorial types?+

x^n = Σ S(n,k)·x_(k) (Stirling second kind). x_(n) = Σ s(n,k)·x^k (Stirling first kind, signed). These conversion formulas are fundamental in combinatorics and the 'umbral calculus'.

Share this tool: