olymmath

OMM 2018 Problem 4

    Let n≥2n\geq 2 be an integer. For each kk -tuple of positive integers a1,a2,…,aka_1, a_2, \ldots, a_k such that a1+a2+⋯+ak=na_1+a_2+\cdots +a_k=n , consider the sums Si=1+2+…+aiS_i=1+2+\ldots +a_i for 1≤i≤k1\leq i\leq k . Determine, in terms of nn , the maximum possible value of the product S1S2⋯SkS_1S_2\cdots S_k .

    Proposed by Misael Pelayo

    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 mx-omm/2018/p4 · Tag F1EPPJMBHS · Edit this page on GitHub · Keys: j next, k previous