A fair die is tossed repeatedly until a six is obtained. Let denote the number of tosses required, and let , , and . Then is equal to:
- A
- B
- C
- D
A fair die is tossed repeatedly until a six is obtained. Let denote the number of tosses required, and let , , and . Then is equal to:
Correct answer:A
Standard Method
Given: A fair die is tossed until the first six appears, so follows a geometric distribution with success probability and failure probability .
Find: where , , and .
First calculate :
Now calculate . For , the first two tosses must not be six:
Next calculate . Given , no six has appeared in the first three tosses. To have , tosses and must also not be six. By the memoryless property of the geometric distribution:
Substitute these values:
Therefore, the correct option is A.
Use geometric memoryless property
Given: is geometric with success probability .
Find: .
For a geometric random variable,
So,
Therefore, the correct option is A.
Using as a long infinite sum without noticing it is simply the probability that the first two tosses are not six. This makes the work longer and can introduce errors. Instead, use directly.
Misreading the conditional probability as . This ignores the conditioning information. After conditioning on , only two additional non-six outcomes are needed, so use the memoryless property.
Taking as . That would mean getting a six on all three tosses, which is not the event described. The correct event is two failures followed by one success: .
Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step — free to start.