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

2024 Greece Junior Math Olympiad, 1

a) Prove that for all real numbers $k,l,m$ holds : $$(k+l+m)^2 \ge 3 (kl+lm+mk)$$ When does equality holds? b) If $x,y,z$ are positive real numbers and $a,b$ real numbers such that $$a(x+y+z)=b(xy+yz+zx)=xyz,$$ prove that $a \ge 3b^2$. When does equality holds?

1985 IMO Longlists, 63

Let $x_n = \sqrt[2]{2+\sqrt[3]{3+\cdots+\sqrt[n]{n}}}.$ Prove that \[x_{n+1}-x_n <\frac{1}{n!} \quad n=2,3,\cdots\]

2014 Contests, 1

Let $x,y$ be positive real numbers .Find the minimum of $x+y+\frac{|x-1|}{y}+\frac{|y-1|}{x}$.

2014 Contests, A2

Let $x,y$ and $z$ be positive real numbers such that $xy+yz+xz=3xyz$. Prove that \[ x^2y+y^2z+z^2x \ge 2(x+y+z)-3 \] and determine when equality holds. [i]UK - David Monk[/i]

2011 Germany Team Selection Test, 1

A sequence $x_1, x_2, \ldots$ is defined by $x_1 = 1$ and $x_{2k}=-x_k, x_{2k-1} = (-1)^{k+1}x_k$ for all $k \geq 1.$ Prove that $\forall n \geq 1$ $x_1 + x_2 + \ldots + x_n \geq 0.$ [i]Proposed by Gerhard Wöginger, Austria[/i]

2021 Science ON grade X, 1

Consider the complex numbers $x,y,z$ such that $|x|=|y|=|z|=1$. Define the number $$a=\left (1+\frac xy\right )\left (1+\frac yz\right )\left (1+\frac zx\right ).$$ $\textbf{(a)}$ Prove that $a$ is a real number. $\textbf{(b)}$ Find the minimal and maximal value $a$ can achieve, when $x,y,z$ vary subject to $|x|=|y|=|z|=1$. [i] (Stefan Bălăucă & Vlad Robu)[/i]

2005 China Second Round Olympiad, 2

Assume that positive numbers $a, b, c, x, y, z$ satisfy $cy + bz = a$, $az + cx = b$, and $bx + ay = c$. Find the minimum value of the function \[ f(x, y, z) = \frac{x^2}{x+1} + \frac {y^2}{y+1} + \frac{z^2}{z+1}. \]

1970 IMO, 3

The real numbers $a_0,a_1,a_2,\ldots$ satisfy $1=a_0\le a_1\le a_2\le\ldots. b_1,b_2,b_3,\ldots$ are defined by $b_n=\sum_{k=1}^n{1-{a_{k-1}\over a_k}\over\sqrt a_k}$. [b]a.)[/b] Prove that $0\le b_n<2$. [b]b.)[/b] Given $c$ satisfying $0\le c<2$, prove that we can find $a_n$ so that $b_n>c$ for all sufficiently large $n$.

2019 District Olympiad, 1

Let $n \in \mathbb{N}, n \ge 2$ and the positive real numbers $a_1,a_2,…,a_n$ and $b_1,b_2,…,b_n$ such that $a_1+a_2+…+a_n=b_1+b_2+…+b_n=S.$ $\textbf{a)}$ Prove that $\sum\limits_{k=1}^n \frac{a_k^2}{a_k+b_k} \ge \frac{S}{2}.$ $\textbf{b)}$ Prove that $\sum\limits_{k=1}^n \frac{a_k^2}{a_k+b_k}= \sum\limits_{k=1}^n \frac{b_k^2}{a_k+b_k}.$

1967 IMO Longlists, 49

Let $n$ and $k$ be positive integers such that $1 \leq n \leq N+1$, $1 \leq k \leq N+1$. Show that: \[ \min_{n \neq k} |\sin n - \sin k| < \frac{2}{N}. \]

1978 IMO Shortlist, 6

Let $f$ be an injective function from ${1,2,3,\ldots}$ in itself. Prove that for any $n$ we have: $\sum_{k=1}^{n} f(k)k^{-2} \geq \sum_{k=1}^{n} k^{-1}.$

2022 Iran MO (3rd Round), 6

Prove that among any $9$ distinct real numbers, there exist $4$ distinct numbers $a,b,c,d$ such that $$(ac+bd)^2\ge\frac{9}{10}(a^2+b^2)(c^2+d^2)$$

1982 IMO Shortlist, 3

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. \]

2021 China Team Selection Test, 4

Suppose $x_1,x_2,...,x_{60}\in [-1,1]$ , find the maximum of $$ \sum_{i=1}^{60}x_i^2(x_{i+1}-x_{i-1}),$$ where $x_{i+60}=x_i$.

2022 JBMO Shortlist, A3

Let $a, b,$ and $c$ be positive real numbers such that $a + b + c = 1$. Prove the following inequality $$a \sqrt[3]{\frac{b}{a}} + b \sqrt[3]{\frac{c}{b}} + c \sqrt[3]{\frac{a}{c}} \le ab + bc + ca + \frac{2}{3}.$$ Proposed by [i]Anastasija Trajanova, Macedonia[/i]

1970 IMO Longlists, 52

The real numbers $a_0,a_1,a_2,\ldots$ satisfy $1=a_0\le a_1\le a_2\le\ldots. b_1,b_2,b_3,\ldots$ are defined by $b_n=\sum_{k=1}^n{1-{a_{k-1}\over a_k}\over\sqrt a_k}$. [b]a.)[/b] Prove that $0\le b_n<2$. [b]b.)[/b] Given $c$ satisfying $0\le c<2$, prove that we can find $a_n$ so that $b_n>c$ for all sufficiently large $n$.

2023 Azerbaijan JBMO TST, 1

Let $a < b < c < d < e$ be positive integers. Prove that $$\frac{1}{[a, b]} + \frac{1}{[b, c]} + \frac{1}{[c, d]} + \frac{2}{[d, e]} \le 1$$ where $[x, y]$ is the least common multiple of $x$ and $y$ (e.g., $[6, 10] = 30$). When does equality hold?

2017 Iran MO (3rd round), 3

Let $a,b$ and $c$ be positive real numbers. Prove that $$\sum_{cyc} \frac {a^3b}{(3a+2b)^3} \ge \sum_{cyc} \frac {a^2bc}{(2a+2b+c)^3} $$

2024 Ukraine National Mathematical Olympiad, Problem 5

For real numbers $a, b, c, d \in [0, 1]$, find the largest possible value of the following expression: $$a^2+b^2+c^2+d^2-ab-bc-cd-da$$ [i]Proposed by Mykhailo Shtandenko[/i]

2013 Sharygin Geometry Olympiad, 3

Each sidelength of a convex quadrilateral $ABCD$ is not less than $1$ and not greater than $2$. The diagonals of this quadrilateral meet at point $O$. Prove that $S_{AOB}+ S_{COD} \le 2(S_{AOD}+ S_{BOC})$.

2001 Mongolian Mathematical Olympiad, Problem 2

In an acute-angled triangle $ABC$, $a,b,c$ are sides, $m_a,m_b,m_c$ the corresponding medians, $R$ the circumradius and $r$ the inradius. Prove the inequality $$\frac{a^2+b^2}{a+b}\cdot\frac{b^2+c^2}{b+c}\cdot\frac{a^2+c^2}{a+c}\ge16R^2r\frac{m_a}a\cdot\frac{m_b}b\cdot\frac{m_c}c.$$

2021 Taiwan TST Round 1, A

Suppose that $a,b,c,d$ are positive real numbers satisfying $(a+c)(b+d)=ac+bd$. Find the smallest possible value of $$\frac{a}{b}+\frac{b}{c}+\frac{c}{d}+\frac{d}{a}.$$ [i]Israel[/i]

2018 IFYM, Sozopol, 4

Find all real numbers $k$ for which the inequality $(1+t)^k (1-t)^{1-k} \leq 1$ is true for every real number $t \in (-1, 1)$.

1994 IMO Shortlist, 2

Let $ m$ and $ n$ be two positive integers. Let $ a_1$, $ a_2$, $ \ldots$, $ a_m$ be $ m$ different numbers from the set $ \{1, 2,\ldots, n\}$ such that for any two indices $ i$ and $ j$ with $ 1\leq i \leq j \leq m$ and $ a_i \plus{} a_j \leq n$, there exists an index $ k$ such that $ a_i \plus{} a_j \equal{} a_k$. Show that \[ \frac {a_1 \plus{} a_2 \plus{} ... \plus{} a_m}{m} \geq \frac {n \plus{} 1}{2}. \]

2015 JBMO TST - Turkey, 4

Tags: inequality
Prove that $$\dfrac{1}{a}+\dfrac{1}{b}+\dfrac{1}{c} \ge \dfrac{a}{b}+\dfrac{b}{c}+\dfrac{c}{a}+2(a+b+c)$$ for the all $a,b,c$ positive real numbers satisfying $a^2+b^2+c^2+2abc \le 1$.