olymmath

Putnam 1984 B5

  • Session B

For each nonnegative integer kk , let d(k)d(k) denote the number of 11 's in the binary expansion of kk . Let mm be a positive integer. Express ∑k=02m−1(−1)d(k)km\sum_{k=0}^{2^m-1}(-1)^{d(k)}k^m in the form (−1)maf(m)g(m)!(-1)^ma^{f(m)}g(m)! , where aa is an integer and ff and gg are polynomials.

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

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

Locator putnam/1984/b5 · Tag W9ZTQ9EQS7 · Edit this page on GitHub · Keys: j next, k previous