olymmath

ILL 1983 Problem 16

    Suppose that x1,x2,…,xn{x_1, x_2, \dots , x_n} are positive integers for which x1+x2+⋯+xn=2(n+1)x_1 + x_2 + \cdots+ x_n = 2(n + 1). Show that there exists an integer rr with 0≤r≤n−10 \leq r \leq n - 1 for which the following n−1n - 1 inequalities hold: xr+1+⋯+xr+i≤2i+1,∀i,1≤i≤n−r;x_{r+1} + \cdots + x_{r+i} \leq 2i+ 1, \forall i, 1 \leq i \leq n - r;

    xr+1+⋯+xn+x1+⋯+xi≤2(n−r+i)+1,∀i,1≤i≤r−1.x_{r+1} + \cdots + x_n + x_1 + \cdots+ x_i \leq 2(n - r + i) + 1, \forall i, 1 \leq i \leq r - 1.

    Prove that if all the inequalities are strict, then rr is unique and that otherwise there are exactly two such r.r.

    Dataset text AoPS wiki problems. 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/p16 · Tag NZCDD033N3 · Edit this page on GitHub · Keys: j next, k previous