olymmath

Putnam 2007 B5

  • Session B

Let kk be a positive integer. Prove that there exist polynomials P0(n),P1(n),…,Pk−1(n)P_0(n), P_1(n), \dots, P_{k-1}(n) (which may depend on kk) such that for any integer nn, ⌊nk⌋k=P0(n)+P1(n)⌊nk⌋+⋯+Pk−1(n)⌊nk⌋k−1.\left\lfloor \frac{n}{k} \right\rfloor^k = P_0(n) + P_1(n) \left\lfloor \frac{n}{k} \right\rfloor + \cdots + P_{k-1}(n) \left\lfloor \frac{n}{k} \right\rfloor^{k-1}. (⌊a⌋\lfloor a \rfloor means the largest integer ≤a\leq a.)

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