olymmath

Putnam 1965 A5

  • Session A

In how many ways can the integers from 1 to nn be ordered subject to the condition that, except for the first integer on the left, every integer differs by 1 from some integer to the left of it?

Dataset text Putnam-AXIOM. 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/1965/a5 · Tag DF22FN9W0G · Edit this page on GitHub · Keys: j next, k previous