MathIsimple

Probability Theory – Problem 67: Compute the conditional probability of obtaining at least three tails;

Question

A fair coin is tossed repeatedly until two heads have appeared. Given that at least two tails have occurred: (1) Compute the conditional probability of obtaining at least three tails; (2) Compute the conditional probability that the first toss is heads.

Step-by-step solution

1. Define the basic events and probabilities. * The experiment stops when the last toss is heads and exactly two heads have appeared in total among the first NN tosses. * Let AA be the event "at least two tails occurred." This means the number of tails X2X \ge 2, so the total number of tosses N=X+24N = X + 2 \ge 4. * Since P(A)=1P(Ac)P(A) = 1 - P(A^c), we first compute P(Ac)P(A^c) (fewer than two tails).

2. Compute the probability of the complementary event AcA^c. * Case 1: 0 tails (X=0X=0). The only possible sequence is: heads, heads, i.e., HHHH. Probability: P(X=0)=12×12=14P(X=0) = \frac{1}{2} \times \frac{1}{2} = \frac{1}{4}. * Case 2: 1 tail (X=1X=1). Total tosses N=3N=3. The last toss is heads, and among the first two tosses there is one heads and one tails. Possible sequences: HTHHTH, THHTHH. Probability: P(X=1)=2×(12)3=28=14P(X=1) = 2 \times (\frac{1}{2})^3 = \frac{2}{8} = \frac{1}{4}.

3. Compute P(A)P(A). * P(A)=1[P(X=0)+P(X=1)]P(A) = 1 - [P(X=0) + P(X=1)] * P(A)=1(14+14)=12P(A) = 1 - (\frac{1}{4} + \frac{1}{4}) = \frac{1}{2}.

1. Set up the events and objective. * Let BB be the event "at least three tails," i.e., X3X \ge 3. * We need to compute P(BA)=P(AB)P(A)P(B|A) = \frac{P(AB)}{P(A)}. * Since "at least three tails" implies "at least two tails," i.e., BAB \subset A, we have P(AB)=P(B)P(AB) = P(B).

2. Compute P(B)P(B). * Use the already computed P(A)P(A) for a recursive approach, or use 1P(X<3)1 - P(X < 3). * We know P(X2)=12P(X \ge 2) = \frac{1}{2}. * The event X=2X=2 (exactly two tails) corresponds to sequences of length 4, with the last toss being heads and exactly one heads among the first three tosses. * The number of such sequences is (31)=3\binom{3}{1} = 3 (namely HTTH,THTH,TTHHHTTH, THTH, TTHH). * P(X=2)=3×(12)4=316P(X=2) = 3 \times (\frac{1}{2})^4 = \frac{3}{16}. * P(B)=P(X3)=P(X2)P(X=2)=12316=516P(B) = P(X \ge 3) = P(X \ge 2) - P(X=2) = \frac{1}{2} - \frac{3}{16} = \frac{5}{16}.

3. Compute the conditional probability. * P(BA)=P(B)P(A)=5/161/2=516×2=58P(B|A) = \frac{P(B)}{P(A)} = \frac{5/16}{1/2} = \frac{5}{16} \times 2 = \frac{5}{8}.

1. Set up the events and objective. * Let CC be the event "the first toss is heads." * We need to compute P(CA)=P(AC)P(A)P(C|A) = \frac{P(AC)}{P(A)}. * The event ACAC means: the first toss is heads, and exactly two heads appear in total (the second heads causes the process to stop), and at least two tails occur in between.

2. Analyze the structure of the event ACAC. * Since the first toss is heads and the second heads only appears at the very end (causing the process to stop), all intermediate tosses must be tails. * The sequence must have the form: HH (first toss), T,T,,TT, T, \dots, T (kk tails in the middle), HH (end). * Denote this as HTkHH T^k H. * The problem requires "at least two tails," i.e., k2k \ge 2.

3. Compute P(AC)P(AC). * This is a probability sum over an infinite series, where each qualifying sequence has a unique form. * k=2k=2 (2 tails): HTTHHTTH, probability (12)4=116(\frac{1}{2})^4 = \frac{1}{16}. * k=3k=3 (3 tails): HTTTHHTTTH, probability (12)5=132(\frac{1}{2})^5 = \frac{1}{32}. * ... * P(AC)=k=2(12)k+2=116+132+164+P(AC) = \sum_{k=2}^{\infty} (\frac{1}{2})^{k+2} = \frac{1}{16} + \frac{1}{32} + \frac{1}{64} + \dots * This is a geometric series with first term a=116a = \frac{1}{16} and common ratio q=12q = \frac{1}{2}. * P(AC)=1/1611/2=1/161/2=18P(AC) = \frac{1/16}{1 - 1/2} = \frac{1/16}{1/2} = \frac{1}{8}.

4. Compute the conditional probability. * P(CA)=P(AC)P(A)=1/81/2=14P(C|A) = \frac{P(AC)}{P(A)} = \frac{1/8}{1/2} = \frac{1}{4}.

Final answer

(1) Given at least two tails, the conditional probability of at least three tails is 58\frac{5}{8}. (2) Given at least two tails, the conditional probability that the first toss is heads is 14\frac{1}{4}.

Marking scheme

The following is the marking rubric based on the official solution (total: 7 points).

1. Checkpoints (Max 7 pts)

I. Computing the denominator P(A)P(A) (max 2 pts)

  • [additive] Correctly identify the composition of the complementary event AcA^c (number of tails <2<2) as (HHHH and HTH/THHHTH/THH), or set up the correct infinite series summation. (1 pt)
  • [additive] Obtain the correct numerical value P(A)=1/2P(A) = 1/2. (1 pt)

II. Part (1): Conditional probability of at least three tails (max 2 pts)

  • [additive] Compute the key numerator term P(X=2)=3/16P(X=2) = 3/16 (exactly two tails) or directly compute P(AB)=5/16P(AB) = 5/16. (1 pt)
  • [additive] Combine with the denominator to obtain the correct final result 5/85/8. (1 pt)
  • *Note: If only the formula is listed without computing the numerical value, no credit for this point; if the denominator is incorrect but the logic is consistent (follow-through), partial credit may be awarded, but the subtotal shall not exceed 1 pt.*

III. Part (2): Conditional probability that the first toss is heads (max 3 pts)

  • [additive] Structure identification: Explicitly state that qualifying sequences must have the form HTTHH T \dots T H (all intermediate tosses are tails with k2k \ge 2), or provide an equivalent argument using the memoryless property / independence of the geometric distribution. (1 pt)
  • [max 2] Computation and conclusion:
  • Correctly set up the geometric series (or probability product) and compute P(AC)=1/8P(AC) = 1/8, then obtain the final result 1/41/4. (2 pts)
  • *Partial credit:* Only correctly compute the intersection probability P(AC)=1/8P(AC) = 1/8, but the final ratio computation is incorrect or missing. (1 pt)

Total (max 7)

2. Zero-credit items

  • Merely copying the problem conditions (e.g., "A=A= at least two tails") or listing the conditional probability definition formula P(BA)=P(AB)/P(A)P(B|A) = P(AB)/P(A) without any concrete numerical substitution or computation.
  • Incorrectly assuming the total number of tosses NN is fixed (e.g., assuming N=4N=4 to compute probabilities).
  • In Part (1), simply asserting P(at least 3 tails)=P(at least 2 tails)×1/2P(\text{at least 3 tails}) = P(\text{at least 2 tails}) \times 1/2 without justification.
  • In Part (2), only listing the probability of the sequence HTTHHTTH (1/161/16) as the numerator, ignoring the cases k>2k>2.

3. Deductions

  • Arithmetic error: Key-step arithmetic mistakes (e.g., fraction addition/subtraction errors) leading to incorrect subsequent results, deduct 1 pt per occurrence (no repeated deductions within the same logical chain, capped at 1 pt per chain).
  • Logical confusion: Confusing "exactly two" with "at least two," causing the numerator computation to be completely off track (e.g., using only P(X=3)P(X=3) for the numerator in Part (1)), deduct 1 pt.
  • Missing necessary justification: In Part (2), using a geometric distribution result without briefly explaining "the first toss being H does not affect the subsequent waiting process" or a similar independence argument, deduct 1 pt.
Ask AI ✨