MathDB
n-variable inequality in CGMO

Source: CGMO 2024 P7

August 14, 2024
inequalities

Problem Statement

Let nn be a positive integer. If x1,x2,,xn0x_1, x_2, \ldots, x_n \geq 0, x1+x2++xn=1x_1+x_2+\ldots+x_n=1 and, assuming xn+1=x1x_{n+1}=x_1, find the maximal value of k=1n1+xk2+xk41+xk+1+xk+12+xk+13+xk+14.\sum_{k=1}^n \frac{1+x_k^2+x_k^4}{1+x_{k+1}+x_{k+1}^2+x_{k+1}^3+x_{k+1}^4}.