olymmath

Putnam 2025 A5

  • Session A

Let nn be an integer with n≥2n \geq 2. For a sequence s=(s1,…,sn−1)s = (s_1,\dots,s_{n-1}) where each si=±1s_i = \pm 1, let f(s)f(s) be the number of permutations (a1,…,an)(a_1,\dots,a_n) of {1,2,…,n}\{1,2,\dots,n\} such that si(ai+1−ai)>0s_i(a_{i+1}-a_i) > 0 for all ii. For each nn, determine the sequences ss for which f(s)f(s) is maximal.

Curated text Kedlaya Putnam archive. 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/2025/a5 · Tag 5E0M0GDJZS · Edit this page on GitHub · Keys: j next, k previous