olymmath

CWMO 2006 Problem 1

    Let nn be a positive integer with n≥2n \geq 2 , and 0<a1,a2,...,an<10<a_{1}, a_{2},...,a_{n}< 1 . Find the maximum value of the sum ∑i=1n(ai(1−ai+1))16\sum_{i=1}^{n}(a_{i}(1-a_{i+1}))^{\frac{1}{6}} where an+1=a1a_{n+1}=a_{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 cn-wmo/2006/p1 · Tag GNSE3PWXJJ · Edit this page on GitHub · Keys: j next, k previous