Question

0=1 i have proof. Do you?

Answer 1

Logical Proof/ Solution:Factorial is number of possibilities of arrangements for number of things.

In simple words, in how many different ways can you arrange three different poker chips on a table? Answers is 6. Suppose we have red, green and blue chips, here are the possible ways:

RGB, RBG, GRB, GBR, BRG, BGR

For every possible solution, the table face would look different.

And to find the answer mathematically, you just simply solve 3! which is 3x2x1= 6

Now what if you have 0 items? In how many different ways, can you change the table face? That's only one. Yes you don't have any chips so the table face

would remain the same way.

Mathematical Proof/Solution:

n! = n*(n-1)!

heck my notes for detailed proof:

n != n* (n-1)!

: (n-1) ! = $\{n1}{n}$

(1-1)! =$\{1!}{1}$ (if n = 1)

0 != 1

Please don't go any further than zero. You can never have negative items. (Like you can't have -3 cell phones, unless you owe someone, and in that case you should return those cell phones first) Idea of factorial is to find the possible arrangements of items, so it will always be positive intege