← Back to exams

Problem

Each draw wins with fixed probability , and each draw spends one token. The question asks for the mean number of draws until the first win, the chance of at least one win from a finite number of tokens, whether ten straight misses are less likely than a win on the first draw, and the least number of tokens that pushes that chance strictly above nine-tenths. The full question and the options are on the CEEC 113 AST Mathematics I paper.

Where it goes wrong

The official item analysis records a score rate of and a discrimination of . A common slip is to write “at least one win in two draws” as , or to turn “the probability approaches ” into “some finite number of draws guarantees that it equals ”. Another trap is missing that “greater than nine-tenths” is a strict inequality.

Idea

Let be the number of draws until the first win. Then

This is the geometric distribution counted from : trials until the first success. Its expected value is

With tokens, the chance of at least one win comes from the complement:

Two draws give , not . Ten straight misses have probability , which is larger than the chance of winning on the first draw. A chance strictly above needs , and the least such integer is . Every finite still has , so the chance only approaches and is never guaranteed to equal .

What the figure shows

  • Drag At most n draws and compare with the nine-tenths threshold.
  • The histogram piles up ten thousand waits. Each wait is the number of trials until the first win, and the rightmost bin pools every .
  • The line underneath tracks the sample mean. As the sample grows, the line settles near the expected value .

Comments

Comment with a GitHub account.

← Back to exams