Mathematics - Permutation & Combination Question with Solution | TestHub
MathematicsPermutation & CombinationDearrangementMedium2 minQB
MathematicsMediummultiple choice
Let f(n) denote the number of ways in which n letters go into n envelops so that no letter is in the correct envelope, (where ), then
Options:(select one or more)
Answer:
A, C
Solution:
We know that
Stream:JEESubject:MathematicsTopic:Permutation & CombinationSubtopic:Dearrangement
⏱ 2mℹ️ Source: QB
Doubts & Discussion
Loading discussions...
