Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

The falling factorial is defined as:

$$x^\underline n = \prod_{k=0}^{n-1}(x-k),\quad n\in\mathbb N$$

It can be used to define the binomial:

$$\binom n k = \frac{n^\underline k}{k!}$$

And it satisfies identities for discrete differential calculus as $x^a$ does for continuous differential calculus. $\Delta$ is the difference operator $\left(\Delta a_n = \frac{a_{n+1}-a_n}1\right)\colon$

$$\Delta x^\underline k = kx^\underline{k-1}.$$

One can easily find a reasonable generalization for arbitrary $n\in\mathbb Z$, but I wasn't able to come up with a generalization for $n\in\mathbb R$ or even $n\in\mathbb C$. Is there one?

share|cite|improve this question
up vote 5 down vote accepted

The gamma function naturally generalizes the factorial to complex values. It satisfies the functional equation $x\Gamma(x)=\Gamma(x+1)$ for any $x$ (when both sides exist anyway). Hence


by induction. Divide by the $\Gamma$ on the left and we're done.

share|cite|improve this answer

$$ x^\underline n = \prod_{k=0}^{n-1}(x-k)= \frac{\Gamma(x+1)}{\Gamma(x+1-n)} $$

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.