FI-MO 2003 Problem 3
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?
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.