Can You Prove That 0! Equals 1?

[Natasha1]

I was asked to prove 0! = 1?

Where do I start?

Is this possible? Any hints welcome...

 

[shmoe]

What is your definition for factorial?

(This is usually something that's included in the definition though sometimes not explicitly)

 

[Natasha1]

Well 3! is 3x2x1 = 6
2! is 2x1= 2
1! is 1x1 = 1 but 0?? haven't got a clue

 

[matt grime]

It's a definition that 0! is 1. If your teacher wishes for elucidation point them to these forums: there are plenty of reasons given in them. At best you can justify why 0!=1 is the most sensible option.

 

[shmoe]

Well 3! is 3x2x1 = 6
2! is 2x1= 2
1! is 1x1 = 1 but 0?? haven't got a clue

I see. I was naively hoping for something else. I suspect your teacher only told you what n! was when n is a positive integer. Take a look at:

https://www.physicsforums.com/showthread.php?t=99749&highlight=0!=1
https://www.physicsforums.com/showthread.php?t=54625&highlight=0!=1

and I'm sure many more threads for some of the reasons why we'd define 0! to be 1.

 

[Physics Monkey]

You can easily check (using integration by parts), that the following
<br /> n! = \int^\infty_0 dt\, t^n e^{-t} \equiv \Gamma (n+1),<br />
is true whenever n is a positive integer 1, 2, 3, etc. This integral is the definition of the so called gamma function \Gamma (z), and I would encourage you to check what I have said thus far. Now, since the gamma function reproduces the standard factorial for integer n, we could equivalently define the factorial to be this integral for integer n. However, this definition is nice because it immediately allows us to define the "factorial" of many more numbers, including zero. Using the definition above, what would 0! be?

You can also compute 0! hueristically by using n! = n(n-1)!, but this way still requires you to somehow extend your definition of factorial in order to be rigorous.

It boils down to a definition any way you slice it.

 

[benorin]

You can easily check (using integration by parts), that the following
<br /> n! = \int^\infty_0 dt\, t^n e^{-t} \equiv \Gamma (n+1),<br />
is true whenever n is a positive integer 1, 2, 3, etc. This integral is the definition of the so called gamma function \Gamma (z), and I would encourage you to check what I have said thus far. Now, since the gamma function reproduces the standard factorial for integer n, we could equivalently define the factorial to be this integral for integer n. However, this definition is nice because it immediately allows us to define the "factorial" of many more numbers, including zero. Using the definition above, what would 0! be?
You can also compute 0! hueristically by using n! = n(n-1)!, but this way still requires you to somehow extend your definition of factorial in order to be rigorous.
It boils down to a definition any way you slice it.

Well, hmmm . Given that there is an existence/uniqueness theorem for the gamma function, specifically the Bohr-Mollerup Theorem, one might say that the 'only' proper definition of 0! is 1. For the gamma funtion is the only function that interpolates the factorial and that is log-convex for postive arguements, has the functional equation \Gamma (z+1)=z\Gamma (z), and such that \Gamma (1)=1. But who cares about log-convexity anyway?

 

[Arman_AAT_Khos]

Factorials represent combinations of a set of objects. so 2 objects can be ordered 2 different ways, 3 objects can be ordered 6 different ways, etc... Matt is right 0! is defined as 1. Maybe you can entertain your teacher with this.

A: x! = (x) (x-1) (x-2) ... (x-(x-2)) (x-(x-1))
B: (x-1)! = (x-1) ((x-1)-1) ((x-1)-2) ... ((x-1)-((x-1)-2)) ((x-1)-(x-2))

B / A = (x-1)! / x! = 1 / x

for x = 1, B / A = 1

B / A = 0! / 1! = 0! / 1

 

[benorin]

0 objects can be ordered precisely 1 ways

Factorials represent combinations of a set of objects. so 2 objects can be ordered 2 different ways, 3 objects can be ordered 6 different ways, etc... Matt is right 0! is defined as 1.

Do you mean: 0 objects can be ordered precisely 1 ways, and hence 0!=1 ?

And it's permutations, not combinations, right?

 

[Arman_AAT_Khos]

Factorial only states the number of ways the entire set (all elements) can be arranged, the different possibilities, or combinations. For instance, if you have three keys in a hat, red=r, green=g, blue=b, there are six ways you can take them out; rgb, rbg, gbr, grb, brg, bgr. The arrangement of the set

Careful not to confuse it with Permutation and Combination, which involve arrangements of elements taken out of the set.

So yes, (ordered or unordered) there is 1 way to order 0 objects.

 

[benorin]

That works.