Skip to content
Procedure

Ways to make a total from fixed sizes: fix the biggest size, then count the rest

Quantitative Aptitude • Permutations and Combinations

Statement

When a total must be made from pieces of a few sizes (coins, scoring shots), and only how many of each counts, not their order, list the cases by the largest size first. For each possible number of the largest piece, find what is left. Then try each possible number of the next size; the smallest size (often 1) fills whatever remains, in exactly one way. Add the counts of all cases.

How to use it

  1. 1Start with the largest piece: it has the fewest possible counts, so the list stays short.
  2. 2If the smallest piece is 1, it can always fill the rest, so each choice of the larger pieces is one way.
  3. 3Write a small table: number of largest piece, amount left, choices for the next piece.

Worked example

In how many ways can 12 rupees be paid using 1-rupee and 5-rupee coins and a 10-rupee note, order ignored?

Step-by-step

  1. 1
    With one 10: 2 is left, made only of 1s. That is 1 way.

    Why: A 5 does not fit into 2.

  2. 2
    With no 10: the 5s can be 0, 1 or 2, and 1s fill the rest. That is 3 ways.

    Why: Once the 5s are fixed, the 1s are forced.

  3. 3
    .

Answer

4 ways.

Watch out

Check whether a size may be used zero times; if the question needs at least one of each, count again with that rule. Counting different orders of the same pieces as different ways is the other usual mistake.

Also known as

counting solutions, number of ways to make a sum, coin change counting, case by case counting

Appears in past papers

2023

2019