Related Formula
Combinations: ⁿCᵣ = (n!)/(r!(n-r)!)$$\text{Combinations: } {}^nC_r = \frac{n!}{r!(n-r)!}$$
Core Logic
Total Questions = 20 (A: 8, B: 6, C: 6).
Total to attempt = 15.
Minimum required from each section = 4.
Base attempt gives: 4 (from A) + 4 (from B) + 4 (from C) = 12$4 (\text{from A}) + 4 (\text{from B}) + 4 (\text{from C}) = 12$ questions.
We have to distribute the remaining 15 - 12 = 3$15 - 12 = 3$ questions across the sections A, B, and C.
Let the additional questions picked be x, y, z$x, y, z$ for sections A, B, C respectively.
Then x + y + z = 3$x + y + z = 3$, with constraints based on the maximum questions per section:
A max extra = 8 - 4 = 4 ⇒ x ≤ 4$8 - 4 = 4 \Rightarrow x \le 4$
B max extra = 6 - 4 = 2 ⇒ y ≤ 2$6 - 4 = 2 \Rightarrow y \le 2$
C max extra = 6 - 4 = 2 ⇒ z ≤ 2$6 - 4 = 2 \Rightarrow z \le 2$
Step 1: Identifying Valid Selection Cases
The possible sets of (x, y, z)$(x, y, z)$ are:
Case 1: (1, 1, 1)$(1, 1, 1)$ ⇒$\Rightarrow$ Total picks: A(5), B(5), C(5)
Case 2: (2, 1, 0)$(2, 1, 0)$ and its permutations (respecting constraints).
Valid permutations:
- A gets 2, B gets 1, C gets 0 ⇒$\Rightarrow$ A(6), B(5), C(4)
- A gets 2, C gets 1, B gets 0 ⇒$\Rightarrow$ A(6), B(4), C(5)
- B gets 2, A gets 1, C gets 0 ⇒$\Rightarrow$ A(5), B(6), C(4)
- C gets 2, A gets 1, B gets 0 ⇒$\Rightarrow$ A(5), B(4), C(6)
(Note: B(2), C(1) or C(2), B(1) are not allowed if it forces A to take 0, wait, A gets 0 means A(4). A is allowed to have 4.) Let's check permutations of (2, 1, 0)$(2, 1, 0)$:
- A(4), B(6), C(5) [x=0, y=2, z=1]
- A(4), B(5), C(6) [x=0, y=1, z=2]
Case 3: (3, 0, 0)$(3, 0, 0)$ and permutations.
Since y ≤ 2$y \le 2$ and z ≤ 2$z \le 2$, only x$x$ can be 3.
So, x=3, y=0, z=0$x=3, y=0, z=0$ ⇒$\Rightarrow$ A(7), B(4), C(4).
Step 2: Calculating Combinations per Case
Let's list all valid final section breakdowns (A, B, C)$(A, B, C)$:
- (5, 5, 5) ⇒ ⁸C₅ · ⁶C₅ · ⁶C₅ = 56 · 6 · 6 = 2016$(5, 5, 5) \Rightarrow {}^8C_5 \cdot {}^6C_5 \cdot {}^6C_5 = 56 \cdot 6 \cdot 6 = 2016$
- (6, 5, 4) ⇒ ⁸C₆ · ⁶C₅ · ⁶C₄ = 28 · 6 · 15 = 2520$(6, 5, 4) \Rightarrow {}^8C_6 \cdot {}^6C_5 \cdot {}^6C_4 = 28 \cdot 6 \cdot 15 = 2520$
- (6, 4, 5) ⇒ ⁸C₆ · ⁶C₄ · ⁶C₅ = 28 · 15 · 6 = 2520$(6, 4, 5) \Rightarrow {}^8C_6 \cdot {}^6C_4 \cdot {}^6C_5 = 28 \cdot 15 \cdot 6 = 2520$
- (5, 6, 4) ⇒ ⁸C₅ · ⁶C₆ · ⁶C₄ = 56 · 1 · 15 = 840$(5, 6, 4) \Rightarrow {}^8C_5 \cdot {}^6C_6 \cdot {}^6C_4 = 56 \cdot 1 \cdot 15 = 840$
- (5, 4, 6) ⇒ ⁸C₅ · ⁶C₄ · ⁶C₆ = 56 · 15 · 1 = 840$(5, 4, 6) \Rightarrow {}^8C_5 \cdot {}^6C_4 \cdot {}^6C_6 = 56 \cdot 15 \cdot 1 = 840$
- (4, 6, 5) ⇒ ⁸C₄ · ⁶C₆ · ⁶C₅ = 70 · 1 · 6 = 420$(4, 6, 5) \Rightarrow {}^8C_4 \cdot {}^6C_6 \cdot {}^6C_5 = 70 \cdot 1 \cdot 6 = 420$
- (4, 5, 6) ⇒ ⁸C₄ · ⁶C₅ · ⁶C₆ = 70 · 6 · 1 = 420$(4, 5, 6) \Rightarrow {}^8C_4 \cdot {}^6C_5 \cdot {}^6C_6 = 70 \cdot 6 \cdot 1 = 420$
- (7, 4, 4) ⇒ ⁸C₇ · ⁶C₄ · ⁶C₄ = 8 · 15 · 15 = 1800$(7, 4, 4) \Rightarrow {}^8C_7 \cdot {}^6C_4 \cdot {}^6C_4 = 8 \cdot 15 \cdot 15 = 1800$
Step 3: Summing the Total Ways
Total ways = 2016 + 2520 + 2520 + 840 + 840 + 420 + 420 + 1800$2016 + 2520 + 2520 + 840 + 840 + 420 + 420 + 1800$
Total ways = 2016 + 5040 + 1680 + 840 + 1800 = 11376$2016 + 5040 + 1680 + 840 + 1800 = 11376$
Pattern Recognition
Combinatorial distribution with rigid lower bounds is solved by shifting the baseline. Allocate the minimums immediately (4+4+4=12$4+4+4=12$), then distribute the remaining items via casework ensuring upper capacities aren't breached.
Chapter Mix
Class 11 Maths: Permutations and Combinations