Prove that.,
Answers
★ Concept :-
Here the concept of Permutations has been used. We see that we have to prove if 0! = 1. If we have studied Permutations and Combinations then we already know some formulas. First of the formula is the standard formula of Permutations and the other two formulas are derivatives of the number patterns. So let's prove this question using those three formulas.
Let's do it !!
______________________________________
★ Formula Used :-
______________________________________
★ Solution :-
Let's try proving the given expression by each formula mentioned here seperately.
-----------------------------------------------------------
~ Proof using first formula ::
We know that,
Let n = 1 and r = 1 here . So,
By defination of Permutations we know that r can never be greater than n . Here since r = n , so Permutation will also be 1 . So,
- Since 1! = 1
Hence, proved.
-----------------------------------------------------------
~ Proof using second formula ::
We know that,
- Let n = 0
- Since 1! = 1
Hence, proved .
-----------------------------------------------------------
~ Proof using third formula ::
We know that,
- Let n = 1
- Since 1! = 1
Hence, proved.
______________________________________
★ More to know :-
Answer:
Originally answered: how can I prove 0!=1
The factorial of a number is defined as:
= n! = n*(n-1)*(n-2)*(n-3)*...*1n !
= n*(n-1)*(n-2)*(n-3)*...*1
So,
5!=5*4*3*2*1 = 1250! = 5*4*3*2*1 = 120
4! = 4*3*2*1 = 244! = 4*3*2*1 = 24
Hence, it can be observed that:
n! = n*(n-1)! n! = n*(n-1)!
From this equation, substituting 1 from:
1! = 1*(1-1)! 1! 1! = 1
1! = 1*0! 1! = 1*0!
0! = 1/10! = 1/1
0! = 1
It's proved
Step-by-step explanation: