Start Learning Free

Before You Begin

Question #41820

Difficulty: 8/10 | 🟢 Free

The Question

Let NN be the greatest binomial coefficient in the expansion of (1+x)6(1+x)^6. A bag contains NN distinct balls numbered 11 to NN. Experiment A consists of drawing 3 balls from the bag with replacement. Let PAP_A be the probability that the sum of the numbers on the drawn balls is at most NN. Experiment B consists of drawing 3 balls from the bag without replacement. Let PBP_B be the probability that the sum of the numbers on the drawn balls is at most NN. Find the value of PAPB\frac{P_A}{P_B}.

Options

  • A.

    1083980\frac{1083}{980}

  • B.

    32491960\frac{3249}{1960}

  • C.

    57400\frac{57}{400}

  • D.

    216603773\frac{21660}{3773}

Check Your Answer

Correct Answer

Step-by-Step Solution

Explanation

How the Examiner Thinks

Bridge

Practice problems that bridge the gap between foundational theory and advanced practical application.

Concepts Behind This Question

Sampling With/Without Replacement|Selection vs Arrangement|Greatest Binomial Coefficient|Complementary Counting

Why This Question Is Tricky

Common Mistakes

This question engineers a collision between multinomial distributions (sampling with replacement) and hypergeometric constraints (sampling without replacement).

The boundary condition N=20 is derived from the greatest binomial coefficient.

Students often fail to correctly count the number of distinct selections for a bounded sum.

The trap lies in manually counting or ignoring the edge-case exclusions of identical draws.

By applying Complementary Counting via the Principle of Inclusion-Exclusion (or generating functions) on the unrestricted integer partitions, we elegantly bypass redundant calculations.

Options include traps where students use combinations with replacement for the sample space or fail to divide by 3! when removing permutations of identical draws.

Quick Facts About This Question

Question Information

SubjectMathematics
ChapterProbability - Class 12
ConceptSampling With/Without Replacement
Difficulty8
Cognitive Load7
Target Solve Time160 sec
AccessFree