When the sample space has equally likely outcomes, computing a probability becomes a counting problem: it is enough to count the favourable cases and the possible cases. The formulae of combinatorics then come into play — simple combinations, arrangements with repetition, the counting principle — and the choice of the right formula depends on two questions: does the order matter? are repetitions allowed? This section collects some classic examples, from the lottery to the safe to playing cards.