Prove that for an arbitrary pair of vectors $f$ and $g$ in the space the inequality \[af^2 + bfg +cg^2 \geq 0\] holds if and only if the following conditions are fulfilled: \[a \geq 0, \quad c \geq 0, \quad 4ac \geq b^2.\]

Consider the complex numbers $x,y,z$ such that $|x|=|y|=|z|=1$. Define the number $$a=\left (1+\frac xy\right )\left (1+\frac yz\right )\left (1+\frac zx\right ).$$ $\textbf{(a)}$ Prove that $a$ is a real number. $\textbf{(b)}$ Find the minimal and maximal value $a$ can achieve, when $x,y,z$ vary subject to $|x|=|y|=|z|=1$. [i] (Stefan Bălăucă & Vlad Robu)[/i]

Let $x_1, ..., x_n$ ($n \ge 2$) be real numbers from the interval $[1, 2]$. Prove that $|x_1 - x_2| + ... + |x_n - x_1| \le \frac{2}{3}(x_1 + ... + x_n)$, with equality holding if and only if $n$ is even and the $n$-tuple $(x_1, x_2, ..., x_{n - 1}, x_n)$ is equal to $(1, 2, ..., 1, 2)$ or $(2, 1, ..., 2, 1)$.

Are there any real numbers $a,b,c$ such that $a+b+c=6$, $ab+bc+ca=9$ and $a^4+b^4+c^4=260$? What about if we let $a^4+b^4+c^4=210$? [i] (Andrei Bâra)[/i]

let $a\le b\le c \le d$ show that: $$ab^3+bc^3+cd^3+da^3\ge a^2b^2+b^2c^2+c^2d^2+d^2a^2$$

The symbol $|a|$ means $+a$ if $a$ is greater than or equal to zero, and $-a$ if $a$ is less than or equal to zero; the symbol $<$ means "less than"; the symbol $>$ means "greater than." The set of values $x$ satisfying the inequality $|3-x|<4$ consists of all $x$ such that: $ \textbf{(A)}\ x^2<49 \qquad\textbf{(B)}\ x^2>1 \qquad\textbf{(C)}\ 1<x^2<49\qquad\textbf{(D)}\ -1<x<7\qquad\textbf{(E)}\ -7<x<1 $

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]

All sides of a convex polygon were decreased in such a way that they formed a new convex polygon. Is it possible that all diagonals were increased?

Let $ a, b, c $ be the side lengths of a triangle. Prove that $$ \displaystyle\sum_{cyc} \frac{(a^2 + b^2)(a + c)}{b} \ge 2(a^2 + b^2 + c^2) $$

The sum of the squares of five real numbers $a_1, a_2, a_3, a_4, a_5$ equals $1$. Prove that the least of the numbers $(a_i - a_j)^2$, where $i, j = 1, 2, 3, 4,5$ and $i \neq j$, does not exceed $\frac{1}{10}.$

Let $n$ be a positive integer, $x_1,x_2,\ldots,x_{2n}$ be non-negative real numbers with sum $4$. Prove that there exist integer $p$ and $q$, with $0 \le q \le n-1$, such that \[ \sum_{i=1}^q x_{p+2i-1} \le 1 \mbox{ and } \sum_{i=q+1}^{n-1} x_{p+2i} \le 1, \] where the indices are take modulo $2n$. [i]Note:[/i] If $q=0$, then $\sum_{i=1}^q x_{p+2i-1}=0$; if $q=n-1$, then $\sum_{i=q+1}^{n-1} x_{p+2i}=0$.

Let $\alpha \in \mathbb{C}\setminus \{0\}$ and $A \in \mathcal{M}_n(\mathbb{C})$, $A \neq O_n$, be such that $$A^2 + (A^*)^2 = \alpha A\cdot A^*,$$ where $A^* = (\bar A)^T.$ Prove that $\alpha \in \mathbb{R}$, $|\alpha| \le 2$. and $A\cdot A^* = A^*\cdot A.$

$(USS 1)$ Prove that for a natural number $n > 2, (n!)! > n[(n - 1)!]^{n!}.$

Prove that for $\forall$ $a,b,c\in [\frac{1}{3},3]$ the following inequality is true: $\frac{a}{a+b}+\frac{b}{b+c}+\frac{c}{c+a}\geq \frac{7}{5}$.

Find maximum of the expression $(a -b^2)(b - a^2)$, where $0 \le a,b \le 1$.

Let $n$ be a positive integer and let $a_1, a_2, \ldots, a_n$ be positive reals. Show that $$\sum_{i=1}^{n} \frac{1}{2^i}(\frac{2}{1+a_i})^{2^i} \geq \frac{2}{1+a_1a_2\ldots a_n}-\frac{1}{2^n}.$$

For every positive $a_1, a_2, \dots, a_6$, prove the inequality \[ \sqrt[4]{\frac{a_1}{a_2 + a_3 + a_4}} + \sqrt[4]{\frac{a_2}{a_3 + a_4 + a_5}} + \dots + \sqrt[4]{\frac{a_6}{a_1 + a_2 + a_3}} \ge 2 \]

Consider infinite sequences $\{x_n\}$ of positive reals such that $x_0=1$ and $x_0\ge x_1\ge x_2\ge\ldots$. [b]a)[/b] Prove that for every such sequence there is an $n\ge1$ such that: \[ {x_0^2\over x_1}+{x_1^2\over x_2}+\ldots+{x_{n-1}^2\over x_n}\ge3.999. \] [b]b)[/b] Find such a sequence such that for all $n$: \[ {x_0^2\over x_1}+{x_1^2\over x_2}+\ldots+{x_{n-1}^2\over x_n}<4. \]

One morning, each member of Manjul’s family drank an $8$-ounce mixture of coffee and milk. The amounts of coffee and milk varied from cup to cup, but were never zero. Manjul drank $1/7$-th of the total amount of milk and $2/17$-th of the total amount of coffee. How many people are there in Manjul’s family?

Prove the following inequality: \[\prod^k_{i=1} x_i \cdot \sum^k_{i=1} x^{n-1}_i \leq \sum^k_{i=1} x^{n+k-1}_i,\] where $x_i > 0,$ $k \in \mathbb{N}, n \in \mathbb{N}.$

Show that if $a, b, c$ are the lengths of the sides of a triangle and if $2S = a + b + c$, then \[\frac{a^n}{b+c} + \frac{b^n}{c+a} +\frac{c^n}{a+b} \geq \left(\dfrac 23 \right)^{n-2}S^{n-1} \quad \forall n \in \mathbb N \] [i]Proposed by Greece.[/i]

Suppose $a$, $b$ and $c$ are nonzero real numberss satisfying $abc=2$. Prove that among the three numbers $2a-\frac{1}{b}$, $2b-\frac{1}{c}$ and $2c-\frac{1}{a}$, at most two of them are greater than $2$.

Suppose that $ n \geq 2$ and $ x_1, x_2, \ldots, x_n$ are real numbers between 0 and 1 (inclusive). Prove that for some index $ i$ between $ 1$ and $ n \minus{} 1$ the inequality \[ x_i (1 \minus{} x_{i\plus{}1}) \geq \frac{1}{4} x_1 (1 \minus{} x_{n})\]

For any positive reals $x$, $y$, $z$ with $xyz + xy + yz + zx = 4$, prove that $$\sqrt{\frac{xy+x+y}{z}}+\sqrt{\frac{yz+y+z}{x}}+\sqrt{\frac{zx+z+x}{y}}\geq 3\sqrt{\frac{3(x+2)(y+2)(z+2)}{(2x + 1)(2y + 1)(2z + 1). }}$$

Show that \[ \frac{1 - s^a}{1 - s} \leq (1 + s)^{a-1}\] holds for every $1 \neq s > 0$ real and $0 < a \leq 1$ rational.