Skip to main content
Back to Statistics & Probability
JEE Main 2021
Statistics & Probability
Probability
Easy

Question

The minimum number of times one has to toss a fair coin so that the probability of observing at least one head is at least 90% is :

Options

Solution

Key Concepts and Formulas

  • Complementary Probability Rule: For any event EE, the probability of EE occurring is P(E)=1P(Ec)P(E) = 1 - P(E^c), where EcE^c is the complement of event EE (the event that EE does not occur). This rule is particularly useful for "at least one" type of problems.
  • Probability of Independent Events: If multiple events are independent (the outcome of one does not affect the others), the probability of all of them occurring is the product of their individual probabilities. For events A1,A2,,AnA_1, A_2, \dots, A_n, P(A1 and A2 and  and An)=P(A1)×P(A2)××P(An)P(A_1 \text{ and } A_2 \text{ and } \dots \text{ and } A_n) = P(A_1) \times P(A_2) \times \dots \times P(A_n).
  • Basic Coin Toss Probabilities: For a fair coin, the probability of getting a Head (H) is P(H)=12P(H) = \frac{1}{2}, and the probability of getting a Tail (T) is P(T)=12P(T) = \frac{1}{2}.

Step-by-Step Solution

Step 1: Define the Event and its Complement

We are looking for the minimum number of tosses (nn) such that the probability of observing "at least one head" is at least 90%.

  • Let Event EE be "observing at least one head in nn tosses."
  • The Complement of Event EE (EcE^c) is "observing no heads in nn tosses." This means all nn tosses must result in tails.

Using complementary probability simplifies the problem significantly because calculating P(Ec)P(E^c) (all tails) is much easier than directly calculating P(E)P(E) (summing probabilities for 1 head, 2 heads, ..., up to nn heads).

Step 2: Calculate the Probability of the Complement Event (EcE^c)

For a fair coin, the probability of getting a Tail in a single toss is P(T)=12P(T) = \frac{1}{2}. Since each coin toss is an independent event, the probability of getting tails in nn consecutive tosses is the product of the probabilities of getting a tail in each individual toss.

P(Ec)=P(Tail on 1st toss)×P(Tail on 2nd toss)××P(Tail on nth toss)P(E^c) = P(\text{Tail on 1st toss}) \times P(\text{Tail on 2nd toss}) \times \dots \times P(\text{Tail on } n\text{th toss}) P(Ec)=(12)×(12)××(12)(n times)P(E^c) = \left(\frac{1}{2}\right) \times \left(\frac{1}{2}\right) \times \dots \times \left(\frac{1}{2}\right) \quad (n \text{ times}) P(Ec)=(12)nP(E^c) = \left(\frac{1}{2}\right)^n

Step 3: Calculate the Probability of the Desired Event (EE)

Now, we use the complementary probability rule: P(E)=1P(Ec)P(E) = 1 - P(E^c) Substituting the expression for P(Ec)P(E^c) from Step 2: P(E)=1(12)nP(E) = 1 - \left(\frac{1}{2}\right)^n

Step 4: Set Up the Inequality Based on the Problem Condition

The problem states that the probability of observing at least one head must be "at least 90%." Converting 90% to a decimal, we get 0.90.9. So, the condition is: P(E)0.9P(E) \ge 0.9 Substituting the expression for P(E)P(E) from Step 3: 1(12)n0.91 - \left(\frac{1}{2}\right)^n \ge 0.9

Step 5: Solve the Inequality for the Minimum Number of Tosses (nn)

Our goal is to find the smallest integer value of nn that satisfies this inequality.

  1. Isolate the term with nn: Subtract 1 from both sides of the inequality. (12)n0.91-\left(\frac{1}{2}\right)^n \ge 0.9 - 1 (12)n0.1-\left(\frac{1}{2}\right)^n \ge -0.1

  2. Multiply by -1 and reverse the inequality sign: To make the term with nn positive, multiply both sides by -1. Remember that multiplying or dividing an inequality by a negative number reverses the direction of the inequality sign. (12)n0.1\left(\frac{1}{2}\right)^n \le 0.1

  3. Rewrite and take reciprocals: Express 0.10.1 as 110\frac{1}{10} and (12)n\left(\frac{1}{2}\right)^n as 12n\frac{1}{2^n}. 12n110\frac{1}{2^n} \le \frac{1}{10} Now, take the reciprocal of both sides. When taking the reciprocal of both sides of an inequality (where both sides are positive), the direction of the inequality sign must be reversed. 2n102^n \ge 10

  4. Find the minimum integer value of nn: We need to find the smallest integer nn for which 2n2^n is greater than or equal to 10.

    • For n=1n=1, 21=22^1 = 2. (Is 2102 \ge 10? No.)
    • For n=2n=2, 22=42^2 = 4. (Is 4104 \ge 10? No.)
    • For n=3n=3, 23=82^3 = 8. (Is 8108 \ge 10? No.)
    • For n=4n=4, 24=162^4 = 16. (Is 161016 \ge 10? Yes!)

    The minimum integer value of nn that satisfies the condition 2n102^n \ge 10 is n=4n=4.


Common Mistakes & Tips

  • Forgetting to Reverse Inequality Signs: This is a very common error. Always remember to reverse the inequality sign when multiplying/dividing by a negative number or when taking reciprocals of both sides (for positive values).
  • Misinterpreting "At Least One": Directly calculating "at least one" head can be tedious. Always think of using the complementary probability rule (1P(no heads)1 - P(\text{no heads})) for these types of problems.
  • Checking Integer Solutions: After solving an inequality, especially when finding a minimum or maximum integer, it's good practice to test values around your calculated boundary to confirm the correct integer solution.

Summary

To determine the minimum number of coin tosses required for the probability of observing at least one head to be at least 90%, we effectively used the complementary probability rule. By calculating the probability of the opposite event (no heads) as (1/2)n(1/2)^n, we set up the inequality 1(1/2)n0.91 - (1/2)^n \ge 0.9. Solving this inequality led to 2n102^n \ge 10. By testing integer values, we found that the smallest integer nn satisfying this condition is 4.

The final answer is 4\boxed{4}, which corresponds to option (C).

Practice More Statistics & Probability Questions

View All Questions