HMMT 2010 C5
- Combinatorics
John needs to pay 2010 dollars for his dinner. He has an unlimited supply of 2, 5, and 10 dollar notes. In how many ways can he pay?
Dataset text NuminaMath olympiads. Quoted with source.
Also HMMT 2010 E6.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.