This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 2

2010 N.N. Mihăileanu Individual, 2

Let be a sequence of functions $ \left( f_n \right)_{n\ge 2}:\mathbb{R}_{\ge 0}\longrightarrow\mathbb{R} $ defined, for each $ n\ge 2, $ as $$ f_n(x)=2nx^{2+n} -2(n+2)x^{1+n} +(2+n)x +1. $$ [b]a)[/b] Prove that $ f_n $ has an unique local maxima $ x_n, $ for any $ n\ge 2. $ [b]b)[/b] Show that $ 1=\lim_{n\to\infty } x_n. $ [i]Cătălin Zîrnă[/i]

2010 N.N. Mihăileanu Individual, 3

Consider a countinuous function $ f:\mathbb{R}_{>0}\longrightarrow\mathbb{R}_{>0} $ that verifies the following conditions: $ \text{(1)} x f(f(x))=(f(x))^2,\quad\forall x\in\mathbb{R}_{>0} $ $ \text{(2)} \lim_{\stackrel{x\to 0}{x>0}} \frac{f(x)}{x}\in\mathbb{R}\cup\{ \pm\infty \} $ [b]a)[/b] Show that $ f $ is bijective. [b]b)[/b] Prove that the sequences $ \left( (\underbrace{f\circ f\circ\cdots \circ f}_{\text{n times}} ) (x) \right)_{n\ge 1} ,\left( (\underbrace{f^{-1}\circ f^{-1}\circ\cdots \circ f^{-1}}_{\text{n times}} ) (x) \right)_{n\ge 1} $ are both arithmetic progressions, for any fixed $ x\in\mathbb{R}_{>0} . $ [b]c)[/b] Determine the function $ f. $ [i]Nelu Chichirim[/i]