Permutations and CombinationsMCQMTP Sep 24 Series IIQuestion 1754 of 249
All Questions

A candidate is required to answer 6\displaystyle 6 out of $10$ questions, which are divided into two groups each containing $5$ questions and he is not permitted to attempt more than $4$ from each group. In how many ways can he make up his choice?

Select Your Answer (Keyboard: A, B, C, D)
For any discrepancies in this question, email contact@cadada.in

Correct Answer

✅ Option d — $200$

All Options:

  • A$315$
  • B$250$
  • C$450$
  • D$200$

Detailed Solution & Explanation

We are given:
- Total number of questions = $10<br>−Group1has\displaystyle <br>- Group 1 has5questions.<br>−Group2has\displaystyle questions.<br>- Group 2 has5questions.<br>−Thecandidatemustanswerexactly\displaystyle questions.<br>- The candidate must answer exactly6questionsintotal.<br>−Constraint:Thecandidatecannotanswermorethan\displaystyle questions in total.<br>- Constraint: The candidate cannot answer more than4questionsfromanysinglegroup.<br><br>Let\displaystyle questions from any single group.<br><br>Letg_1$ be the number of questions attempted from Group 1, and $g_2bethenumberofquestionsattemptedfromGroup2.Wemusthave:<br><spanclass="katex−display"><spanclass="katex"><spanclass="katex−mathml"><mathxmlns="http://www.w3.org/1998/Math/MathML"display="block"><semantics><mrow><msub><mi>g</mi><mn>1</mn></msub><mo>+</mo><msub><mi>g</mi><mn>2</mn></msub><mo>=</mo><mn>6</mn><mspacewidth="1em"/><mtext>where </mtext><msub><mi>g</mi><mn>1</mn></msub><mo>≤</mo><mn>4</mn><mtext> and </mtext><msub><mi>g</mi><mn>2</mn></msub><mo>≤</mo><mn>4</mn></mrow><annotationencoding="application/x−tex">g1+g2=6where g1≤4 and g2≤4</annotation></semantics></math></span><spanclass="katex−html"aria−hidden="true"><spanclass="base"><spanclass="strut"style="height:0.7778em;vertical−align:−0.1944em;"></span><spanclass="mord"><spanclass="mordmathnormal"style="margin−right:0.03588em;">g</span><spanclass="msupsub"><spanclass="vlist−tvlist−t2"><spanclass="vlist−r"><spanclass="vlist"style="height:0.3011em;"><spanstyle="top:−2.55em;margin−left:−0.0359em;margin−right:0.05em;"><spanclass="pstrut"style="height:2.7em;"></span><spanclass="sizingreset−size6size3mtight"><spanclass="mordmtight">1</span></span></span></span><spanclass="vlist−s">​</span></span><spanclass="vlist−r"><spanclass="vlist"style="height:0.15em;"><span></span></span></span></span></span></span><spanclass="mspace"style="margin−right:0.2222em;"></span><spanclass="mbin">+</span><spanclass="mspace"style="margin−right:0.2222em;"></span></span><spanclass="base"><spanclass="strut"style="height:0.625em;vertical−align:−0.1944em;"></span><spanclass="mord"><spanclass="mordmathnormal"style="margin−right:0.03588em;">g</span><spanclass="msupsub"><spanclass="vlist−tvlist−t2"><spanclass="vlist−r"><spanclass="vlist"style="height:0.3011em;"><spanstyle="top:−2.55em;margin−left:−0.0359em;margin−right:0.05em;"><spanclass="pstrut"style="height:2.7em;"></span><spanclass="sizingreset−size6size3mtight"><spanclass="mordmtight">2</span></span></span></span><spanclass="vlist−s">​</span></span><spanclass="vlist−r"><spanclass="vlist"style="height:0.15em;"><span></span></span></span></span></span></span><spanclass="mspace"style="margin−right:0.2778em;"></span><spanclass="mrel">=</span><spanclass="mspace"style="margin−right:0.2778em;"></span></span><spanclass="base"><spanclass="strut"style="height:0.8889em;vertical−align:−0.1944em;"></span><spanclass="mord">6</span><spanclass="mspace"style="margin−right:1em;"></span><spanclass="mordtext"><spanclass="mord">where </span></span><spanclass="mord"><spanclass="mordmathnormal"style="margin−right:0.03588em;">g</span><spanclass="msupsub"><spanclass="vlist−tvlist−t2"><spanclass="vlist−r"><spanclass="vlist"style="height:0.3011em;"><spanstyle="top:−2.55em;margin−left:−0.0359em;margin−right:0.05em;"><spanclass="pstrut"style="height:2.7em;"></span><spanclass="sizingreset−size6size3mtight"><spanclass="mordmtight">1</span></span></span></span><spanclass="vlist−s">​</span></span><spanclass="vlist−r"><spanclass="vlist"style="height:0.15em;"><span></span></span></span></span></span></span><spanclass="mspace"style="margin−right:0.2778em;"></span><spanclass="mrel">≤</span><spanclass="mspace"style="margin−right:0.2778em;"></span></span><spanclass="base"><spanclass="strut"style="height:0.8889em;vertical−align:−0.1944em;"></span><spanclass="mord">4</span><spanclass="mordtext"><spanclass="mord"> and </span></span><spanclass="mord"><spanclass="mordmathnormal"style="margin−right:0.03588em;">g</span><spanclass="msupsub"><spanclass="vlist−tvlist−t2"><spanclass="vlist−r"><spanclass="vlist"style="height:0.3011em;"><spanstyle="top:−2.55em;margin−left:−0.0359em;margin−right:0.05em;"><spanclass="pstrut"style="height:2.7em;"></span><spanclass="sizingreset−size6size3mtight"><spanclass="mordmtight">2</span></span></span></span><spanclass="vlist−s">​</span></span><spanclass="vlist−r"><spanclass="vlist"style="height:0.15em;"><span></span></span></span></span></span></span><spanclass="mspace"style="margin−right:0.2778em;"></span><spanclass="mrel">≤</span><spanclass="mspace"style="margin−right:0.2778em;"></span></span><spanclass="base"><spanclass="strut"style="height:0.6444em;"></span><spanclass="mord">4</span></span></span></span></span><br>Thepossiblevalidcombinations\displaystyle be the number of questions attempted from Group 2. We must have:<br><span class="katex-display"><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML" display="block"><semantics><mrow><msub><mi>g</mi><mn>1</mn></msub><mo>+</mo><msub><mi>g</mi><mn>2</mn></msub><mo>=</mo><mn>6</mn><mspace width="1em"/><mtext>where </mtext><msub><mi>g</mi><mn>1</mn></msub><mo>≤</mo><mn>4</mn><mtext> and </mtext><msub><mi>g</mi><mn>2</mn></msub><mo>≤</mo><mn>4</mn></mrow><annotation encoding="application/x-tex">g_1 + g_2 = 6 \quad where \displaystyle \text{where } g_1 ≤\displaystyle \le 4  and \displaystyle \text{ and } g_2 ≤\displaystyle \le 4</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.7778em;vertical-align:-0.1944em;"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.03588em;">g</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em;"><span style="top:-2.55em;margin-left:-0.0359em;margin-right:0.05em;"><span class="pstrut" style="height:2.7em;"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">1</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em;"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2222em;"></span><span class="mbin">+</span><span class="mspace" style="margin-right:0.2222em;"></span></span><span class="base"><span class="strut" style="height:0.625em;vertical-align:-0.1944em;"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.03588em;">g</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em;"><span style="top:-2.55em;margin-left:-0.0359em;margin-right:0.05em;"><span class="pstrut" style="height:2.7em;"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">2</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em;"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em;"></span><span class="mrel">=</span><span class="mspace" style="margin-right:0.2778em;"></span></span><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em;"></span><span class="mord">6</span><span class="mspace" style="margin-right:1em;"></span><span class="mord text"><span class="mord">where </span></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.03588em;">g</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em;"><span style="top:-2.55em;margin-left:-0.0359em;margin-right:0.05em;"><span class="pstrut" style="height:2.7em;"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">1</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em;"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em;"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2778em;"></span></span><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em;"></span><span class="mord">4</span><span class="mord text"><span class="mord"> and </span></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.03588em;">g</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em;"><span style="top:-2.55em;margin-left:-0.0359em;margin-right:0.05em;"><span class="pstrut" style="height:2.7em;"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">2</span></span></span></span><span class="vlist-s">​</span></span><span class="vlist-r"><span class="vlist" style="height:0.15em;"><span></span></span></span></span></span></span><span class="mspace" style="margin-right:0.2778em;"></span><span class="mrel">≤</span><span class="mspace" style="margin-right:0.2778em;"></span></span><span class="base"><span class="strut" style="height:0.6444em;"></span><span class="mord">4</span></span></span></span></span><br>The possible valid combinations(g_1, g_2)are:<br>1.∗∗Case1:∗∗\displaystyle are:<br>1. **Case 1:**2$ questions from Group 1 and $4questionsfromGroup2<br>2.∗∗Case2:∗∗\displaystyle questions from Group 2<br>2. **Case 2:**3$ questions from Group 1 and $3questionsfromGroup2<br>3.∗∗Case3:∗∗\displaystyle questions from Group 2<br>3. **Case 3:**4$ questions from Group 1 and $2$ questions from Group 2

Let us calculate the number of ways for each case:

- **Case 1: 2 from Group 1, 4 from Group 2**
Ways1=5C2×5C4=(5×42×1)×5=10×5=50Ways1=5C2\displaystyle \text{Ways}_1 = ^{5}C_{2} ×\displaystyle \times ^{5}C_{4} = \left(5×42×1\displaystyle \frac{5 \times 4}{2 \times 1}\right) ×\displaystyle \times 5 = 10 ×\displaystyle \times 5 = 50
- **Case 2: 3 from Group 1, 3 from Group 2**
Ways2=5C3×5C3=10×10=100Ways2=5C3\displaystyle \text{Ways}_2 = ^{5}C_{3} ×\displaystyle \times ^{5}C_{3} = 10 ×\displaystyle \times 10 = 100
- **Case 3: 4 from Group 1, 2 from Group 2**
Ways3=5C4×5C2=5×10=50Ways3=5C4\displaystyle \text{Ways}_3 = ^{5}C_{4} ×\displaystyle \times ^{5}C_{2} = 5 ×\displaystyle \times 10 = 50
By the addition principle, the total number of ways the candidate can choose the questions is:
Total Ways=Ways1+Ways2+Ways3Total Ways=Ways1+Ways2+Ways3\displaystyle \text{Total Ways} = \text{Ways}_1 + \text{Ways}_2 + \text{Ways}_3
Total Ways=50+100+50=200Total Ways=50+100+50=200\displaystyle \text{Total Ways} = 50 + 100 + 50 = 200

Hence, **Option D** is the correct answer.

About This Chapter: Permutations and Combinations

Paper

Paper 3: Quantitative Aptitude

Weightage

4-6 Marks

Key Topics

Factorials, Permutations, Combinations

This chapter deals with the fundamental principles of counting. It covers factorials, circular permutations, restricted permutations, combinations, and the differences between selecting items versus arranging them.

View Official ICAI Syllabus

Exam Strategy Tip

The most common mistake is confusing 'P' (Arrangement) with 'C' (Selection). If order matters (like opening a lock), use P. If order doesn't matter (like choosing a team), use C.

Related Comparison Tables

More Questions from Permutations and Combinations

Ready to Master Permutations and Combinations?

Practice all 249 questions with instant feedback, earn XP, track your streaks, and ace your CA Foundation exam.

Start Practicing — It's Free