olymmath

Putnam 2009 B6

  • Session B

Prove that for every positive integer nn, there is a sequence of integers a0,a1,…,a2009a_0, a_1, \dots, a_{2009} with a0=0a_0 = 0 and a2009=na_{2009} = n such that each term after a0a_0 is either an earlier term plus 2k2^k for some nonnegative integer kk, or of the form b modcb\,\mathrm{mod} c for some earlier positive terms bb and cc. [Here b modcb\,\mathrm{mod} c denotes the remainder when bb is divided by cc, so 0≤(b modc)<c0 \leq (b\,\mathrm{mod} c) < c.]

Curated text Kedlaya Putnam archive. Quoted with source.

Solutions

Human solution Solution 1 by 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/2009/b6 · Tag 7YKYGRQ8E3 · Edit this page on GitHub · Keys: j next, k previous