SOLVER7 Study. Nothing Else.
Exercise 6.4 Q9

In how many ways can a student choose a programme of \(5\) courses if \(9\) courses are available and \(2\) specific courses are compulsory for every student \(?\)

CBSE Class 11 Maths · Permutations and Combinations

Solution

👶 Simple Explanation

Simple Explanation

Imagine picking 5 toppings for a pizza, but the chef already puts cheese and sauce on every pizza. So you only pick 3 more toppings yourself. There are 7 other toppings left to choose from. You count all the different groups of 3 you can pick from those 7. That counting gives you 35 different combinations. The locked-in toppings do not need choosing — only the free ones matter.

Answer: The student can choose the programme in \( 35 \) ways.

📖 Choosing 5 Courses with 2 Compulsory

Detailed Explanation

This is a selection problem, so we use combinations because the order in which the courses are chosen does not matter. The key idea is that when some items are compulsory, they are automatically included and take up part of the required total. So we do not choose them again. We only need to count the ways of selecting the remaining courses from the remaining available ones. Here, 2 out of the 5 courses are already fixed as compulsory, so we only need to choose the other 3 courses from the courses that are not compulsory.

Formula Used

\[ {}^{n}C_{r} = \frac{n!}{r!\,(n - r)!} \]

Solution

  1. Step 1: Total courses available are \( 9 \), and the student must choose \( 5 \) courses. Out of these, \( 2 \) specific courses are compulsory, so they are always part of the chosen programme.
  2. Step 2: Since \( 2 \) courses are already fixed, the number of courses still to be chosen is \( 5 - 2 = 3 \).
  3. Step 3: These \( 3 \) courses must come from the remaining courses. Since \( 2 \) are already used, the courses left to choose from are \( 9 - 2 = 7 \).
  4. Step 4: So we must select \( 3 \) courses out of \( 7 \). The number of ways is \( {}^{7}C_{3} \).
  5. Step 5: Apply the combination formula: \[ {}^{7}C_{3} = \frac{7!}{3!\,(7 - 3)!} = \frac{7!}{3!\,4!} \]
  6. Step 6: Simplify the expression: \[ {}^{7}C_{3} = \frac{7 \times 6 \times 5}{3 \times 2 \times 1} = \frac{210}{6} = 35 \]

Final Answer

The student can choose the programme in \( 35 \) ways.

Common Mistake

A common mistake is computing \( {}^{9}C_{5} \) and ignoring the compulsory courses. Because 2 courses are fixed, you must subtract them from both the total available and the number to be chosen, giving \( {}^{7}C_{3} \), not \( {}^{9}C_{5} \).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the given information: there are \( 9 \) courses in total, a student must select \( 5 \) courses, and \( 2 \) of those \( 5 \) are compulsory. — Reason: Listing the known values clearly prevents confusion when setting up the counting problem.
  2. Step 2: Since the \( 2 \) compulsory courses are always included, calculate how many more courses still need to be chosen: \[5 - 2 = 3\] — Reason: The compulsory courses fill \( 2 \) of the \( 5 \) required slots, leaving only \( 3 \) slots to be filled by free choice.
  3. Step 3: Find how many courses are available for free selection by removing the \( 2 \) compulsory ones from the total: \[9 - 2 = 7\] — Reason: The compulsory courses are already accounted for, so the student picks the remaining \( 3 \) courses only from the \( 7 \) courses that are not compulsory.
  4. Step 4: Set up the combination: the number of ways to choose \( 3 \) courses from \( 7 \) is \( {}^{7}C_{3} \). — Reason: Order of selection does not matter here (a programme is the same regardless of the order the courses are listed), so combinations are appropriate.
  5. Step 5: Apply the combination formula: \[{}^{7}C_{3} = \frac{7!}{3!\,(7 - 3)!} = \frac{7!}{3!\,4!}\] — Reason: Substituting \( n = 7 \) and \( r = 3 \) into the formula expands the expression so it can be simplified numerically.
  6. Step 6: Simplify by cancelling the \( 4! \) from the numerator and denominator, then evaluate: \[\frac{7 \times 6 \times 5}{3 \times 2 \times 1} = \frac{210}{6} = 35\] — Reason: Only the top three factors of \( 7! \) survive after cancellation, making the arithmetic straightforward.

Final Answer

The student can choose the programme in \( 35 \) ways.

Common Mistake

One common mistake: students forget to subtract the compulsory courses from both the total number of courses available and the number of courses to be chosen, and mistakenly compute \( {}^{9}C_{5} \) instead of \( {}^{7}C_{3} \), which gives the wrong answer.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: 2 compulsory courses are fixed; remaining courses to choose: \( 5 - 2 = 3 \) from \( 9 - 2 = 7 \) courses.
  2. Step 2: Number of ways \( = {}^{7}C_{3} = \frac{7!}{3!\,4!} = \frac{7 \times 6 \times 5}{3 \times 2 \times 1} = \frac{210}{6} = 35 \)

Answer: The student can choose the programme in \( 35 \) ways.

➕ More Examples

More Examples

Example 1

Question: A student must select 6 subjects from 12 available subjects for an examination. If 3 specific subjects are compulsory for every student, in how many ways can the student make the selection?

Solution: Since 3 subjects are compulsory, they are automatically included in every student's selection. The student has already chosen 3 subjects, so the remaining number of subjects to be chosen is \( 6 - 3 = 3 \). The number of subjects left to choose from is \( 12 - 3 = 9 \). The number of ways to choose 3 subjects from the remaining 9 subjects is: \[ {}^{9}C_{3} = \frac{9!}{3! \cdot (9-3)!} = \frac{9!}{3! \cdot 6!} \] Expanding the numerator partially: \[ {}^{9}C_{3} = \frac{9 \times 8 \times 7}{3 \times 2 \times 1} = \frac{504}{6} = 84 \] Therefore, the student can make the selection in 84 ways.

Answer: 84 ways

Example 2

Question: A club committee of 7 members is to be formed from 11 candidates. If 2 particular candidates must always be included in the committee, in how many ways can the committee be formed?

Solution: Since 2 particular candidates must always be included, they are fixed members of the committee. The number of remaining members to be selected is \( 7 - 2 = 5 \). The number of candidates left to choose from is \( 11 - 2 = 9 \). The number of ways to choose 5 members from the remaining 9 candidates is: \[ {}^{9}C_{5} = \frac{9!}{5! \cdot (9-5)!} = \frac{9!}{5! \cdot 4!} \] Expanding: \[ {}^{9}C_{5} = \frac{9 \times 8 \times 7 \times 6}{4 \times 3 \times 2 \times 1} = \frac{3024}{24} = 126 \] Therefore, the committee can be formed in 126 ways.

Answer: 126 ways

🎯 Try a Similar Question

Try a Similar Question

Question: A student must select 6 courses from a list of 12 available courses to complete a semester programme. If 3 specific courses are compulsory for every student, in how many ways can the student choose the programme?

Solution

  1. Step 1: Identify Compulsory and Remaining Courses: Out of 12 available courses, 3 are compulsory and must always be included. So every student has already filled 3 spots in the programme of 6 courses.
  2. Step 2: Find the Number of Courses Still to be Chosen: After fixing the 3 compulsory courses, the number of remaining courses to be chosen is \( 6 - 3 = 3 \).
  3. Step 3: Find the Pool of Courses to Choose From: After removing the 3 compulsory courses from the list, the number of remaining available courses is \( 12 - 3 = 9 \).
  4. Step 4: Apply the Combinations Formula: The number of ways to choose 3 courses from the remaining 9 is \( {}^{9}C_{3} \). Computing this: \[ {}^{9}C_{3} = \frac{9!}{3! \times 6!} = \frac{9 \times 8 \times 7}{3 \times 2 \times 1} = \frac{504}{6} = 84 \]
  5. Step 5: State the Final Answer: Therefore, the student can choose the programme in \( 84 \) ways.

Answer: The student can choose the programme in \( 84 \) ways.

Everything you get with Solver7

More questions in Permutations and Combinations