olymmath

ISL 1991 Problem 26

    Let n≥2,n∈Nn \geq 2, n \in \mathbb{N} and let p,a1,a2,…,an,b1,b2,…,bn∈Rp, a_1, a_2, \ldots, a_n, b_1, b_2, \ldots, b_n \in \mathbb{R} satisfying 12≤p≤1,\frac{1}{2} \leq p \leq 1, 0≤ai,0 \leq a_i, 0≤bi≤p,0 \leq b_i \leq p, i=1,…,n,i = 1, \ldots, n, and ∑i=1nai=∑i=1nbi.\sum^n_{i=1} a_i = \sum^n_{i=1} b_i. Prove the inequality: ∑i=1nbi∏j=1,j≠inaj≤p(n−1)n−1.\sum^n_{i=1} b_i \prod^n_{j = 1, j \neq i} a_j \leq \frac{p}{(n-1)^{n-1}}.

    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 isl/1991/p26 · Tag 6T8PVJ8BWQ · Edit this page on GitHub · Keys: j next, k previous