Consider the problem of defining a continuous function f(x) which agrees with factorials at integers. There are many possible ways to do this. In fact, such a function can be constructed by taking any continuous definition of f(x) on [0,1] with f(0) = f(1) = 1 (such as f(x) = 1), and then extending the definition to all x > 1 by the formula f(x + 1) = (x + 1)f(x). This construction was discussed by David Fowler in  and . For example, the choice f(x) = ½x(x − 1) + 1 results in a function that is differentiable everywhere, including at integers.
However, this approach had already been overtaken in 1729, when Euler obtained the conclusive solution to the problem by defining what we now call the gamma function. Among all the possible functions that reproduce factorials, this is the ‘right’ one, in the sense that it is the only one satisfying a certain smoothness condition which we will specify below. Admittedly, Euler didn't know this. It is known as the Bohr-Mollerup theorem, and was only proved nearly two centuries later.
First, a remark on notation: the notation Γ (x) for the gamma function, introduced by Legendre, is such that Γ (n) is actually (n − 1)! instead of n!. Though this might seem a little perverse, it does result in some formulae becoming slightly neater. Some writers, including Fowler, write x! for Γ (x + 1), and refer to this as the ‘factorial function’. However, the notation Γ (x) is very firmly entrenched, and I will adhere to it here.