olymmath

Putnam 2024 B5

  • Session B

Let kk and mm be positive integers. For a positive integer nn, let f(n)f(n) be the number of integer sequences x1,…,xk,y1,…,ym,zx_1,\dots,x_k,y_1,\dots,y_m,z satisfying 1≤x1≤⋯≤xk≤z≤n1 \leq x_1 \leq \cdots \leq x_k \leq z \leq n and 1≤y1≤⋯≤ym≤z≤n1 \leq y_1 \leq \cdots \leq y_m \leq z \leq n. Show that f(n)f(n) can be expressed as a polynomial in nn with nonnegative coefficients.

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/2024/b5 · Tag 5C1XH1Y91Z · Edit this page on GitHub · Keys: j next, k previous