Skip to content
Technique

Sharing with a minimum for each: hand out the minimum first, then share the rest

Quantitative Aptitude • Permutations and Combinations

Statement

Counting whole-number solutions of with each at least 1 is the same as giving 1 to each of , , first and then sharing the remaining freely (zero allowed). Each free share matches exactly one solution, so the two counts are equal. The same works for any number of groups and any minimum.

How to use it

  1. 1Spot the words 'natural numbers', 'positive', or 'at least one each': each group has a minimum.
  2. 2Take the minimums away from the total, then count the ways to share what is left with zero allowed: list the splits, then the orders.

Worked example

In how many ways can 5 identical sweets go to 3 children if each child gets at least one?

Step-by-step

  1. 1
    Give each child 1 sweet first: sweets are left.

    Why: This uses up the rule 'at least one', so the rest can be shared freely.

  2. 2
    Split 2 as or .

    Why: List the splits from largest part down.

  3. 3
    : 3 ways (which child gets both). : 3 ways (which child gets none).

    Why: A split counts once for each way to hand its parts to the named children.

  4. 4
    Total .

Answer

6

Watch out

Read whether zero is allowed: 'natural number' and 'positive' rule it out, 'whole number' and 'non-negative' allow it. Counting only unordered splits forgets that the groups have names.

Builds on

Also known as

positive integer solutions, natural number solutions of x + y + z = n, at least one each, distribute with minimum

Appears in past papers

2019