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

We can conduct the following moves to a real number $x$: choose a positive integer $n$, and positives reals $a_1,a_2,\cdots, a_n$ whose reciprocals sum up to $1$. Let $x_0=x$, and $x_k=\sqrt{x_{k-1}a_k}$ for all $1\leq k\leq n$. Finally, let $y=x_n$. We said $M>0$ is "tremendous" if for any $x\in \mathbb{R}^+$, we can always choose $n,a_1,a_2,\cdots, a_n$ to make the resulting $y$ smaller than $M$. Find all tremendous numbers. [i]Proposed by ckliao914.[/i]
The bisectors of the angles $ CAB, ABC, BCA $ of the triangle $ ABC $ intersect the circle circumcribed around this triangle at points $ K, L, M $, respectively. Prove that $$ AK+BL+CM > AB+BC+CA.$$
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}$.
Given any positive real number $\varepsilon$, prove that, for all but finitely many positive integers $v$, any graph on $v$ vertices with at least $(1+\varepsilon)v$ edges has two distinct simple cycles of equal lengths. (Recall that the notion of a simple cycle does not allow repetition of vertices in a cycle.) [i]Fedor Petrov, Russia[/i]
Let $A$ be a set with $|A|=225$, meaning that $A$ has 225 elements. Suppose further that there are eleven subsets $A_1, \ldots, A_{11}$ of $A$ such that $|A_i|=45$ for $1\leq i\leq11$ and $|A_i\cap A_j|=9$ for $1\leq i<j\leq11$. Prove that $|A_1\cup A_2\cup\ldots\cup A_{11}|\geq 165$, and give an example for which equality holds.
Show that for nonnegative real numbers $a,b$ and integers $n\ge 2$, \[\frac{a^n+b^n}{2}\ge\left(\frac{a+b}{2}\right)^n\] When does equality hold?
$5$ airway companies operate in a country consisting of $36$ cities. Between any pair of cities exactly one company operates two way flights. If some air company operates between cities $A, B$ and $B, C$ we say that the triple $A, B, C$ is [i]properly-connected[/i]. Determine the largest possible value of $k$ such that no matter how these flights are arranged there are at least $k$ properly-connected triples.
Let $ a, b, c $ be positive real numbers less than or equal to $ \sqrt{2} $ such that $ abc = 2 $, prove that $$ \sqrt{2}\displaystyle\sum_{cyc}\frac{ab + 3c}{3ab + c} \ge a + b + c $$
Let $a,b,c$ be positive real numbers such that $a+b+c=1$. Prove that $$\frac{a}{a^2+b^3+c^3}+\frac{b}{b^2+a^3+c^3}+\frac{c}{c^2+a^3+b^3}\leq\frac{1}{5abc}$$
Let $a,b,c \in \mathbb{R^+}$ such that $abc=1$. Prove that $$\sum_{a,b,c} \sqrt{\frac{a}{a+8}} \ge 1$$
We select $16$ cells on an $8\times 8$ chessboard. What is the minimal number of pairs of selected cells in the same row or column?
Let $a, b, c$ be positive real numbers such that $a + b + c = 1$. If $n$ is a positive integer then prove that \[ \frac{(3a)^n}{(b + 1)(c + 1)} + \frac{(3b)^n}{(c + 1)(a + 1)} + \frac{(3c)^n}{(a + 1)(b + 1)} \ge \frac{27}{16} \,. \]
Given any positive real number $\varepsilon$, prove that, for all but finitely many positive integers $v$, any graph on $v$ vertices with at least $(1+\varepsilon)v$ edges has two distinct simple cycles of equal lengths. (Recall that the notion of a simple cycle does not allow repetition of vertices in a cycle.) [i]Fedor Petrov, Russia[/i]
In a triangle $ABC$, the bisector of the angle $A$ intersects the excircle that is tangential to side $[BC]$ at two points $D$ and $E$ such that $D\in [AE]$. Prove that, $$ \frac{|AD|}{|AE|}\leq \frac{|BC|^2}{|DE|^2}. $$
Prove that if $x$, $y$, $z$ are positive real numbers and $xyz = 1$ then \[\frac{x^3}{x^2+y}+\frac{y^3}{y^2+z}+\frac{z^3}{z^2+x}\geq \dfrac {3} {2}.\] [i]A. Golovanov[/i]
Let $a, b$, and $c$ be positive real numbers. Prove: $\frac{a}{b}+ \frac{b}{c}+ \frac{c}{a}\le \frac{a^2}{b^2} + \frac{b^2}{c^2} + \frac{c^2}{a^2}$ .
Suppose P is a point in the interior of a triangle ABC, that x; y; z are the distances from P to A; B; C, respectively, and that p; q; r are the per- pendicular distances from P to the sides BC; CA; AB, respectively. Prove that $xyz \geq 8pqr$; with equality implying that the triangle ABC is equilateral.
Let $a$, $b$, $c$ be positive real numbers such that $\min(ab,bc,ca) \ge 1$. Prove that $$\sqrt[3]{(a^2+1)(b^2+1)(c^2+1)} \le \left(\frac{a+b+c}{3}\right)^2 + 1.$$ [i]Proposed by Tigran Margaryan, Armenia[/i]
For arbitrary non-negative numbers $a$ and $b$ prove inequality $\frac{a}{\sqrt{b^2+1}}+\frac{b}{\sqrt{a^2+1}}\ge\frac{a+b}{\sqrt{ab+1}}$, and find, where equality occurs. (Day 2, 6th problem authors: Tomáš Jurík, Jaromír Šimša)
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]
Let $f : (0,+\infty) \to \mathbb{R}$ a convex function and $\alpha, \beta, \gamma > 0$. Then $$\frac{1}{6\alpha}\int \limits_0^{6\alpha}f(x)dx\ +\ \frac{1}{6\beta}\int \limits_0^{6\beta}f(x)dx\ +\ \frac{1}{6\gamma}\int \limits_0^{6\gamma}f(x)dx$$ $$\geq \frac{1}{3\alpha +2\beta +\gamma}\int \limits_0^{3\alpha +2\beta +\gamma}f(x)dx\ +\ \frac{1}{\alpha +3\beta +2\gamma}\int \limits_0^{\alpha +3\beta +2\gamma}f(x)dx\ $$ $$+\ \frac{1}{2\alpha +\beta +3\gamma}\int \limits_0^{2\alpha +\beta +3\gamma}f(x)dx$$
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]
Let $x,y$ be the positive real numbers with $x+y=1$, and $n$ be the positive integer with $n\ge2$. Prove that \[\frac{x^n}{x+y^3}+\frac{y^n}{x^3+y}\ge\frac{2^{4-n}}{5}\]
Let $H = \{ \lfloor i\sqrt{2}\rfloor : i \in \mathbb Z_{>0}\} = \{1,2,4,5,7,\dots \}$ and let $n$ be a positive integer. Prove that there exists a constant $C$ such that, if $A\subseteq \{1,2,\dots, n\}$ satisfies $|A| \ge C\sqrt{n}$, then there exist $a,b\in A$ such that $a-b\in H$. (Here $\mathbb Z_{>0}$ is the set of positive integers, and $\lfloor z\rfloor$ denotes the greatest integer less than or equal to $z$.)
If $ a,b,c$ are three positive real numbers, prove that $ \frac {a^{2}\plus{}1}{b\plus{}c}\plus{}\frac {b^{2}\plus{}1}{c\plus{}a}\plus{}\frac {c^{2}\plus{}1}{a\plus{}b}\ge 3$