BxMO 2021 Problem 1
(a) Prove that for all with ,
(b) Find the largest non-negative integer such that it is possible to replace of the six maxima in this inequality by minima in such a way that the inequality still holds for all with .
Dataset text NuminaMath olympiads. 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.