Problem 5
For each positive integer , the Bank of Cape Town issues coins of denomination . Given a finite collection of such coins (of not necessarily different denominations) with total value at most , prove that it is possible to split this collection into or fewer groups, such that each group has total value at most .
Step 5 of 6: An averaging argument always finds room
Detailed analysis
Insert the pile coins one at a time. If the next coin could fit in no box, every box would have value greater than , so their total would exceed . But the remaining total is at most , and , a contradiction. Hence every pile coin fits while keeping each box at most .