Maths Olympiad Prep

Library / /27 of 45

Combinatorics Difficulty 5.9 AIME, harder Prove it Romania

Consider a function f:R[0,)f : \mathbb{R} \to [0, \infty). Prove that ff satisfies the inequality f(x+y)(1+y)f(x)f(x+y) \ge (1+y)f(x) for any xRx \in \mathbb{R} and any y0y \ge 0, if and only if the function g:R[0,)g : \mathbb{R} \to [0, \infty) defined by g(x)=exf(x)g(x) = e^{-x}f(x), for xRx \in \mathbb{R}, is non-decreasing.

Solution

The inequality ey1+ye^y \ge 1+y, holds for all yRy \in \mathbb{R}. Assume the function gg is monotonously increasing on R\mathbb{R}. Then, based on the inequality above, we get
f(x+y)=ex+yg(x+y)ex(1+y)g(x)=(1+y)f(x), f(x + y) = e^{x+y}g(x + y) \ge e^x(1 + y)g(x) = (1 + y)f(x),
for all xRx \in \mathbb{R} and all y0y \ge 0.

Conversely, assume f(x+y)(1+y)f(x)f(x + y) \ge (1 + y)f(x), for all xRx \in \mathbb{R} and all y0y \ge 0. One can check by induction
f(x+nt)(1+t)nf(x), f(x + nt) \ge (1 + t)^n f(x),
for all xRx \in \mathbb{R}, t0t \ge 0 and nNn \in \mathbb{N}. Let x,zRx, z \in \mathbb{R}, with x<zx < z.
Denote y=zxy = z - x. For nNn \in \mathbb{N}^* we have
g(z)=ezf(z)=exyf(x+nyn)exy(1+yn)nf(x)=(1+yn)neyg(x). g(z) = e^{-z}f(z) = e^{-x-y}f\left(x + n\frac{y}{n}\right) \ge e^{-x-y}\left(1 + \frac{y}{n}\right)^n f(x) = \frac{\left(1 + \frac{y}{n}\right)^n}{e^y}g(x).
It follows
g(z)limn(1+yn)neyg(x)=g(x), g(z) \ge \lim_{n \to \infty} \frac{\left(1 + \frac{y}{n}\right)^n}{e^y} g(x) = g(x),
therefore gg is monotonously increasing on R\mathbb{R}.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.