olymmath

CMO 1989 Problem 1

  • Paper

The integers 1,2,...,n1,2,...,n are placed in order so that each value is either strictly bigger than all the preceding values or is strictly smaller than all preceding values. In how many ways can this be done?

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 ca-cmo/1989/p1 · Tag RZZ3TF85YR · Edit this page on GitHub · Keys: j next, k previous