Analyzing the Setup
The Dance of Probability: Unlocking the Binomial Mystery. Welcome, future engineer. Today, we are not just solving a problem; we are peeling back the layers of a binomial distribution to reveal the elegant structure hidden beneath.
This problem is a classic JEE Advanced favorite because it tests your algebraic stamina and your conceptual grasp of probability. Let us begin.
The Mean-Variance Trap
We start with a random variable X∼B(n,p). The problem gives us a gift: the difference between the mean and the variance is 1.
We know the mean is μ=np and the variance is σ2=npq. The condition is μ−σ2=1. Substituting our formulas, we get:
Now, factor out the np: np(1−q)=1. Since p+q=1, we know that 1−q=p. Suddenly, the equation simplifies to:
Keep this relationship, n=p21, safe in your mind; we will need it later.
The Ratio Dance
Next, we are given the condition 2P(X=2)=3P(X=1). This looks intimidating, but let us break it down using the binomial probability formula: P(X=k)=(kn)pkqn−k.
Expanding both sides, we get:
2[(2n)p2qn−2]=3[(1n)p1qn−1]
Do not let the combinations scare you. Remember that (2n)=2n(n−1) and (1n)=n. Substituting these, the equation becomes:
2⋅2n(n−1)p2qn−2=3⋅npqn−1
Notice how the 2s cancel out on the left? It is almost as if the problem was designed to be solved. We are left with:
The Algebraic Cleanup
Now, we perform the great cancellation. Divide both sides by npqn−2. Assuming $n
eq 0$ and $p, q
eq 0$, we are left with:
This is beautiful. We have reduced a complex probability equation into a simple linear relationship. Substitute q=1−p to get (n−1)p=3(1−p).
Expanding this, we get np−p=3−3p, which rearranges to:
The Final Convergence
We have two equations now: np2=1 and np+2p=3. From the first, np=p1. Substitute this into the second:
Multiply by p to clear the fraction: 1+2p2=3p, or 2p2−3p+1=0. Factoring this quadratic gives:
We reject p=1 (as discussed in our FAQs) and accept p=21. Plugging this back into n=p21, we find:
The Victory Lap
We have our parameters: n=4 and p=1/2. The question asks for n2P(X>1). Since n=4, n2=16.
For P(X>1), we use the complement rule: 1−P(X=0)−P(X=1). Calculating these:
P(X=0)=(04)(1/2)0(1/2)4=161
P(X=1)=(14)(1/2)1(1/2)3=164
Thus, P(X>1)=1−161−164=1611. Finally:
You have navigated the complexity and arrived at the truth. The final answer is 11. Well done.