uniolympiads Ελληνικά

IMC 2004, Day 2, Problem 2

Let f,g ⁣:[a,b]→[0,∞)f, g\colon [a, b] \to [0, \infty) be continuous and non-decreasing functions such that for each x∈[a,b]x \in [a, b] we have

∫axf(t) dt≤∫axg(t) dt\int_a^x \sqrt{f(t)}\,dt \le \int_a^x \sqrt{g(t)}\,dt

and ∫abf(t) dt=∫abg(t) dt\int_a^b \sqrt{f(t)}\,dt = \int_a^b \sqrt{g(t)}\,dt.

Prove that ∫ab1+f(t) dt≥∫ab1+g(t) dt\int_a^b \sqrt{1 + f(t)}\,dt \ge \int_a^b \sqrt{1 + g(t)}\,dt.

Original from the official PDF2. 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]

This transcription was compared symbol by symbol with the original, but not yet by a person.

Time on this problem 0:00

Work for at least 45 minutes before opening the solution.

Official solution

Solution. Let F(x)=∫axf(t) dtF(x) = \int_a^x \sqrt{f(t)}\,dt and G(x)=∫axg(t) dtG(x) = \int_a^x \sqrt{g(t)}\,dt. The functions F,GF, G are convex, F(a)=0=G(a)F(a) = 0 = G(a) and F(b)=G(b)F(b) = G(b) by the hypothesis. We are supposed to show that

∫ab1+(F′(t))2 dt≥∫ab1+(G′(t))2 dt\int_a^b \sqrt{1 + \left(F'(t)\right)^2}\,dt \ge \int_a^b \sqrt{1 + \left(G'(t)\right)^2}\,dt
i.e. The length ot the graph of FF is ≥\ge the length of the graph of GG. This is clear since both functions are convex, their graphs have common ends and the graph of FF is below the graph of GG — the length of the graph of FF 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 FF, if a convex polygon P1P_1 is contained in a polygon P2P_2 then the perimeter of P1P_1 is ≤\le the perimeter of P2P_2.

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?