Derangement : Recursive Formula Proof | Dn=(n-1)(Dn-1+Dn-2) | Subfactorial | Left Factorial !n

This video explains all about Derangement and it's proof using recursive approach. This also explain How is it equal to Left Factorial or subfactorial

!n = Dn = (n-1)(Dn-1+Dn-2) = nDn-1 + (-1)^n

This is the second episode of #BeautyOfMathematics Series.
If you like the video don't forget to share and subscribe..!!

#Derangement #Subfactorial #LeftFactorial #MOIITJEE

You may follow these lectures too.

1) Basic Concepts of Mathematics
   • Basic Concepts of Mathematics - IIT-JEE (M...  

2) Solving Inequalities
   • Solving Inequality - IIT-JEE (Main & Advan...  

3) Logarithmic and Exponential Functions
   • Special Functions  

4) Quadratic Equations
   • Quadratic Equations - IIT-JEE (Main & Adva...  

5) Complex Numbers
   • Complex Numbers - IIT-JEE (Main & Advanced)  

6) Sequences and Series
   • Sequences and Series - IIT-JEE (Main & Adv...  

7) Video Solution for our daily Tasks
   • (For JEE 2021/22) Video Solution for our d...  

8) JEE MAIN 2018 Video Solution
   • JEE MAIN Video Solution by Sachin Gupta  

Videos copyright © MOIITJEE
Online Education Channel for IIT-JEE MAIN and ADVANCED, BITSAT, VITEEE, UPSEE and other various engineering entrance examination.

Have any query? Feel free to message/contact me . I dearly want to help.
Email - [email protected]
Keep share and support !
________________________________

Social Media Link :
👉 Facebook -   / moiitjee673  
👉 Twitter -   / moiitjee  
👉 Instagram -   / moiitjee  
👉 Quora - https://www.quora.com/Sachin-Gupta-629
👉 Unacademy - https://unacademy.com/@Sachinmath