Putnam 2007 B6
- Session B
For each positive integer , let be the number of ways to make cents using an unordered collection of coins, each worth cents for some , . Prove that for some constant , independent of ,
Curated text Kedlaya Putnam archive. Quoted with source.
Solutions
Human solution Solution 1 by Manjul Bhargava, Kiran Kedlaya and Lenny Ng
The terms of the source let olymmath link to this solution but not copy it. Read the solution (Kedlaya Putnam archive).