Let $a,b,c$ be positive real numbers such that $a+b+c=1$. Prove that $$\frac{a^2}{(b+c)^3}+\frac{b^2}{(c+a)^3}+\frac{c^2}{(a+b)^3}\geq \frac98$$

Let $a, b,$ and $c$ be positive real numbers such that $a^2 + b^2 + c^2 = 3$. Prove that $$\frac{a^2 + b^2}{2ab} + \frac{b^2 + c^2}{2bc} + \frac{c^2 + a^2}{2ca} + \frac{2(ab + bc + ca)}{3} \ge 5 + |(a - b)(b - c)(c - a)|.$$

In an acute-angled triangle $ABC$, $a,b,c$ are sides, $m_a,m_b,m_c$ the corresponding medians, $R$ the circumradius and $r$ the inradius. Prove the inequality $$\frac{a^2+b^2}{a+b}\cdot\frac{b^2+c^2}{b+c}\cdot\frac{a^2+c^2}{a+c}\ge16R^2r\frac{m_a}a\cdot\frac{m_b}b\cdot\frac{m_c}c.$$

Find all pairs $(a,b)$ of real numbers such that $$|\sqrt{1-x^2 }-ax-b| \leq \frac{\sqrt{2} -1}{2}$$ holds for all $x\in [0,1]$.

For all real numbers $a,b,c>0$ such that $abc=1$, prove that $\frac{a}{1+b^3}+\frac{b}{1+c^3}+\frac{c}{1+a^3}\geq \frac{3}{2}$.

Let $(x_n)_{n=1}^\infty$ be a sequence defined recursively with: $x_1=2$ and $x_{n+1}=\frac{x_n(x_n+n)}{n+1}$ for all $n \ge 1$. Prove that $$n(n+1) >\frac{(x_1+x_2+ \ldots +x_n)^2}{x_{n+1}}.$$ [i]Proposed by Nikola Velov[/i]

Prove that $0\le yz+zx+xy-2xyz\le{7\over27}$, where $x,y$ and $z$ are non-negative real numbers satisfying $x+y+z=1$.

Let $f$ be an injective function from ${1,2,3,\ldots}$ in itself. Prove that for any $n$ we have: $\sum_{k=1}^{n} f(k)k^{-2} \geq \sum_{k=1}^{n} k^{-1}.$

Let $a,b,c\geq 0$ and $a+b+c=1.$ Prove that$$\frac{a}{2a+1}+\frac{b}{3b+1}+\frac{c}{6c+1}\leq \frac{1}{2}.$$ [size=50](Marian Dinca)[/size]

Prove that for all non-negative real numbers $x,y,z$, not all equal to $0$, the following inequality holds $\displaystyle \dfrac{2x^2-x+y+z}{x+y^2+z^2}+\dfrac{2y^2+x-y+z}{x^2+y+z^2}+\dfrac{2z^2+x+y-z}{x^2+y^2+z}\geq 3.$ Determine all the triples $(x,y,z)$ for which the equality holds. [i]Milan Mitreski, Serbia[/i]

Let $x, y, z$ be positive real numbers such that $2(xy + yz + zx) = xyz$. Prove that $\frac{1}{(x-2)(y-2)(z-2)} + \frac{8}{(x+2)(y+2)(z+2)} \le \frac{1}{32}$

Find the minimum value of \[\max(a + b + c, b + c + d, c + d + e, d + e + f, e + f + g)\] subject to the constraints (i) $a, b, c, d, e, f, g \geq 0,$ (ii)$ a + b + c + d + e + f + g = 1.$

Prove that among any $9$ distinct real numbers, there exist $4$ distinct numbers $a,b,c,d$ such that $$(ac+bd)^2\ge\frac{9}{10}(a^2+b^2)(c^2+d^2)$$

Find the smallest positive real number $\lambda$ such that for every numbers $a_1,a_2,a_3 \in \left[0, \frac{1}{2} \right]$ and $b_1,b_2,b_3 \in (0, \infty)$ with $\sum\limits_{i=1}^3a_i=\sum\limits_{i=1}^3b_i=1,$ we have $$b_1b_2b_3 \le \lambda (a_1b_1+a_2b_2+a_3b_3).$$

Let $a,b,c$ be positive real numbers such that $a+b+c=1$. Prove that \[\frac {a}{b} + \frac {a}{c} + \frac {c}{b} + \frac {c}{a} + \frac {b}{c} + \frac {b}{a} + 6 \geq 2\sqrt{2}\left (\sqrt{\frac{1-a}{a}} + \sqrt{\frac{1-b}{b}} + \sqrt{\frac{1-c}{c}}\right ).\] When does equality hold?

Let x; y; z be real numbers, satisfying the relations $x \ge 20$ $y \ge 40$ $z \ge 1675$ x + y + z = 2015 Find the greatest value of the product P = $x
y z$

Let $a,b,c\ge 0$ and $a+b+c=\sqrt2$. Show that \[\frac1{\sqrt{1+a^2}}+\frac1{\sqrt{1+b^2}}+\frac1{\sqrt{1+c^2}} \ge 2+\frac1{\sqrt3}\] [hide] In general if $a_1, a_2, \cdots , a_n \ge 0$ and $\sum_{i=1}^n a_i=\sqrt2$ we have \[\sum_{i=1}^n \frac1{\sqrt{1+a_i^2}} \ge (n-1)+\frac1{\sqrt3}\] [/hide]

Let $ A_0 \equal{} (a_1,\dots,a_n)$ be a finite sequence of real numbers. For each $ k\geq 0$, from the sequence $ A_k \equal{} (x_1,\dots,x_k)$ we construct a new sequence $ A_{k \plus{} 1}$ in the following way. 1. We choose a partition $ \{1,\dots,n\} \equal{} I\cup J$, where $ I$ and $ J$ are two disjoint sets, such that the expression \[ \left|\sum_{i\in I}x_i \minus{} \sum_{j\in J}x_j\right| \] attains the smallest value. (We allow $ I$ or $ J$ to be empty; in this case the corresponding sum is 0.) If there are several such partitions, one is chosen arbitrarily. 2. We set $ A_{k \plus{} 1} \equal{} (y_1,\dots,y_n)$ where $ y_i \equal{} x_i \plus{} 1$ if $ i\in I$, and $ y_i \equal{} x_i \minus{} 1$ if $ i\in J$. Prove that for some $ k$, the sequence $ A_k$ contains an element $ x$ such that $ |x|\geq\frac n2$. [i]Author: Omid Hatami, Iran[/i]

Real number $C > 1$ is given. Sequence of positive real numbers $a_1, a_2, a_3, \ldots$, in which $a_1=1$ and $a_2=2$, satisfy the conditions \[a_{mn}=a_ma_n, \] \[a_{m+n} \leq C(a_m + a_n),\] for $m, n = 1, 2, 3, \ldots$. Prove that $a_n = n$ for $n=1, 2, 3, \ldots$.

Let $(a_n)_{n=1}^{\infty}$ be a strictly increasing sequence such that inequality $$a_n(a_n-2a_{n-1})+a_{n-1}(a_{n-1}-2a_{n-2})\geq 0$$ holds for all $n \geq 3$. Prove that for all $n\geq2$ the inequality $$a_n \geq a_{n-1}+a_{n-2}+\dots+a_1$$ holds as well.

Let $n$ be a positive integer. Let $\sigma(n)$ be the sum of the natural divisors $d$ of $n$ (including $1$ and $n$). We say that an integer $m \geq 1$ is [i]superabundant[/i] (P.Erdos, $1944$) if $\forall k \in \{1, 2, \dots , m - 1 \}$, $\frac{\sigma(m)}{m} >\frac{\sigma(k)}{k}.$ Prove that there exists an infinity of [i]superabundant[/i] numbers.

[i]Version 1[/i]. Let $n$ be a positive integer, and set $N=2^{n}$. Determine the smallest real number $a_{n}$ such that, for all real $x$, \[ \sqrt[N]{\frac{x^{2 N}+1}{2}} \leqslant a_{n}(x-1)^{2}+x . \] [i]Version 2[/i]. For every positive integer $N$, determine the smallest real number $b_{N}$ such that, for all real $x$, \[ \sqrt[N]{\frac{x^{2 N}+1}{2}} \leqslant b_{N}(x-1)^{2}+x . \]

Let there be $2n$ positive reals $a_1,a_2,...,a_{2n}$. Let $s = a_1 + a_3 +...+ a_{2n-1}$, $t = a_2 + a_4 + ... + a_{2n}$, and $x_k = a_k + a_{k+1} + ... + a_{k+n-1}$ (indices are taken modulo $2n$). Prove that $$\frac{s}{x_1}+\frac{t}{x_2}+\frac{s}{x_3}+\frac{t}{x_4}+...+\frac{s}{x_{2n-1}}+\frac{t}{x_{2n}}>\frac{2n^2}{n+1}$$

The real numbers $a_0,a_1,a_2,\ldots$ satisfy $1=a_0\le a_1\le a_2\le\ldots. b_1,b_2,b_3,\ldots$ are defined by $b_n=\sum_{k=1}^n{1-{a_{k-1}\over a_k}\over\sqrt a_k}$. [b]a.)[/b] Prove that $0\le b_n<2$. [b]b.)[/b] Given $c$ satisfying $0\le c<2$, prove that we can find $a_n$ so that $b_n>c$ for all sufficiently large $n$.

Let $n\geqslant 1$ be an integer, and let $x_0,x_1,\ldots,x_{n+1}$ be $n+2$ non-negative real numbers that satisfy $x_ix_{i+1}-x_{i-1}^2\geqslant 1$ for all $i=1,2,\ldots,n.$ Show that \[x_0+x_1+\cdots+x_n+x_{n+1}>\bigg(\frac{2n}{3}\bigg)^{3/2}.\][i]Pakawut Jiradilok and Wijit Yangjit, Thailand[/i]