olymmath

Putnam 2003 A5

  • Session A

A Dyck nn-path is a lattice path of nn upsteps (1,1)(1,1) and nn downsteps (1,−1)(1,-1) that starts at the origin OO and never dips below the xx-axis. A return is a maximal sequence of contiguous downsteps that terminates on the xx-axis. For example, the Dyck 5-path illustrated has two returns, of length 3 and 1 respectively. Show that there is a one-to-one correspondence between the Dyck nn-paths with no return of even length and the Dyck (n−1)(n-1)-paths.

Dataset text Putnam 1995 to 2025. Quoted with source.

Solutions

Human solution Solution 1 by Manjul Bhargava, 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/2003/a5 · Tag X7254VHK8C · Edit this page on GitHub · Keys: j next, k previous