SOLVER7 Study. Nothing Else.
Exercise 6.4 Q1

If \(^nC_8=^nC2,\ \) find \(^nC_2.\)

CBSE Class 11 Maths · Permutations and Combinations

Solution

👶 Simple Explanation

Simple Explanation

Imagine choosing team members from a group. Picking 8 people is the same as leaving out 2 people — you get the same teams! So when \( {}^{n}C_{8} = {}^{n}C_{2} \), the group must have exactly \( 8 + 2 = 10 \) people total. That gives us \( n = 10 \). Now finding \( {}^{10}C_{2} \) is like counting all possible pairs from 10 people — multiply \( 10 \times 9 \) and halve it, because each pair gets counted twice. The answer comes out to 45 pairs.

Answer: \( n = 10 \) and \( {}^{n}C_{2} = {}^{10}C_{2} = 45 \).

📖 Solving nC8 = nC2 to Find nC2

Detailed Explanation

In combinations, there is a very useful property: if \( {}^{n}C_{a} = {}^{n}C_{b} \), then either \( a = b \) or \( a + b = n \). This happens because choosing \( r \) items out of \( n \) is the same as leaving out \( n - r \) items, which gives the identity \( {}^{n}C_{r} = {}^{n}C_{n-r} \). So when the two lower indices are different but the combinations are equal, their sum must equal \( n \). Here we are given \( {}^{n}C_{8} = {}^{n}C_{2} \). Since \( 8 \ne 2 \), we use the second condition to find \( n \), and then compute \( {}^{n}C_{2} \).

Formula Used

\( {}^{n}C_{r} = {}^{n}C_{n-r} \), and if \( {}^{n}C_{a} = {}^{n}C_{b} \) with \( a \ne b \), then \( a + b = n \). Also \( {}^{n}C_{r} = \dfrac{n!}{r!(n-r)!} \).

Solution

  1. Step 1: We are given \( {}^{n}C_{8} = {}^{n}C_{2} \). Compare the two lower indices: they are \( 8 \) and \( 2 \), which are not equal.
  2. Step 2: Apply the property: if \( {}^{n}C_{a} = {}^{n}C_{b} \) and \( a \ne b \), then \( a + b = n \). Here \( a = 8 \) and \( b = 2 \), so \( n = 8 + 2 \).
  3. Step 3: Therefore \( n = 10 \).
  4. Step 4: Now compute \( {}^{n}C_{2} = {}^{10}C_{2} \) using \( {}^{n}C_{r} = \dfrac{n!}{r!(n-r)!} \). This gives \[ {}^{10}C_{2} = \frac{10!}{2!\,8!} = \frac{10 \times 9}{2 \times 1}. \]
  5. Step 5: Simplify: \[ {}^{10}C_{2} = \frac{90}{2} = 45. \]

Final Answer

\( n = 10 \) and \( {}^{n}C_{2} = {}^{10}C_{2} = 45 \).

Common Mistake

A common mistake is to set \( 8 = 2 \) (impossible) and give up, or to wrongly conclude \( n = 8 - 2 = 6 \). Remember the correct rule is \( a + b = n \) when the indices differ, so \( n = 8 + 2 = 10 \).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Write down the given condition: \( {}^{n}C_{8} = {}^{n}C_{2} \). — Reason: Identifying what is given helps us decide which property of combinations to apply.
  2. Step 2: Compare the two lower indices: \( 8 \) and \( 2 \). Since \( 8 \ne 2 \), the indices are unequal. — Reason: The property \( {}^{n}C_{r} = {}^{n}C_{n-r} \) tells us that equal combinations with different indices must satisfy \( a + b = n \); we first confirm \( a \ne b \) before applying this.
  3. Step 3: Apply the property: because \( {}^{n}C_{8} = {}^{n}C_{2} \) and \( 8 \ne 2 \), we must have \( 8 + 2 = n \). — Reason: This is the second case of the equality rule — when the two lower indices are different, their sum equals the upper index \( n \).
  4. Step 4: Solve for \( n \): \[ n = 8 + 2 = 10 \] — Reason: Simple arithmetic gives us the value of \( n \) directly.
  5. Step 5: Substitute \( n = 10 \) into the combination formula to evaluate \( {}^{n}C_{2} \): \[ {}^{10}C_{2} = \frac{10!}{2! \times 8!} \] — Reason: We use the standard formula \( {}^{n}C_{r} = \dfrac{n!}{r!\,(n-r)!} \) with \( n = 10 \) and \( r = 2 \).
  6. Step 6: Simplify by cancelling \( 8! \) from numerator and denominator: \[ {}^{10}C_{2} = \frac{10 \times 9 \times 8!}{2 \times 1 \times 8!} = \frac{10 \times 9}{2 \times 1} = \frac{90}{2} = 45 \] — Reason: The factorial in the numerator expands as \( 10! = 10 \times 9 \times 8! \), so \( 8! \) cancels, leaving a straightforward multiplication and division.

Final Answer

\( n = 10 \) and \( {}^{n}C_{2} = {}^{10}C_{2} = 45 \).

Common Mistake

One common mistake: Students sometimes conclude \( n = 8 \) by setting \( {}^{n}C_{8} = {}^{n}C_{2} \) and mistakenly writing \( n - 8 = 2 \) (i.e. \( n = 10 \) is correct, but they might subtract instead of add the indices), or they forget to check \( a \ne b \) before applying the rule \( a + b = n \).

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Given \( {}^{n}C_{8} = {}^{n}C_{2} \) with \( 8 \ne 2 \), so \( n = 8 + 2 = 10 \).
  2. Step 2: \( {}^{10}C_{2} = \dfrac{10!}{2!\,8!} = \dfrac{10 \times 9}{2 \times 1} = \dfrac{90}{2} = 45 \).

Answer: \( n = 10 \) and \( {}^{n}C_{2} = {}^{10}C_{2} = 45 \).

➕ More Examples

More Examples

Example 1

Question: If \( {}^{n}C_{12} = {}^{n}C_{4} \), find \( {}^{n}C_{3} \).

Solution: We are given \( {}^{n}C_{12} = {}^{n}C_{4} \). Using the property: if \( {}^{n}C_{r} = {}^{n}C_{s} \) then either \( r = s \) or \( r + s = n \). Here \( r = 12 \) and \( s = 4 \). Since \( 12 \ne 4 \), we use the second condition: \[ 12 + 4 = n \] So \( n = 16 \). Now we compute \( {}^{16}C_{3} \): \[ {}^{16}C_{3} = \frac{16!}{3! \cdot 13!} \] \[ = \frac{16 \times 15 \times 14}{3 \times 2 \times 1} \] \[ = \frac{3360}{6} \] \[ = 560 \]

Answer: \( {}^{n}C_{3} = 560 \)

Example 2

Question: If \( {}^{n}C_{5} = {}^{n}C_{7} \), find the value of \( {}^{n}C_{4} \).

Solution: We are given \( {}^{n}C_{5} = {}^{n}C_{7} \). Using the property: if \( {}^{n}C_{r} = {}^{n}C_{s} \) then either \( r = s \) or \( r + s = n \). Here \( r = 5 \) and \( s = 7 \). Since \( 5 \ne 7 \), we use: \[ 5 + 7 = n \] So \( n = 12 \). Now we compute \( {}^{12}C_{4} \): \[ {}^{12}C_{4} = \frac{12!}{4! \cdot 8!} \] \[ = \frac{12 \times 11 \times 10 \times 9}{4 \times 3 \times 2 \times 1} \] \[ = \frac{11880}{24} \] \[ = 495 \]

Answer: \( {}^{n}C_{4} = 495 \)

🎯 Try a Similar Question

Try a Similar Question

Question: If \( {}^{n}C_{9} = {}^{n}C_{3} \), find \( {}^{n}C_{6} \).

Solution

  1. Step 1: Apply the key property of combinations: We know that if \( {}^{n}C_{r} = {}^{n}C_{s} \) and \( r \ne s \), then \( r + s = n \). Here, \( {}^{n}C_{9} = {}^{n}C_{3} \) and \( 9 \ne 3 \), so we use \( r + s = n \).
  2. Step 2: Find the value of n: Setting \( r = 9 \) and \( s = 3 \): \[ n = 9 + 3 = 12 \]
  3. Step 3: Compute the required combination: We need to find \( {}^{n}C_{6} = {}^{12}C_{6} \). Using the formula: \[ {}^{12}C_{6} = \frac{12!}{6! \cdot 6!} \]
  4. Step 4: Expand and simplify: Expanding the numerator and cancelling: \[ {}^{12}C_{6} = \frac{12 \times 11 \times 10 \times 9 \times 8 \times 7}{6!} \] Now, \( 6! = 720 \), so: \[ {}^{12}C_{6} = \frac{12 \times 11 \times 10 \times 9 \times 8 \times 7}{720} \]
  5. Step 5: Calculate the numerator and divide: Computing step by step: \( 12 \times 11 = 132 \), \( 132 \times 10 = 1320 \), \( 1320 \times 9 = 11880 \), \( 11880 \times 8 = 95040 \), \( 95040 \times 7 = 665280 \). Therefore: \[ {}^{12}C_{6} = \frac{665280}{720} = 924 \]

Answer: \( n = 12 \) and \( {}^{12}C_{6} = 924 \).

Everything you get with Solver7

More questions in Permutations and Combinations