Unofficial archive — problems, solutions & results © IMC, reproduced with permission.

IMC / 2004 / Problems / Day 2, P8

IMC 2004 · Day 2 · P8

medium

Let f,g:[a,b][0,)f, g : [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)dtaxg(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)dtab1+g(t)dt\int_a^b \sqrt{1 + f(t)}\,dt \ge \int_a^b \sqrt{1 + g(t)}\,dt.

Solution (official)

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))2dtab1+(G(t))2dt\int_a^b \sqrt{1 + \bigl( F'(t) \bigr)^2}\,dt \ge \int_a^b \sqrt{1 + \bigl( G'(t) \bigr)^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.

How the field did

contestants scored
176
average (of 20)
8.26
solved (≥ 80%)
30.7%
near-0 (≤ 10%)
44.3%
discrimination
0.48

Score distribution (field cohort)

Computed on contestants with a meaningful total (field cohort); discrimination is the corrected item–total correlation.

Similar problems

IMC 2019 · Day 1 · P3mediumavg 5.3/10 · solved 41% · near-0 27% · disc 0.48
IMC 2005 · Day 1 · P3hardavg 2.6/10 · solved 20% · near-0 63% · disc 0.51
IMC 2025 · Day 1 · P2hardavg 2.7/10 · solved 20% · near-0 62% · disc 0.37
IMC 2004 · Day 2 · P11very hardavg 1.1/10 · solved 9% · near-0 84% · disc 0.21