olymmath

RO-TST 1996 Problem 9

    Let n≥3n\geq 3 be an integer and let x1,x2,…,xn−1x_1,x_2,\ldots,x_{n-1} be nonnegative integers such that

    \begin{eqnarray*} \ x_1 + x_2 + \cdots + x_{n-1} &=& n x_1 + 2x_2 + \cdots + (n-1)x_{n-1} &=& 2n-2. \end{eqnarray*}

    Find the minimal value of F(x1,x2,…,xn)=∑k=1n−1k(2n−k)xkF(x_1,x_2,\ldots,x_n) = \sum_{k=1}^{n-1} k(2n-k)x_k .

    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 ro-tst/1996/p9 · Tag 5G6J9R4169 · Edit this page on GitHub · Keys: j next, k previous