Bourbaki

Exercise 11, Appendix 0

Functions of a Real Variable, V, 265

Let ff be an increasing function, continuous and ≥0\geq 0, defined for x≥0x \geq 0, and such that f(x)≫en(x)f(x) \gg e_n(x) for every integer nn; show that, if gg is the inverse function of ff, one has 1≪g(x)≪ln(x)1 \ll g(x) \ll l_n(x) for every integer nn.

Solution

No solution has been written yet.

Transcribed from the printed volume. Not translated.