olymmath

Putnam 2006 A4

  • Session A

Let S={1,2,…,n}S = \{1, 2, \dots, n\} for some integer n>1n > 1. Say a permutation π\pi of SS has a local maximum at k∈Sk \in S if

(i) π(k)>π(k+1)\pi(k) > \pi(k+1) for k=1k=1;

(ii) π(k−1)<π(k)\pi(k-1) < \pi(k) and π(k)>π(k+1)\pi(k) > \pi(k+1) for 1<k<n1 < k < n;

(iii) π(k−1)<π(k)\pi(k-1) < \pi(k) for k=nk=n.

(For example, if n=5n=5 and π\pi takes values at 1,2,3,4,51, 2, 3, 4, 5 of 2,1,4,5,32, 1, 4, 5, 3, then π\pi has a local maximum of 2 at k=1k=1, and a local maximum of 5 at k=4k=4.) What is the average number of local maxima of a permutation of SS, averaging over all permutations of SS?

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/2006/a4 · Tag A018A8J54M · Edit this page on GitHub · Keys: j next, k previous