olymmath

DANUBE 2007 Problem 1

    Let n≥2n\ge2 be a positive integer and denote by SnS_n the set of all permutations of the set {1,2,…,n}\{1,2,\ldots,n\} . For σ∈Sn\sigma\in S_n define l(σ)l(\sigma) to be min⁡1≤i≤n−1∣σ(i+1)−σ(i)∣\min_{1\le i\le n-1}\left|\sigma(i+1)-\sigma(i)\right| . Determine max⁡σ∈Snl(σ)\max_{\sigma\in S_n}l(\sigma) .

    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 danube/2007/p1 · Tag 2PKNCBGG3G · Edit this page on GitHub · Keys: j next, k previous