Question
A fair coin is tossed repeatedly until two heads are obtained. Given that at least two tails were tossed: (1) Compute the conditional probability of tossing at least three tails; (2) Compute the conditional probability that the first toss was a head.
Step-by-step solution
1. Define the basic events and probabilities. * The experiment stops when the last toss is a head, and among the first tosses there is exactly one head. * Let be the event "at least two tails were tossed." This means the number of tails , so the total number of tosses . * Since , we first compute (fewer than two tails).
2. Compute the probability of the complementary event . * Case 1: 0 tails (). The only possible sequence is: . Probability: . * Case 2: 1 tail (). Total tosses . The last toss is a head, and among the first two tosses there is one head and one tail. Possible sequences: , . Probability: .
3. Compute . * * .
1. Set up the events and objective. * Let be the event "at least three tails," i.e., . * We need to compute . * Since "at least three tails" necessarily implies "at least two tails," i.e., , we have .
2. Compute . * Using the already computed for a recursive approach, or using . * We know . * The event (exactly two tails) corresponds to sequences of length 4, with the last toss being a head and exactly one head and two tails among the first three tosses. * The number of such sequences is (namely ). * . * .
3. Compute the conditional probability. * .
1. Set up the events and objective. * Let be the event "the first toss is a head." * We need to compute . * The event means: the first toss is a head, and exactly two heads appear in total (the second head causes the process to stop), and there are at least two tails in between.
2. Analyze the structure of the event . * Since the first toss is a head and the second head only appears at the very end (stopping the process), all intermediate tosses must be tails. * The sequence must have the form: (first toss), ( tails in the middle), (end). * Denote this as . * The problem requires "at least two tails," i.e., .
3. Compute . * This is a sum of probabilities over an infinite series, where each qualifying sequence has a unique form. * For (2 tails): , probability . * For (3 tails): , probability . * ... * * This is a geometric series with first term and common ratio . * .
4. Compute the conditional probability. * .
Final answer
(1) Given at least two tails, the conditional probability of at least three tails is . (2) Given at least two tails, the conditional probability that the first toss was a head is .
Marking scheme
The following is the marking scheme based on the official solution (maximum 7 points).
1. Key Checkpoints (Max 7 pts)
I. Computing the denominator (max 2 pts)
- [additive] Correctly identify the composition of the complementary event (number of tails ) as ( and ), or write the correct infinite series summation formula. (1 pt)
- [additive] Compute the correct value . (1 pt)
II. Part 1: Conditional probability of at least three tails (max 2 pts)
- [additive] Compute the key numerator term (exactly two tails) or directly compute . (1 pt)
- [additive] Combine with the denominator to obtain the correct final result . (1 pt)
- *Note: If only the formula is listed without computing the numerical value, no credit for this point; if the denominator is wrong but the logic is consistent (follow-through), partial credit may be awarded, but the subtotal for this part cannot exceed 1 point.*
III. Part 2: Conditional probability that the first toss was a head (max 3 pts)
- [additive] Structural identification: Explicitly state that qualifying sequences must have the form (all tails in the middle with ), or use the memoryless property / independence of the geometric distribution for an equivalent argument. (1 pt)
- [max 2] Computation and conclusion:
- Correctly construct the geometric series sum (or probability product) and compute , then obtain the final result . (2 pts)
- *Partial credit:* Only correctly compute the intersection probability , but the final ratio computation is wrong or missing. (1 pt)
Total (max 7)
2. Zero-credit items
- Merely copying the problem conditions (e.g., " at least two tails") or listing the conditional probability definition formula without any concrete numerical substitution or computation.
- Incorrectly assuming the total number of tosses is fixed (e.g., assuming to compute probabilities).
- In Part 1, simply claiming without justification.
- In Part 2, only listing the probability of the sequence () as the numerator, ignoring the cases .
3. Deductions
- Arithmetic error: Arithmetic mistakes in key steps (e.g., errors in fraction addition/subtraction), causing subsequent results to be wrong. Deduct 1 point per occurrence (no repeated deductions within the same logical chain, capped at 1 point per chain).
- Logical confusion: Confusing "exactly two" with "at least two," causing the numerator computation to be completely off track (e.g., using only as the numerator in Part 1). Deduct 1 point.
- Missing necessary justification: In Part 2, when using the geometric distribution result, failing to briefly explain "the first toss being H does not affect the subsequent waiting process" or a similar independence argument. Deduct 1 point.