
Seven people leave their bags outside temple and while returning after worshiping the deity, picked one bag each at random. In how many ways at least one and at most three of them get their correct bags?
A. \[{}^7{C_3} \cdot 9 + {}^7{C_5} \cdot 44 + {}^7{C_1} \cdot 265\]
B. \[{}^7{C_6} \cdot 265 + {}^7{C_5} \cdot 9 + {}^7{C_7} \cdot 44\]
C. \[{}^7{C_5} \cdot 9 + {}^7{C_2} \cdot 44 + {}^7{C_1} \cdot 265\]
D. None of these
Answer
161.1k+ views
Hint: There will be three cases that need to be considered. First case one person can pick his correct bag. Second case two person can pick their correct bags. Third case three person pick their correct bags. Add the number of ways of the above case to get the correct answer.
Formula Used: The derangement formula for n objects is \[n!\left( {1 - \dfrac{1}{{1!}} + \dfrac{1}{{2!}} - \dfrac{1}{{3!}} + \cdots + \dfrac{1}{{n!}}} \right)\] when n is even. Or \[n!\left( {1 - \dfrac{1}{{1!}} + \dfrac{1}{{2!}} - \dfrac{1}{{3!}} + \cdots - \dfrac{1}{{n!}}} \right)\] when n is odd.
Complete step by step solution: There are three possible situations.
First case: only one person picks the correct bag and the rest are not.
Second case: Two persons pick the correct bag and the rest are not.
Third case: Three persons pick the correct bag and the rest are not.
First case:
The number of ways that one person picks the correct bag and the rest of the 6 are not is
\[{}^7{C_1} \times \]( derangement of 6 object)
\[ = {}^7{C_1} \times 6!\left( {1 - \dfrac{1}{{1!}} + \dfrac{1}{{2!}} - \dfrac{1}{{3!}} + \dfrac{1}{{4!}} - \dfrac{1}{{5!}} + \dfrac{1}{{6!}}} \right)\]
\[ = {}^7{C_1} \times 6!\left( {1 - 1 + \dfrac{1}{2} - \dfrac{1}{6} + \dfrac{1}{{24}} - \dfrac{1}{{120}} + \dfrac{1}{{720}}} \right)\]
\[ = {}^7{C_1} \times 6!\left( {\dfrac{{360 - 120 + 30 - 6 + 1}}{{720}}} \right)\]
\[ = {}^7{C_1} \times 6!\left( {\dfrac{{360 - 120 + 30 - 6 + 1}}{{720}}} \right)\]
\[ = {}^7{C_1} \cdot 6!\left( {\dfrac{{265}}{{720}}} \right)\]
\[ = {}^7{C_1} \times 265\]
second case:
The number of ways that two persons pick the correct bag and the rest of the 5 are not is
\[{}^7{C_2} \times \]( derangement of 5 object)
\[ = {}^7{C_2} \times 5!\left( {1 - \dfrac{1}{{1!}} + \dfrac{1}{{2!}} - \dfrac{1}{{3!}} + \dfrac{1}{{4!}} - \dfrac{1}{{5!}}} \right)\]
\[ = {}^7{C_2} \times 5!\left( {1 - 1 + \dfrac{1}{2} - \dfrac{1}{6} + \dfrac{1}{{24}} - \dfrac{1}{{120}}} \right)\]
\[ = {}^7{C_2} \times 5!\left( {\dfrac{{60 - 20 + 5 - 1}}{{5!}}} \right)\]
\[ = {}^7{C_2} \times 44\]
Third case:
The number of ways that three persons pick the correct bag and the rest of the 4 are not is
\[{}^7{C_3} \times \]( derangement of 4 object)
\[ = {}^7{C_3} \times 4!\left( {1 - \dfrac{1}{{1!}} + \dfrac{1}{{2!}} - \dfrac{1}{{3!}} + \dfrac{1}{{4!}}} \right)\]
\[ = {}^7{C_3} \times 4!\left( {1 - 1 + \dfrac{1}{2} - \dfrac{1}{6} + \dfrac{1}{{24}}} \right)\]
\[ = {}^7{C_3} \times 4!\left( {\dfrac{{12 - 4 + 1}}{{24}}} \right)\]
\[ = {}^7{C_3} \times 9\]
The total number of ways at least one and at most three of them get their correct bags is
\[ = {}^7{C_1} \times 265 + {}^7{C_2} \times 44 + {}^7{C_3} \times 9\]
Option ‘A’ is correct
Note: Students often do mistake to find the ways. They did not multiply derangement with the combination. Here we have to multiply derangement.
Formula Used: The derangement formula for n objects is \[n!\left( {1 - \dfrac{1}{{1!}} + \dfrac{1}{{2!}} - \dfrac{1}{{3!}} + \cdots + \dfrac{1}{{n!}}} \right)\] when n is even. Or \[n!\left( {1 - \dfrac{1}{{1!}} + \dfrac{1}{{2!}} - \dfrac{1}{{3!}} + \cdots - \dfrac{1}{{n!}}} \right)\] when n is odd.
Complete step by step solution: There are three possible situations.
First case: only one person picks the correct bag and the rest are not.
Second case: Two persons pick the correct bag and the rest are not.
Third case: Three persons pick the correct bag and the rest are not.
First case:
The number of ways that one person picks the correct bag and the rest of the 6 are not is
\[{}^7{C_1} \times \]( derangement of 6 object)
\[ = {}^7{C_1} \times 6!\left( {1 - \dfrac{1}{{1!}} + \dfrac{1}{{2!}} - \dfrac{1}{{3!}} + \dfrac{1}{{4!}} - \dfrac{1}{{5!}} + \dfrac{1}{{6!}}} \right)\]
\[ = {}^7{C_1} \times 6!\left( {1 - 1 + \dfrac{1}{2} - \dfrac{1}{6} + \dfrac{1}{{24}} - \dfrac{1}{{120}} + \dfrac{1}{{720}}} \right)\]
\[ = {}^7{C_1} \times 6!\left( {\dfrac{{360 - 120 + 30 - 6 + 1}}{{720}}} \right)\]
\[ = {}^7{C_1} \times 6!\left( {\dfrac{{360 - 120 + 30 - 6 + 1}}{{720}}} \right)\]
\[ = {}^7{C_1} \cdot 6!\left( {\dfrac{{265}}{{720}}} \right)\]
\[ = {}^7{C_1} \times 265\]
second case:
The number of ways that two persons pick the correct bag and the rest of the 5 are not is
\[{}^7{C_2} \times \]( derangement of 5 object)
\[ = {}^7{C_2} \times 5!\left( {1 - \dfrac{1}{{1!}} + \dfrac{1}{{2!}} - \dfrac{1}{{3!}} + \dfrac{1}{{4!}} - \dfrac{1}{{5!}}} \right)\]
\[ = {}^7{C_2} \times 5!\left( {1 - 1 + \dfrac{1}{2} - \dfrac{1}{6} + \dfrac{1}{{24}} - \dfrac{1}{{120}}} \right)\]
\[ = {}^7{C_2} \times 5!\left( {\dfrac{{60 - 20 + 5 - 1}}{{5!}}} \right)\]
\[ = {}^7{C_2} \times 44\]
Third case:
The number of ways that three persons pick the correct bag and the rest of the 4 are not is
\[{}^7{C_3} \times \]( derangement of 4 object)
\[ = {}^7{C_3} \times 4!\left( {1 - \dfrac{1}{{1!}} + \dfrac{1}{{2!}} - \dfrac{1}{{3!}} + \dfrac{1}{{4!}}} \right)\]
\[ = {}^7{C_3} \times 4!\left( {1 - 1 + \dfrac{1}{2} - \dfrac{1}{6} + \dfrac{1}{{24}}} \right)\]
\[ = {}^7{C_3} \times 4!\left( {\dfrac{{12 - 4 + 1}}{{24}}} \right)\]
\[ = {}^7{C_3} \times 9\]
The total number of ways at least one and at most three of them get their correct bags is
\[ = {}^7{C_1} \times 265 + {}^7{C_2} \times 44 + {}^7{C_3} \times 9\]
Option ‘A’ is correct
Note: Students often do mistake to find the ways. They did not multiply derangement with the combination. Here we have to multiply derangement.
Recently Updated Pages
If there are 25 railway stations on a railway line class 11 maths JEE_Main

Minimum area of the circle which touches the parabolas class 11 maths JEE_Main

Which of the following is the empty set A x x is a class 11 maths JEE_Main

The number of ways of selecting two squares on chessboard class 11 maths JEE_Main

Find the points common to the hyperbola 25x2 9y2 2-class-11-maths-JEE_Main

A box contains 6 balls which may be all of different class 11 maths JEE_Main

Trending doubts
JEE Main 2025 Session 2: Application Form (Out), Exam Dates (Released), Eligibility, & More

JEE Main 2025: Derivation of Equation of Trajectory in Physics

Electric Field Due to Uniformly Charged Ring for JEE Main 2025 - Formula and Derivation

Displacement-Time Graph and Velocity-Time Graph for JEE

Degree of Dissociation and Its Formula With Solved Example for JEE

Free Radical Substitution Mechanism of Alkanes for JEE Main 2025

Other Pages
JEE Advanced Marks vs Ranks 2025: Understanding Category-wise Qualifying Marks and Previous Year Cut-offs

JEE Advanced 2025: Dates, Registration, Syllabus, Eligibility Criteria and More

JEE Advanced Weightage 2025 Chapter-Wise for Physics, Maths and Chemistry

NCERT Solutions for Class 11 Maths Chapter 4 Complex Numbers and Quadratic Equations

NCERT Solutions for Class 11 Maths In Hindi Chapter 1 Sets

NCERT Solutions for Class 11 Maths Chapter 6 Permutations and Combinations
