Purses on a table
Source: Finnish Mathematics Competition 2003, Final Round, Problem 3
November 14, 2011
combinatorics unsolvedcombinatorics
Problem Statement
There are six empty purses on the table. How many ways are there to put 12 two-euro coins in purses in such a way that at most one purse remains empty?