Skip to content
Technique

'At least one' counts: count everything, then take away the ways that break the rule

Quantitative Aptitude • Permutations and Combinations

Statement

If every arrangement either meets the rule or breaks it, then (ways that meet it) (all ways) (ways that break it). This helps when the rule is 'at least one', because the opposite, 'none at all', is usually a single small case.

How to use it

  1. 1Count all the ways, ignoring the rule.
  2. 2Turn the rule round: 'at least one' becomes 'none'. Count those ways.
  3. 3Subtract the second count from the first.

Worked example

From 5 boys and 3 girls, in how many ways can a team of 3 be picked with at least one boy?

Step-by-step

  1. 1
    All teams of 3 from 8: .

    Why: Start without the rule.

  2. 2
    Teams with no boy: all 3 girls, which is 1 way.

    Why: 'At least one boy' fails only when there are no boys.

  3. 3
    .

Answer

55

Watch out

Counting 'one boy, then any two others' counts the same team more than once. Make sure the opposite case is turned round correctly: the opposite of 'at least one' is 'none', not 'exactly one'.

Builds on

Also known as

complement counting, total minus unwanted, at least one

Appears in past papers

2022

2020

2017