IMC 2004, Day 2, Problem 2
Let be continuous and non-decreasing functions such that for each we have
and .
Prove that .
Original from the official PDF
![2. Let f, g : [a, b] → [0, ∞) be continuous and non-decreasing functions such that for each x ∈ [a, b] we have Z x p Z x p f (t) dt ≤ g(t) dt a a R b p R b p and a f (t) dt = a g(t) dt. R b p R b p Prove that a 1 + f (t) dt ≥ a 1 + g(t) dt. [20 points]](/archive/imc/imc-2004-d2-p2.png)
This transcription was compared symbol by symbol with the original, but not yet by a person.
Time on this problem
Work for at least 45 minutes before opening the solution.
Official solution
Solution. Let and . The functions are convex, and by the hypothesis. We are supposed to show that
i.e. The length ot the graph of is the length of the graph of . This is clear since both functions are convex, their graphs have common ends and the graph of is below the graph of — the length of the graph of is the least upper bound of the lengths of the graphs of piecewise linear functions whose values at the points of non-differentiability coincide with the values of , if a convex polygon is contained in a polygon then the perimeter of is the perimeter of .
Transcribed from the official solutions, page 1. 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.