olymmath

CGMO 2002 Problem 5

    There are n≥2n \geq 2 permutations P1,P2,…,PnP_1, P_2, \ldots, P_n each being an arbitrary permutation of {1,…,n}.\{1,\ldots,n\}. Prove that

    ∑i=1n−11Pi+Pi+1>n−1n+2.\sum^{n-1}_{i=1} \frac{1}{P_i + P_{i+1}} > \frac{n-1}{n+2}.

    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 cn-gmo/2002/p5 · Tag QMZ0TX515Q · Edit this page on GitHub · Keys: j next, k previous