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: 592

For real variables $0 \leq x, y, z, w \leq 1$, find the maximum value of $$x(1-y)+2y(1-z)+3z(1-w)+4w(1-x)$$
Show that for all positive real numbers $a, b, c$, we have that $$\frac{a+b+c}{3}-\sqrt[3]{abc} \leq \max\{(\sqrt{a}-\sqrt{b})^2, (\sqrt{b}-\sqrt{c})^2, (\sqrt{c}-\sqrt{a})^2\}$$
Let $a$, $b$, $c$ and $d$ positive real numbers with $a > c$ and $b < d$. Assume that \[a + \sqrt{b} \ge c + \sqrt{d} \qquad \text{and} \qquad \sqrt{a} + b \le \sqrt{c} + d\] Prove that $a + b + c + d > 1$. [i]Proposed by Victor Domínguez[/i]
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}$$
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$.
Prove that for $a, b, c \in [0;1]$, $$(1-a)(1+ab)(1+ac)(1-abc) \leq (1+a)(1-ab)(1-ac)(1+abc).$$
Find all positive integers $n$ such that the following statement holds: Suppose real numbers $a_1$, $a_2$, $\dots$, $a_n$, $b_1$, $b_2$, $\dots$, $b_n$ satisfy $|a_k|+|b_k|=1$ for all $k=1,\dots,n$. Then there exists $\varepsilon_1$, $\varepsilon_2$, $\dots$, $\varepsilon_n$, each of which is either $-1$ or $1$, such that \[ \left| \sum_{i=1}^n \varepsilon_i a_i \right| + \left| \sum_{i=1}^n \varepsilon_i b_i \right| \le 1. \]
Real numbers $a,b,c$ with $0\le a,b,c\le 1$ satisfy the condition $$a+b+c=1+\sqrt{2(1-a)(1-b)(1-c)}.$$ Prove that $$\sqrt{1-a^2}+\sqrt{1-b^2}+\sqrt{1-c^2}\le \frac{3\sqrt 3}{2}.$$ [i] (Nora Gavrea)[/i]
Let $ \{a_k\}^{\infty}_1$ be a sequence of non-negative real numbers such that: \[ a_k \minus{} 2 a_{k \plus{} 1} \plus{} a_{k \plus{} 2} \geq 0 \] and $ \sum^k_{j \equal{} 1} a_j \leq 1$ for all $ k \equal{} 1,2, \ldots$. Prove that: \[ 0 \leq a_{k} \minus{} a_{k \plus{} 1} < \frac {2}{k^2} \] for all $ k \equal{} 1,2, \ldots$.
Let $a, b, c$ be positive real numbers such that $abc = 8$. Prove that $\frac{ab + 4}{a + 2}+\frac{bc + 4}{b + 2}+\frac{ca + 4}{c + 2}\ge 6$.
Suppose that $a,b,c,d$ are positive real numbers satisfying $(a+c)(b+d)=ac+bd$. Find the smallest possible value of $$\frac{a}{b}+\frac{b}{c}+\frac{c}{d}+\frac{d}{a}.$$ [i]Israel[/i]
Let $n\geqslant 3$ be an integer and $x_1>x_2>\cdots>x_n$ be real numbers. Suppose that $x_k>0\geqslant x_{k+1}$ for an index $k{}$. Prove that \[\sum_{i=1}^k\left(x_i^{n-2}\prod_{j\neq i}\frac{1}{x_i-x_j}\right)\geqslant 0.\]
Let $x_0 = 5$ and $x_{n+1} = x_n + \frac{1}{x_n} \ (n = 0, 1, 2, \ldots )$. Prove that \[45 < x_{1000} < 45. 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]
Let $a$ and $b$ be two positive reals such that the following inequality \[ ax^3 + by^2 \geq xy - 1 \] is satisfied for any positive reals $x, y \geq 1$. Determine the smallest possible value of $a^2 + b$. [i]Proposed by Fajar Yuliawan[/i]
Suppose $A_1 A_2 \ldots A_n$ is an $n$-sided polygon with $n \geq 3$ and $\angle A_j \leq 180^{\circ}$ for each $j$ (in other words, the polygon is convex or has fewer than $n$ distinct sides). For each $i \leq n$, suppose $\alpha_i$ is the smallest possible value of $\angle{A_i A_j A_{i+1}}$ where $j$ is neither $i$ nor $i+1$. (Here, we define $A_{n+1} = A_1$.) Prove that \[ \alpha_1 + \alpha_2 + \cdots + \alpha_n \leq 180^{\circ} \] and determine all equality cases.
Let $ a_1 \geq a_2 \geq \ldots \geq a_n$ be real numbers such that for all integers $ k > 0,$ \[ a^k_1 \plus{} a^k_2 \plus{} \ldots \plus{} a^k_n \geq 0.\] Let $ p \equal{}\max\{|a_1|, \ldots, |a_n|\}.$ Prove that $ p \equal{} a_1$ and that \[ (x \minus{} a_1) \cdot (x \minus{} a_2) \cdots (x \minus{} a_n) \leq x^n \minus{} a^n_1\] for all $ x > a_1.$
For positive real numbers $a,b,c$ with $abc=1$ prove that $\left(a+\frac{1}{b}\right)^{2}+\left(b+\frac{1}{c}\right)^{2}+\left(c+\frac{1}{a}\right)^{2}\geq 3(a+b+c+1)$
Suppose that $a,b,c,d$ are positive real numbers satisfying $(a+c)(b+d)=ac+bd$. Find the smallest possible value of $$\frac{a}{b}+\frac{b}{c}+\frac{c}{d}+\frac{d}{a}.$$ [i]Israel[/i]
If the non-negative reals $x,y,z$ satisfy $x^2+y^2+z^2=x+y+z$. Prove that $$\displaystyle\frac{x+1}{\sqrt{x^5+x+1}}+\frac{y+1}{\sqrt{y^5+y+1}}+\frac{z+1}{\sqrt{z^5+z+1}}\geq 3.$$ When does the equality occur? [i]Proposed by Dorlir Ahmeti, Albania[/i]
Let $a$, $b$ and $c$ be positive real numbers such that $abc=2015$. Prove that $$\frac{a+b}{a^2+b^2}+\frac{b+c}{b^2+c^2}+\frac{c+a}{c^2+a^2} \leq \frac{\sqrt{a}+\sqrt{b}+\sqrt{c}}{\sqrt{2015}}$$
Define the numbers $a_0, a_1, \ldots, a_n$ in the following way: \[ a_0 = \frac{1}{2}, \quad a_{k+1} = a_k + \frac{a^2_k}{n} \quad (n > 1, k = 0,1, \ldots, n-1). \] Prove that \[ 1 - \frac{1}{n} < a_n < 1.\]
Let $a_0>0$ be a real number, and let $$a_n=\frac{a_{n-1}}{\sqrt{1+2020\cdot a_{n-1}^2}}, \quad \textrm{for } n=1,2,\ldots ,2020.$$ Show that $a_{2020}<\frac1{2020}$.
For which even natural numbers $d{}$ does there exists a constant $\lambda>0$ such that any reduced polynomial $f(x)$ of degree $d{}$ with integer coefficients that does not have real roots satisfies the inequality $f(x) > \lambda$ for all real numbers?
Point $M$ is the midpoint of side $BC$ of an acute—angled triangle $ABC$. The point $U$ is symmetric to the orthocenter $ABC$ relative to its circumcenter. The point $S$ inside triangle $ABC$ is such that $US = UM$. Prove that $SA + SB + SC + AM < AB + BC + CA$.