olymmath

Putnam 2010 B3

  • Session B

There are 2010 boxes labeled B1,B2,…,B2010B_1, B_2, \dots, B_{2010}, and 2010n2010n balls have been distributed among them, for some positive integer nn. You may redistribute the balls by a sequence of moves, each of which consists of choosing an ii and moving exactly ii balls from box BiB_i into any one other box. For which values of nn is it possible to reach the distribution with exactly nn balls in each box, regardless of the initial distribution of balls?

Curated text Kedlaya Putnam archive. 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

Locator putnam/2010/b3 · Tag Y2V3V8Q5GK · Edit this page on GitHub · Keys: j next, k previous