Found problems: 6530
2014 Iran MO (3rd Round), 4
For any $a,b,c>0$ satisfying $a+b+c+ab+ac+bc= 3$, prove that
\[2\leq a+b+c+abc\leq 3\]
[i]Proposed by Mohammad Ahmadi[/i]
2006 India Regional Mathematical Olympiad, 3
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$
1969 Canada National Olympiad, 2
Determine which of the two numbers $\sqrt{c+1}-\sqrt{c}$, $\sqrt{c}-\sqrt{c-1}$ is greater for any $c\ge 1$.
1976 All Soviet Union Mathematical Olympiad, 223
The natural numbers $x_1$ and $x_2$ are less than $1000$. We construct a sequence:
$$x_3 = |x_1 - x_2|$$
$$x_4 = min \{ |x_1 - x_2|, |x_1 - x_3|, |x_2 - x_3|\}$$
$$...$$
$$x_k = min \{ |x_i - x_j|, 0 <i < j < k\}$$
$$...$$
Prove that $x_{21} = 0$.
2008 Sharygin Geometry Olympiad, 24
(I.Bogdanov, 11) Let $ h$ be the least altitude of a tetrahedron, and $ d$ the least distance between its opposite edges. For what values of $ t$ the inequality $ d>th$ is possible?
2003 IMO Shortlist, 3
Consider pairs of the sequences of positive real numbers \[a_1\geq a_2\geq a_3\geq\cdots,\qquad b_1\geq b_2\geq b_3\geq\cdots\] and the sums \[A_n = a_1 + \cdots + a_n,\quad B_n = b_1 + \cdots + b_n;\qquad n = 1,2,\ldots.\] For any pair define $c_n = \min\{a_i,b_i\}$ and $C_n = c_1 + \cdots + c_n$, $n=1,2,\ldots$.
(1) Does there exist a pair $(a_i)_{i\geq 1}$, $(b_i)_{i\geq 1}$ such that the sequences $(A_n)_{n\geq 1}$ and $(B_n)_{n\geq 1}$ are unbounded while the sequence $(C_n)_{n\geq 1}$ is bounded?
(2) Does the answer to question (1) change by assuming additionally that $b_i = 1/i$, $i=1,2,\ldots$?
Justify your answer.
2000 France Team Selection Test, 3
$a,b,c,d$ are positive reals with sum $1$. Show that $\frac{a^2}{a+b}+\frac{b^2}{b+c}+\frac{c^2}{c+d}+\frac{d^2}{d+a} \ge \frac{1}{2}$ with equality iff $a=b=c=d=\frac{1}{4}$.
2008 239 Open Mathematical Olympiad, 8
The natural numbers $x_1, x_2, \ldots , x_n$ are such that all their $2^n$ partial sums are distinct. Prove that:
$$ {x_1}^2 + {x_2}^2 + \ldots + {x_n}^2 \geq \frac{4^n – 1}{3}. $$
2018 Azerbaijan Senior NMO, 5
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]
2009 Today's Calculation Of Integral, 439
Find the volume of the solid defined by the inequality $ x^2 \plus{} y^2 \plus{} \ln (1 \plus{} z^2)\leq \ln 2$.
Note that you may not directively use double integral here for Japanese high school students who don't study it.
2005 China Team Selection Test, 2
Let $n$ be a positive integer, and $x$ be a positive real number. Prove that $$\sum_{k=1}^{n} \left( x \left[\frac{k}{x}\right] - (x+1)\left[\frac{k}{x+1}\right]\right) \leq n,$$ where $[x]$ denotes the largest integer not exceeding $x$.
2008 Bosnia And Herzegovina - Regional Olympiad, 2
IF $ a$, $ b$ and $ c$ are positive reals such that $ a^{2}\plus{}b^{2}\plus{}c^{2}\equal{}1$ prove the inequality:
\[ \frac{a^{5}\plus{}b^{5}}{ab(a\plus{}b)}\plus{} \frac {b^{5}\plus{}c^{5}}{bc(b\plus{}c)}\plus{}\frac {c^{5}\plus{}a^{5}}{ca(a\plus{}b)}\geq 3(ab\plus{}bc\plus{}ca)\minus{}2.\]
2007 China Girls Math Olympiad, 2
Let $ ABC$ be an acute triangle. Points $ D$, $ E$, and $ F$ lie on segments $ BC$, $ CA$, and $ AB$, respectively, and each of the three segments $ AD$, $ BE$, and $ CF$ contains the circumcenter of $ ABC$. Prove that if any two of the ratios $ \frac{BD}{DC}$, $ \frac{CE}{EA}$, $ \frac{AF}{FB}$, $ \frac{BF}{FA}$, $ \frac{AE}{EC}$, $ \frac{CD}{DB}$ are integers, then triangle $ ABC$ is isosceles.
2010 Contests, 1
Suppose $a$, $b$, $c$, and $d$ are distinct positive integers such that $a^b$ divides $b^c$, $b^c$ divides $c^d$, and $c^d$ divides $d^a$.
[list](a) Is it possible to determine which of the numbers $a$, $b$, $c$, $d$ is the smallest?
(b) Is it possible to determine which of the numbers $a$, $b$, $c$, $d$ is the largest?[/list]
2015 Romania Team Selection Test, 5
Given an integer $N \geq 4$, determine the largest value the sum
$$\sum_{i=1}^{\left \lfloor{\frac{k}{2}}\right \rfloor+1}\left( \left \lfloor{\frac{n_i}{2}}\right \rfloor+1\right)$$
may achieve, where $k, n_1, \ldots, n_k$ run through the integers subject to $k \geq 3$, $n_1 \geq \ldots\geq n_k\geq 1$ and $n_1 + \ldots + n_k = N$.
2013 ELMO Shortlist, 8
Let $a, b, c$ be positive reals with $a^{2014}+b^{2014}+c^{2014}+abc=4$. Prove that
\[ \frac{a^{2013}+b^{2013}-c}{c^{2013}} + \frac{b^{2013}+c^{2013}-a}{a^{2013}} + \frac{c^{2013}+a^{2013}-b}{b^{2013}} \ge a^{2012}+b^{2012}+c^{2012}. \][i]Proposed by David Stoner[/i]
2024 Singapore MO Open, Q4
Alice and Bob play a game. Bob starts by picking a set $S$ consisting of $M$ vectors of length $n$ with entries either $0$ or $1$. Alice picks a sequence of numbers $y_1\le y_2\le\dots\le y_n$ from the interval $[0,1]$, and a choice of real numbers $x_1,x_2\dots,x_n\in \mathbb{R}$. Bob wins if he can pick a vector $(z_1,z_2,\dots,z_n)\in S$ such that $$\sum_{i=1}^n x_iy_i\le \sum_{i=1}^n x_iz_i,$$otherwise Alice wins. Determine the minimum value of $M$ so that Bob can guarantee a win.
[i]Proposed by DVDthe1st[/i]
2015 Hanoi Open Mathematics Competitions, 15
Let the numbers $a, b,c$ satisfy the relation $a^2+b^2+c^2 \le 8$.
Determine the maximum value of $M = 4(a^3 + b^3 + c^3) - (a^4 + b^4 + c^4)$
1985 All Soviet Union Mathematical Olympiad, 402
Given unbounded strictly increasing sequence $a_1, a_2, ... , a_n, ...$ of positive numbers. Prove that
a) there exists a number $k_0$ such that for all $k>k_0$ the following inequality is valid:
$$\frac{a_1}{a_2}+ \frac{a_2}{a_3} + ... + \frac{a_k}{a_{k-1} }< k - 1$$
b) there exists a number $k_0$ such that for all $k>k_0$ the following inequality is valid:
$$\frac{a_1}{a_2}+ \frac{a_2}{a_3} + ... + \frac{a_k}{a_{k-1} }< k - 1985$$
2006 Cuba MO, 3
Let $a, b, c$ be different real numbers. prove that
$$\left(\frac{2a-b}{a-b}\right)^2+ \left(\frac{2b- c}{b-c}\right)^2+ \left(\frac{2c-a}{c-a}\right)^2 \ge 5. $$
Russian TST 2021, P2
In the plane, there are $n \geqslant 6$ pairwise disjoint disks $D_{1}, D_{2}, \ldots, D_{n}$ with radii $R_{1} \geqslant R_{2} \geqslant \ldots \geqslant R_{n}$. For every $i=1,2, \ldots, n$, a point $P_{i}$ is chosen in disk $D_{i}$. Let $O$ be an arbitrary point in the plane. Prove that \[O P_{1}+O P_{2}+\ldots+O P_{n} \geqslant R_{6}+R_{7}+\ldots+R_{n}.\]
(A disk is assumed to contain its boundary.)
2000 Tournament Of Towns, 1
Can the product of $2$ consecutive natural numbers equal the product of $2$ consecutive even natural numbers?
(natural means positive integers)
2010 Germany Team Selection Test, 2
Prove or disprove that $\forall a,b,c,d \in \mathbb{R}^+$ we have the following inequality:
\[3 \leq \frac{4a+b}{a+4b} + \frac{4b+c}{b+4c} + \frac{4c+a}{c+4a} < \frac{33}{4}\]
2013 China Team Selection Test, 1
Let $n$ and $k$ be two integers which are greater than $1$. Let $a_1,a_2,\ldots,a_n,c_1,c_2,\ldots,c_m$ be non-negative real numbers such that
i) $a_1\ge a_2\ge\ldots\ge a_n$ and $a_1+a_2+\ldots+a_n=1$;
ii) For any integer $m\in\{1,2,\ldots,n\}$, we have that $c_1+c_2+\ldots+c_m\le m^k$.
Find the maximum of $c_1a_1^k+c_2a_2^k+\ldots+c_na_n^k$.
1979 IMO Longlists, 63
Let the sequence $\{a_i\}$ of $n$ positive reals denote the lengths of the sides of an arbitrary $n$-gon. Let $s=\sum_{i=1}^{n}{a_i}$. Prove that $2\ge \sum_{i=1}^{n}{\frac{a_i}{s-a_i}}\ge \frac{n}{n-1}$.