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

This question already has an answer here:

Many counting formulas involving factorials can make sense for the case $n= 0$ if we define $0!=1 $; e.g., Catalan number and the number of trees with a given number of vetrices. Now here is my question:

If $A$ is an associative and commutative ring, then we can define an unary operation on the set of all the finite subsets of our ring, denoted by $+ \left(A\right) $ and $\times \left(A\right)$. While it is intuitive to define $+ \left( \emptyset \right) =0$, why should the product of zero number of elements be $1$? Does the fact that $0! =1$ have anything to do with 1 being the multiplication unity of integers?

share|cite|improve this question

marked as duplicate by J. M., vonbrand, azimut, Asaf Karagila, Davide Giraudo Apr 6 '13 at 12:58

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

In your question, where did this come from: "the product of zero number of elements be 1"? – NoChance Nov 1 '12 at 11:02 – Henry Nov 1 '12 at 16:56
up vote 39 down vote accepted

Here are two resons.

  1. We can define $n!$ to be the number of rearrangements of $n$ distinct objects in a list. The empty list has one rearrangement: itself.

  2. We can define $n!$ as the product of all positive integers $k$ with $1\le k \le n$. If $n$ is zero, we have an empty product. An empty product must be neutral for multiplication, so it must be 1.

Take your pick.

share|cite|improve this answer
Nice attempt! But I think that I have an easier answer: "Because there is only one way to do nothing". – Ali Abbasinasab Sep 6 '13 at 3:37

In general, we want the "associative" law to hold in the form: $$ \times(A \cup B) = (\times A) (\times B) $$ whenever $A$ and $B$ are disjoint. What would this mean when $B = \emptyset$ ??

share|cite|improve this answer
we want $\times\{(\times A),(\times B – user29743 Nov 7 '12 at 18:57

I think that the definition $0!=1$ is the one which makes most of the formulas work nicely.

For example $(n+1)!=n! (n+1)$ also works for $n=0$, as long as $0!=1$.

But most importantly, $\binom{n}{k}$ also works in the case $k=0$. Note that $\binom{n}{0}$ has to be $1$, if you want to have a nice formula for $(a+b)^n$. So for convenienceence, we define $\binom{n}{0}$ to be $1$, and if you want the binomial coefficient to be given by the standard formula, then $0!$ has to be 1.

share|cite|improve this answer

Multiplying by $1$ is the same as not multiplying by anything at all.

share|cite|improve this answer

As pointed out in one of the answers to this math.SX question, you can get the Gamma function as an extension of factorials, and then this falls out from it (though this isn't a very combinatorial answer).

share|cite|improve this answer

The most elementary way to understand is just to work backwards. If you start with a sum of several elements and subtract them one at a time, you get $0$ after you finish. If you start with a product of several elements and divide them out one at a time, you get $1$ after you finish. Instead of thinking of $0!$ as an empty product and getting all metaphysical, just think of it as nonempty product with all the terms factored out.

share|cite|improve this answer

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