olymmath

Putnam 2007 B6

  • Session B

For each positive integer nn, let f(n)f(n) be the number of ways to make n!n! cents using an unordered collection of coins, each worth k!k! cents for some kk, 1≤k≤n1 \leq k \leq n. Prove that for some constant CC, independent of nn, nn2/2−Cne−n2/4≤f(n)≤nn2/2+Cne−n2/4.n^{n^2/2 - Cn} e^{-n^2/4} \leq f(n) \leq n^{n^2/2 + Cn}e^{-n^2/4}.

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).

Similar problems

These problems have the most words in common with this statement.

Locator putnam/2007/b6 · Tag VN0RPJ4ZYS · Edit this page on GitHub · Keys: j next, k previous