olymmath

ILL 1983 Problem 17

    In how many ways can 1,2,…,2n1, 2,\ldots, 2n be arranged in a 2×n2 \times n rectangular array (a1a2⋯anb1b2⋯bn)\left(\begin{array}{cccc}a_1& a_2 & \cdots & a_nb_1& b_2 & \cdots & b_n\end{array}\right) for which:(i) a1<a2<⋯<an,a_1 < a_2 < \cdots < a_n, (ii) b1<b2<⋯<bn,b_1 < b_2 <\cdots < b_n, (iii) a1<b1,a2<b2,…,an<bn ?a_1 < b_1, a_2 < b_2, \ldots, a_n < b_n \ ?

    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 ill/1983/p17 · Tag VFATP1PPKM · Edit this page on GitHub · Keys: j next, k previous