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

Let $a$, $b$, $c$ be positive real numbers such that $abc=1$. Prove that \[\frac a{a^{2}+2}+\frac b{b^{2}+2}+\frac c{c^{2}+2}\leq 1 \]
Let $a, b, c$ be the lengths of sides of a triangle. Prove the inequality $$(a+b)\sqrt{ab}+(a+c)\sqrt{ac}+(b+c)\sqrt{bc} \geq (a+b+c)^2/2.$$
The $8$ eyelets for the lace of a sneaker all lie on a rectangle, four equally spaced on each of the longer sides. The rectangle has a width of $50$ mm and a length of $80$ mm. There is one eyelet at each vertex of the rectangle. The lace itself must pass between the vertex eyelets along a width side of the rectangle and then crisscross between successive eyelets until it reaches the two eyelets at the other width side of the rectrangle as shown. After passing through these final eyelets, each of the ends of the lace must extend at least $200$ mm farther to allow a knot to be tied. Find the minimum length of the lace in millimeters. [asy] size(200); defaultpen(linewidth(0.7)); path laceL=(-20,-30)..tension 0.75 ..(-90,-135)..(-102,-147)..(-152,-150)..tension 2 ..(-155,-140)..(-135,-40)..(-50,-4)..tension 0.8 ..origin; path laceR=reflect((75,0),(75,-240))*laceL; draw(origin--(0,-240)--(150,-240)--(150,0)--cycle,gray); for(int i=0;i<=3;i=i+1) { path circ1=circle((0,-80*i),5),circ2=circle((150,-80*i),5); unfill(circ1); draw(circ1); unfill(circ2); draw(circ2); } draw(laceL--(150,-80)--(0,-160)--(150,-240)--(0,-240)--(150,-160)--(0,-80)--(150,0)^^laceR,linewidth(1));[/asy]
Show that for each positive integer $n,$ all the roots of the polynomial \[\sum_{k=0}^n 2^{k(n-k)}x^k\] are real numbers.
Prove that \[ a^2b^2(a^2+b^2-2) \geq (a+b)(ab-1) \] for all positive real numbers $a$ and $b.$
Prove that for all positive real numbers $x, y$ and $z$, the double inequality $$0 < \frac{1}{x + y + z + 1} -\frac{1}{(x + 1)(y + 1)(z + 1)} \le \frac18$$ holds. When does equality hold in the right inequality? [i](Walther Janous)[/i]
Prove that $ a < b$ implies that $ a^3 \minus{} 3a \leq b^3 \minus{} 3b \plus{} 4.$ When does equality occur?
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}.$$
Prove that, abc≤1 and a,b,c>0 \[\frac{1}{a}+\frac{1}{b}+\frac{1}{c}\geq 1+ \frac{6}{a+b+c} \]
Find the largest real constant $k$ for which the inequality \[(a^2 + 3)(b^2 + 3)(c^2 + 3)(d^2 + 3) + k(a - 1)(b - 1)(c - 1)(d - 1) \ge 0\] holds for all real numbers $a$, $b$, $c$, and $d$.
Let $a_1,a_2,\cdots, a_n$ and $b_1,b_2,\cdots, b_n$ be two permutations of the numbers $1,2,\cdots, n$. Show that \[\sum_{i=1}^n i(n+1-i) \le \sum_{i=1}^n a_ib_i \le \sum_{i=1}^n i^2\]
If $a, b$ are positive reals such that $a+b<2$. Prove that $$\frac{1}{1+a^2}+\frac{1}{1+b^2} \le \frac{2}{1+ab}$$ and determine all $a, b$ yielding equality. [i]Proposed by Gottfried Perz[/i]
Let $a_1, a_2, \ldots, a_{2016}$ be real numbers such that $9a_i\ge 11a^2_{i+1}$ $(i=,2,\cdots,2015)$. Find the maximum value of $(a_1-a^2_2)(a_2-a^2_3)\cdots (a_{2015}-a^2_{2016})(a_{2016}-a^2_{1}).$
Positive real numbers $a, b, c$ satisfy $abc = 1$. Prove that $$\frac{a}{1+b}+\frac{b}{1+c}+\frac{c}{1+a} \ge \frac32$$
Let $x,y,z$ be nonnegative positive integers. Prove $\frac{x-y}{xy+2y+1}+\frac{y-z}{zy+2z+1}+\frac{z-x}{xz+2x+1}\ge 0$
In an acute angled triangle $ABC$ , let $BB' $ and $CC'$ be the altitudes. Ray $C'B'$ intersects the circumcircle at $B''$ andl let $\alpha_A$ be the angle $\widehat{ABB''}$. Similarly are defined the angles $\alpha_B$ and $\alpha_C$. Prove that $$\displaystyle\sin \alpha _A \sin \alpha _B \sin \alpha _C\leq \frac{3\sqrt{6}}{32}$$ (Romania)
Let $a$, $b$ and $c$ be positive real numbers such that $a+b+c=3$. Prove the inequality $$\frac{a^3}{a^2+1}+\frac{b^3}{b^2+1}+\frac{c^3}{c^2+1} \geq \frac{3}{2}.$$ [i]Proposed by Anastasija Trajanova[/i]
A mathematical competition was attended by 120 participants from several contingents. At the closing ceremony, each participant gave 1 souvenir each to every other participants from the same contingent, and 1 souvenir to any person from every other contingents. It is known that there are 3840 souvenirs whom were exchanged. Find the maximum possible contingents such that the above condition still holds? [i]Raymond Christopher Sitorus, Singapore[/i]
A [i]triangulation[/i] of a convex polygon $\Pi$ is a partitioning of $\Pi$ into triangles by diagonals having no common points other than the vertices of the polygon. We say that a triangulation is a [i]Thaiangulation[/i] if all triangles in it have the same area. Prove that any two different Thaiangulations of a convex polygon $\Pi$ differ by exactly two triangles. (In other words, prove that it is possible to replace one pair of triangles in the first Thaiangulation with a different pair of triangles so as to obtain the second Thaiangulation.) [i]Proposed by Bulgaria[/i]
Let $0 \le a_1 \le a_2 \le \dots \le a_n \le 1$ be $n$ real numbers with $n \ge 2$. Assume $a_1 + a_2 + \dots + a_n \ge n-1$. Prove that \[ a_2a_3\dots a_n \ge \left( 1 - \frac 1n \right)^{n-1} \]
Prove that if $c$ is a positive number distinct from $1$ and $n$ a positive integer, then \[n^{2}\leq \frac{c^{n}+c^{-n}-2}{c+c^{-1}-2}. \]
Find the minimum of $x^2 - 2x$ over all real numbers $x.$
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]
Consider infinite sequences $a_1,a_2,\dots$ of positive integers satisfying $a_1=1$ and $$a_n \mid a_k+a_{k+1}+\dots+a_{k+n-1}$$ for all positive integers $k$ and $n.$ For a given positive integer $m,$ find the maximum possible value of $a_{2m}.$ [i]Proposed by Krit Boonsiriseth[/i]
Given $n$ positive real numbers $x_1,x_2,x_3,...,x_n$ such that $$\left (1+\frac{1}{x_1}\right )\left(1+\frac{1}{x_2}\right)...\left(1+\frac{1}{x_n}\right)=(n+1)^n$$ Determine the minimum value of $x_1+x_2+x_3+...+x_n$. [i]Proposed by Loh Kwong Weng[/i]