Maths Olympiad Prep

Library / NMO Selection Tests for BMO and IMO /17 of 47

NMO Selection Tests for BMO and IMO

Algebra Difficulty 7.9 National Olympiad, round 2 Prove it Romania

Let aa be a real number in the open interval (0,1)(0, 1), let nn be a positive integer and let fn:R→Rf_n: \mathbb{R} \to \mathbb{R}, fn(x)=x+x2/nf_n(x) = x + x^2/n. Show that

a(1−a)n2+2a2n+a3(1−a)2n2+a(2−a)n+a2<(fn∘⋯∘fn)⏟n(a)<an+a2(1−a)n+a. \frac{a(1-a)n^2 + 2a^2n + a^3}{(1-a)^2n^2 + a(2-a)n + a^2} < \underbrace{(f_n \circ \dots \circ f_n)}_{n} (a) < \frac{an + a^2}{(1-a)n + a}.

Solution

Let ak=(fn∘⋯∘fn)⏟k(a)a_k = \underbrace{(f_n \circ \cdots \circ f_n)}_{k}(a), k∈Nk \in \mathbb{N}, and notice that
1/ak+1=1/ak−1/(ak+n),k∈N, 1/a_{k+1} = 1/a_k - 1/(a_k + n), \quad k \in \mathbb{N},
to deduce that 1/an=1/a−∑k=0n−11/(ak+n)1/a_n = 1/a - \sum_{k=0}^{n-1} 1/(a_k + n), so
1/a−n/(a+n)<1/an<1/a−n/(an+n),(∗) 1/a - n/(a+n) < 1/a_n < 1/a - n/(a_n + n), \quad (*)
an<an+a2(1−a)n+aa_n < \frac{an + a^2}{(1-a)n + a}.
Plugged into the rightmost expression in (∗)(*), this upper bound yields the required lower bound,
an>a(1−a)n2+2a2n+a3(1−a)2n2+a(2−a)n+a2. a_n > \frac{a(1-a)n^2 + 2a^2n + a^3}{(1-a)^2n^2 + a(2-a)n + a^2}.

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

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.