Permutations, combinations and probability in aptitude tests: how do you count without double counting?
Decide first whether order matters: permutations if it does, combinations if it does not. Divide out repeated items, and for "at least one" count the complement and subtract. Picking one item first and then the rest freely double counts, because each outcome is reached several ways.
Answer
Short answer
Ask one question first: does order matter? If it does, count permutations; if it does not, count combinations. Permutations and combinations questions then go wrong in two ways: counting the same outcome more than once, or adding probabilities that overlap. For "at least one", count the outcomes with none and subtract from the total.
Order matters: P(n, r) = n! / (n - r)!
Order does not: C(n, r) = n! / (r! (n - r)!)
At least one: total - none
Was this answer helpful?
Likely follow-ups
- How many ways can six people sit round a table if two of them refuse to sit next to each other?
- When does "with replacement" versus "without replacement" change the answer, and how do you show it in one line?
- A question asks for exactly two women rather than at least one. Which parts of the complement method still help?
- How would you check a counting answer quickly by listing a smaller version of the same problem?
Related questions
- Numerical reasoning tests give you percentages, ratios and data tables against the clock. Which shortcuts keep you fast and still accurate?mediumAlso on aptitude-tests4 min
- Syllogisms and seating arrangements: how do you avoid the answer that is designed to look right?mediumAlso on aptitude-tests5 min
- Time, speed and distance problems and work-rate problems keep eating your aptitude-test minutes. Is there one method that handles most of them?mediumAlso on aptitude-tests4 min
- What does it mean for a model to be calibrated, and why is an uncalibrated probability dangerous?mediumAlso on probability5 min