IMC 2016, Day 2, Problem 7
Today, Ivan the Confessor prefers continuous functions satisfying for all pairs . Find the minimum of over all preferred functions.
Original from the official PDF
![Today, Ivan the Confessor prefers continuous functions f : [0, 1] → R satisfying f (x) + f (y) ⩾ |x − y| for all pairs x, y ∈ [0, 1] . Find the minimum of R 1 0 f over all preferred functions.](/archive/imc/imc-2016-d2-p7.png)
This transcription was compared symbol by symbol with the original, but not yet by a person.
Work for at least 45 minutes before opening the solution.
Official solution
(Proposed by Fedor Petrov, St. Petersburg State University)
Solution. The minimum of is .
Applying the condition with , we get
Transcribed from the official solutions, pages 1–2. This transcription has not been checked a second time; if in doubt, look at the original.
Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.
How did it go?
Moves you mark come back sooner in triage.