English Deutsch Français Italiano Español Português 繁體中文 Bahasa Indonesia Tiếng Việt ภาษาไทย
All categories

2006-10-05 19:23:24 · 13 answers · asked by arch 1 in Science & Mathematics Mathematics

13 answers

It is assumed so to overcome some situations.
According to theory of p[ermutation arrangment of 'n' objects canbe done in n! ways. Suppose we have 10 objects. Number of
ways of arranging no objects can be done only in one way(dont arrange)
Using permutation, no:=0! which is equal to 1 by meaning

2006-10-05 19:35:55 · answer #1 · answered by Anonymous · 0 0

the factorial of 1 is 1. the factorial of 0 is 1.

2006-10-05 23:26:06 · answer #2 · answered by Sid 2 · 0 0

Well, you can't figure it from first principles, but you do need 0! to equal 1 to be consistent with the definitions.
Let's work backward from 3!:

3!=2!x3=6

2!=1!x2=2

1!=0! x 1 = 1

Look at that last equation: 1 times something (0!) equals 1. So what does that something (0!) have to be? One (exclamation point, not factorial sign here).

2006-10-05 20:08:05 · answer #3 · answered by James F 3 · 0 0

its 0

2006-10-05 19:26:32 · answer #4 · answered by Anonymous · 0 1

In math, never accept answers like "because it's defined that way." Math has to make sense and all hang together. Things like 0! aren't just defined to make things convenient. They are derived.

There is a function called the Gamma function that extends the notion of factorials to numbers besides the integers. Related to the Gamma function is the integral equality:

(Integration from t=0 to infinity)(e^(-t)*t^n*dt) = n!

This function requires multiple integrations by parts to be evaluated but it does evaluate to n! for all positive integers. For the case n=0 it evaluates to 1. Since the function works for all positive integers, the value it returns for n=0 must be right as well. This defines 0! = 1.

For what its worth, the factorial of any negative integer is undefined and this integral shows that as well.

2006-10-05 20:30:24 · answer #5 · answered by Pretzels 5 · 0 0

It is a convention; 0! is defined as 1. The reasons are mathematical:

The recursive definition of a factorial, (n + 1)! = n! × (n + 1) works for n = 0;

This definition makes many identities in combinatorics valid for zero sizes. In particular, the number of arrangments or permutations of an empty set is just one

2006-10-05 19:32:30 · answer #6 · answered by gp4rts 7 · 1 0

we can see the sequence here...
4! = 5!/5 = 120/5 = 24.
3! = 4!/4 = 24/4 = 6
2! = 3!/3 = 6/3 = 2
1! = 2!/2 = 2/2 = 1
0! = 1!/1 = 1/1 = 1
The sequence gives 0!=1

2015-02-26 02:02:41 · answer #7 · answered by mayur 1 · 0 0

e = 1/0! + 1/1! + 1/2! + 1/3! + ... .
If you define 0! = 1! = 1 then e is really 2.71828...,
the base of the natural logarithm.

Th

2006-10-05 19:47:03 · answer #8 · answered by Thermo 6 · 0 0

0! = 1 and 1! = 1. for prove refer any good text maths

2006-10-05 19:33:28 · answer #9 · answered by mr_BIG 3 · 0 0

We know that,
1! =1
or, 1(1-1)!=1 since,n! = n(n-1)!
or, 1.0!=1
or, 0!=1.

2006-10-05 21:14:49 · answer #10 · answered by rohit 1 · 0 0

fedest.com, questions and answers