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

If $ a$, $ b$, $ c$ are the sidelengths of a triangle, then prove that $ \frac {3\left(a^4 \plus{} b^4 \plus{} c^4\right)}{\left(a^2 \plus{} b^2 \plus{} c^2\right)^2} \plus{} \frac {bc \plus{} ca \plus{} ab}{a^2 \plus{} b^2 \plus{} c^2}\geq 2$.
Consider a polynomial with coefficients of real numbers $ \phi(x)\equal{}ax^3\plus{}bx^2\plus{}cx\plus{}d$ with three positive real roots. Assume that $ \phi(0)<0$, prove that \[ 2b^3\plus{}9a^2d\minus{}7abc \le 0.\] [i]Hery Susanto, Malang[/i]
For all positive numbers $a, b, c$ satisfying $\frac{1}{a} + \frac{1}{b} + \frac{1}{c} = 1$, prove that: $$ \frac{a}{a+bc} + \frac{b}{b+ca} + \frac{c}{c+ab} \geq \frac{3}{4} .$$
Let $a$ be a non-negative real number and a sequence $(u_n)$ defined as: $u_1=6,u_{n+1} = \frac{2n+a}{n} + \sqrt{\frac{n+a}{n}u_n+4}, \forall n \ge 1$ a) With $a=0$, prove that there exist a finite limit of $(u_n)$ and find that limit b) With $a \ge 0$, prove that there exist a finite limit of $(u_n)$
With the conditions $a,b,c\in\mathbb{R^+}$ and $a+b+c=1$, prove that \[\frac{7+2b}{1+a}+\frac{7+2c}{1+b}+\frac{7+2a}{1+c}\geq\frac{69}{4}\]
Suppose that a sequence $a_1,a_2,\ldots$ of positive real numbers satisfies \[a_{k+1}\geq\frac{ka_k}{a_k^2+(k-1)}\] for every positive integer $k$. Prove that $a_1+a_2+\ldots+a_n\geq n$ for every $n\geq2$.
Let $a_{1}$, $a_{2}$, …, $a_{6}$; $b_{1}$, $b_{2}$, …, $b_{6}$ and $c_{1}$, $c_{2}$, …, $c_{6}$ are all permutations of $1$, $2$, …, $6$, respectively. Find the minimum value of $\sum_{i=1}^{6}a_{i}b_{i}c_{i}$.
Let $a, b$ and $c$ be positive real numbers such that $a + b + c = 1$. Prove that $$\frac{a}{a+b^2}+\frac{b}{b+c^2}+\frac{c}{c+a^2} \le \frac{1}{4} \left( \frac{1}{a} + \frac{1}{b} + \frac{1}{c} \right)$$
Show that $x^4 + y^4 + z^2\ge xyz \sqrt8$ for all positive reals $x, y, z$.
Let $a, b, c$ and $d$ are positive real numbers so that $abcd = \frac14$. Prove that holds $$\left( 16ac +\frac{a}{c^2b}+\frac{16c}{a^2d}+\frac{4}{ac}\right)\left( bd +\frac{b}{256d^2c}+\frac{d}{b^2a}+\frac{1}{64bd}\right) \ge \frac{81}{4}$$ When does the equality hold?
Let $x,y,z,t$ be real numbers such that, $1 \leq x \leq y \leq z \leq t \leq 100$. Find minimum value of $$\frac{x}{y}+\frac{z}{t}$$
Let $p, q, r$ be positive real numbers and $n$ a natural number. Show that if $pqr = 1$, then \[ \frac{1}{p^n+q^n+1} + \frac{1}{q^n+r^n+1} + \frac{1}{r^n+p^n+1} \leq 1. \]
Let $n \geq 4$ be an integer. Find all positive real solutions to the following system of $2n$ equations: \begin{align*} a_{1} &=\frac{1}{a_{2 n}}+\frac{1}{a_{2}}, & a_{2}&=a_{1}+a_{3}, \\ a_{3}&=\frac{1}{a_{2}}+\frac{1}{a_{4}}, & a_{4}&=a_{3}+a_{5}, \\ a_{5}&=\frac{1}{a_{4}}+\frac{1}{a_{6}}, & a_{6}&=a_{5}+a_{7} \\ &\vdots & &\vdots \\ a_{2 n-1}&=\frac{1}{a_{2 n-2}}+\frac{1}{a_{2 n}}, & a_{2 n}&=a_{2 n-1}+a_{1} \end{align*}
In a $2\times n$ array we have positive reals s.t. the sum of the numbers in each of the $n$ columns is $1$. Show that we can select a number in each column s.t. the sum of the selected numbers in each row is at most $\frac{n+1}4$.
Find the maximum constant $C$ such that, whenever $\{a_n \}_{n=1}^{\infty}$ is a sequence of positive real numbers satisfying $a_{n+1}-a_n=a_n(a_n+1)(a_n+2)$, we have $$\frac{a_{2023}-a_{2020}}{a_{2022}-a_{2021}}>C.$$
Show that for any vectors $a, b$ in Euclidean space, \[|a \times b|^3 \leq \frac{3 \sqrt 3}{8} |a|^2 |b|^2 |a-b|^2\] Remark. Here $\times$ denotes the vector product.
Suppose that $x$, $y$, and $z$ are complex numbers such that $xy = -80-320i$, $yz = 60$, and $zx = -96+24i$, where $i = \sqrt{-1}$. Then there are real numbers $a$ and $b$ such that $x+y+z = a+bi$. Find $a^2 + b^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. \]
Let $ABCD$ be a convex quadrilateral whose diagonals $AC$ and $BD$ meet at $P$. Let the area of triangle $APB$ be $24$ and let the area of triangle $CPD$ be $25$. What is the minimum possible area of quadrilateral $ABCD$?
2) Let $a, b, c$ be real numbers such that $$a+\frac{b}{c}=b+\frac{c}{a}=c+\frac{a}{b}=1$$a) Prove that $ab+bc+ca=0$ and $a+b+c=3$. b) Prove that $|a|+|b|+|c|< 5$
Professor Oak is feeding his $100$ Pokémon. Each Pokémon has a bowl whose capacity is a positive real number of kilograms. These capacities are known to Professor Oak. The total capacity of all the bowls is $100$ kilograms. Professor Oak distributes $100$ kilograms of food in such a way that each Pokémon receives a non-negative integer number of kilograms of food (which may be larger than the capacity of the bowl). The [i]dissatisfaction level[/i] of a Pokémon who received $N$ kilograms of food and whose bowl has a capacity of $C$ kilograms is equal to $\lvert N-C\rvert$. Find the smallest real number $D$ such that, regardless of the capacities of the bowls, Professor Oak can distribute food in a way that the sum of the dissatisfaction levels over all the $100$ Pokémon is at most $D$. [i]Oleksii Masalitin, Ukraine[/i]
Let $P$ be a point in the plane of triangle $ABC$ such that the segments $PA$, $PB$, and $PC$ are the sides of an obtuse triangle. Assume that in this triangle the obtuse angle opposes the side congruent to $PA$. Prove that $\angle BAC$ is acute.
Let $n$ be positive integer,$x_1,x_2,\cdots,x_n$ be positive real numbers such that $x_1x_2\cdots x_n=1 $ . Prove that$$\sum\limits_{i = 1}^{n}x_i\sqrt{x^2_1+x^2_2+\cdots x^2_i}\ge\frac{n+1}{2}\sqrt{n}$$
The $ n$ roots of a complex coefficient polynomial $ f(z) \equal{} z^n \plus{} a_1z^{n \minus{} 1} \plus{} \cdots \plus{} a_{n \minus{} 1}z \plus{} a_n$ are $ z_1, z_2, \cdots, z_n$. If $ \sum_{k \equal{} 1}^n |a_k|^2 \leq 1$, then prove that $ \sum_{k \equal{} 1}^n |z_k|^2 \leq n$.