olymmath

CN-SMO 2013 Problem 8

    n≥3n\geq 3 is a integer. α,β,γ∈(0,1)\alpha,\beta,\gamma \in (0,1) . For every ak,bk,ck≥0(k=1,2,…,n)a_k,b_k,c_k\geq0(k=1,2,\dotsc,n) with ∑k=1n(k+α)ak≤α,∑k=1n(k+β)bk≤β,∑k=1n(k+γ)ck≤γ\sum\limits_{k=1}^n(k+\alpha)a_k\leq \alpha, \sum\limits_{k=1}^n(k+\beta)b_k\leq \beta, \sum\limits_{k=1}^n(k+\gamma)c_k\leq \gamma , we always have ∑k=1n(k+λ)akbkck≤λ\sum\limits_{k=1}^n(k+\lambda)a_kb_kc_k\leq \lambda . Find the minimum of λ\lambda

    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-smo/2013/p8 · Tag CWJBZ8B8NC · Edit this page on GitHub · Keys: j next, k previous