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

$ABC$ is a triangle, with inradius $r$ and circumradius $R.$ Show that: \[ \sin \left( \frac{A}{2} \right) \cdot \sin \left( \frac{B}{2} \right) + \sin \left( \frac{B}{2} \right) \cdot \sin \left( \frac{C}{2} \right) + \sin \left( \frac{C}{2} \right) \cdot \sin \left( \frac{A}{2} \right) \leq \frac{5}{8} + \frac{r}{4 \cdot R}. \]
Prove that for all positive real numbers $a_1,a_2,\cdots a_n$ \[\frac{1}{\frac{1}{1+a_1}+\frac{1}{1+a_2}+\cdots +\frac{1}{1+a_n}}-\frac{1}{\frac{1}{a_1}+\frac{1}{a_2}+\cdots +\frac{1}{a_n}}\geq \frac{1}{n}\] When does the inequality hold?
Suppose that in a certain society, each pair of persons can be classified as either [i]amicable [/i]or [i]hostile[/i]. We shall say that each member of an amicable pair is a [i]friend[/i] of the other, and each member of a hostile pair is a [i]foe[/i] of the other. Suppose that the society has $\, n \,$ persons and $\, q \,$ amicable pairs, and that for every set of three persons, at least one pair is hostile. Prove that there is at least one member of the society whose foes include $\, q(1 - 4q/n^2) \,$ or fewer amicable pairs.
Let $P_0$, $P_1$, $\dots$, $P_8 = P_0$ be successive points on a circle and $Q$ be a point inside the polygon $P_0 P_1 \dotsb P_7$ such that $\angle P_{i - 1} QP_i = 45^\circ$ for $i = 1$, $\dots$, 8. Prove that the sum \[\sum_{i = 1}^8 P_{i - 1} P_i^2\] is minimal if and only if $Q$ is the centre of the circle.
For an integer $m\geq 1$, we consider partitions of a $2^m\times 2^m$ chessboard into rectangles consisting of cells of chessboard, in which each of the $2^m$ cells along one diagonal forms a separate rectangle of side length $1$. Determine the smallest possible sum of rectangle perimeters in such a partition. [i]Proposed by Gerhard Woeginger, Netherlands[/i]
If $a,b,c$ are positive real numbers such that $abc= 1$, Prove that \[ a^{b+c} b^{c+a} c^{a+b} \leq 1 . \]
For $ f(x)\equal{}1\minus{}\sin x$, let $ g(x)\equal{}\int_0^x (x\minus{}t)f(t)\ dt.$ Show that $ g(x\plus{}y)\plus{}g(x\minus{}y)\geq 2g(x)$ for any real numbers $ x,\ y.$
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]
Let $a_0,a_1,a_2,\dots $ be a sequence of real numbers such that $a_0=0, a_1=1,$ and for every $n\geq 2$ there exists $1 \leq k \leq n$ satisfying \[ a_n=\frac{a_{n-1}+\dots + a_{n-k}}{k}. \]Find the maximum possible value of $a_{2018}-a_{2017}$.
Let $r_{1},r_{2},\ldots ,r_{n}$ be real numbers greater than or equal to 1. Prove that \[ \frac{1}{r_{1} + 1} + \frac{1}{r_{2} + 1} + \cdots +\frac{1}{r_{n}+1} \geq \frac{n}{ \sqrt[n]{r_{1}r_{2} \cdots r_{n}}+1}. \]
Let $ABC$ be a triangle. Its excircles touch sides $BC, CA, AB$ at $D, E, F$, respectively. Prove that the perimeter of triangle $ABC$ is at most twice that of triangle $DEF$.
Let $a_1,a_2,\dots,a_m$ be a finite sequence of positive integers. Prove that there exist nonnegative integers $b,c,$ and $N$ such that $$\left\lfloor \sum_{i=1}^m \sqrt{n+a_i} \right\rfloor =\left\lfloor \sqrt{bn+c} \right\rfloor$$ holds for all integers $n>N.$ [i]Proposed by Carl Schildkraut[/i]
$ u,v,w > 0$,such that $ u \plus{} v \plus{} w \plus{} \sqrt {uvw} \equal{} 4$ prove that $ \sqrt {\frac {uv}{w}} \plus{} \sqrt {\frac {vw}{u}} \plus{} \sqrt {\frac {wu}{v}}\geq u \plus{} v \plus{} w$
Given real numbers $x,y,z$ such that $x+y+z=0$, show that \[\dfrac{x(x+2)}{2x^2+1}+\dfrac{y(y+2)}{2y^2+1}+\dfrac{z(z+2)}{2z^2+1}\ge 0\] When does equality hold?
Show in an acute triangle $ABC$ that $\cot A + \cot B + \cot C \ge \dfrac{12[ABC]}{a^2+b^2+c^2}$.
Prove that for an arbitrary triangle $ABC$ : $sin \frac{A}{2} sin \frac{B}{2} sin \frac{C}{2} < \frac{1}{4}$.
Let $\{a_n\}$ be a sequence such that: $a_1 = \frac{1}{2}$, $a_{k+1}=-a_k+\frac{1}{2-a_k}$ for all $k = 1, 2,\ldots$. Prove that \[ \left(\frac{n}{2(a_1+a_2+\cdots+a_n)}-1\right)^n \leq \left(\frac{a_1+a_2+\cdots+a_n}{n}\right)^n\left(\frac{1}{a_1}-1\right)\left(\frac{1}{a_2}-1\right)\cdots \left(\frac{1}{a_n}-1\right). \]
Let $a, b, c$ be positive reals such that $abc=1$. Show that \[\frac{1}{a^5(b+2c)^2} + \frac{1}{b^5(c+2a)^2} + \frac{1}{c^5(a+2b)^2} \ge \frac{1}{3}.\]
Let $n \geq 2$ be a fixed integer. Find the least constant $C$ such the inequality \[\sum_{i<j} x_{i}x_{j} \left(x^{2}_{i}+x^{2}_{j} \right) \leq C \left(\sum_{i}x_{i} \right)^4\] holds for any $x_{1}, \ldots ,x_{n} \geq 0$ (the sum on the left consists of $\binom{n}{2}$ summands). For this constant $C$, characterize the instances of equality.
Let $a_0,a_1,a_2,\dots $ be a sequence of real numbers such that $a_0=0, a_1=1,$ and for every $n\geq 2$ there exists $1 \leq k \leq n$ satisfying \[ a_n=\frac{a_{n-1}+\dots + a_{n-k}}{k}. \]Find the maximum possible value of $a_{2018}-a_{2017}$.
Let $a,b,c$ be positive reals such that $a+b+c=3$. Prove the inequality \[\frac{a^2}{a+b^2}+\frac{b^2}{b+c^2}+\frac{c^2}{c+a^2}\geq \frac{3}{2}.\]
Seventeen football fans were planning to go to Korea to watch the World Cup football match. They selected 17 matches. The conditions of the admission tickets they booked were such that - One person should book at most one admission ticket for one match; - At most one match was same in the tickets booked by every two persons; - There was one person who booked six tickets. How many tickets did those football fans book at most?
Let $S$ be a finite set of points in the plane,situated in general position(any three points in $S$ are not collinear),and let $$D(S,r)=\{\{x,y\}:x,y\in S,\text{dist}(x,y)=r\},$$ where $R$ is a positive real number,and $\text{dist}(x,y)$ is the euclidean distance between points $x$ and $y$.Prove that $$\sum_{r>0}|D(S,r)|^2\le\frac{3|S|^2(|S|-1)}{4}.$$
Let $x,y,z$ be positive numbers such that $x^2+y^2+z^2=1$. Prove that $$\frac x{1-x^2}+\frac y{1-y^2}+\frac z{1-z^2}\ge\frac{3\sqrt3}2$$
There are $2n-1$ twoelement subsets of set $1,2,...,n$. Prove that one can choose $n$ out of these such that their union contains no more than $\frac{2}{3}n+1$ elements.