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

Let $a_{1},a_{2},\ldots ,a_{n}$ be positive real numbers such that $a_{1}+a_{2}+\cdots +a_{n}<1$. Prove that \[ \frac{a_{1} a_{2} \cdots a_{n} \left[ 1 - (a_{1} + a_{2} + \cdots + a_{n}) \right] }{(a_{1} + a_{2} + \cdots + a_{n})( 1 - a_{1})(1 - a_{2}) \cdots (1 - a_{n})} \leq \frac{1}{ n^{n+1}}. \]
For non-negative real numbers $a,$ $b$ let $A(a, b)$ be their arithmetic mean and $G(a, b)$ their geometric mean. We consider the sequence $\langle a_n \rangle$ with $a_0 = 0,$ $a_1 = 1$ and $a_{n+1} = A(A(a_{n-1}, a_n), G(a_{n-1}, a_n))$ for $n > 0.$ (a) Show that each $a_n = b^2_n$ is the square of a rational number (with $b_n \geq 0$). (b) Show that the inequality $\left|b_n - \frac{2}{3}\right| < \frac{1}{2^n}$ holds for all $n > 0.$