olymmath

OIM 2018 Problem 5

    Let nn be a positive integer. For a permutation a1,a2,…,ana_1, a_2, \dots, a_n of the numbers 1,2,…,n1, 2, \dots, n we define bk=min⁡1≤i≤kai+max⁡1≤j≤kajb_k = \min_{1 \leq i \leq k} a_i + \max_{1 \leq j \leq k} a_j We say that the permutation a1,a2,…,ana_1, a_2, \dots, a_n is guadiana if the sequence b1,b2,…,bnb_1, b_2, \dots, b_n does not contain two consecutive equal terms. How many guadiana permutations exist?

    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 ibero/2018/p5 · Tag TWPKA2NY72 · Edit this page on GitHub · Keys: j next, k previous