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

1997 Estonia Team Selection Test, 2

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?

1967 IMO Longlists, 47

Prove the following inequality: \[\prod^k_{i=1} x_i \cdot \sum^k_{i=1} x^{n-1}_i \leq \sum^k_{i=1} x^{n+k-1}_i,\] where $x_i > 0,$ $k \in \mathbb{N}, n \in \mathbb{N}.$

2004 All-Russian Olympiad, 4

Let $n > 3$ be a natural number, and let $x_1$, $x_2$, ..., $x_n$ be $n$ positive real numbers whose product is $1$. Prove the inequality \[ \frac {1}{1 + x_1 + x_1\cdot x_2} + \frac {1}{1 + x_2 + x_2\cdot x_3} + ... + \frac {1}{1 + x_n + x_n\cdot x_1} > 1. \]

1966 IMO Shortlist, 13

Let $a_1, a_2, \ldots, a_n$ be positive real numbers. Prove the inequality \[\binom n2 \sum_{i<j} \frac{1}{a_ia_j} \geq 4 \left( \sum_{i<j} \frac{1}{a_i+a_j} \right)^2\]

1971 IMO Shortlist, 5

Let \[ E_n=(a_1-a_2)(a_1-a_3)\ldots(a_1-a_n)+(a_2-a_1)(a_2-a_3)\ldots(a_2-a_n)+\ldots+(a_n-a_1)(a_n-a_2)\ldots(a_n-a_{n-1}). \] Let $S_n$ be the proposition that $E_n\ge0$ for all real $a_i$. Prove that $S_n$ is true for $n=3$ and $5$, but for no other $n>2$.

2020 Bulgaria National Olympiad, P2

Let $b_1$, $\dots$ , $b_n$ be nonnegative integers with sum $2$ and $a_0$, $a_1$, $\dots$ , $a_n$ be real numbers such that $a_0=a_n=0$ and $|a_i-a_{i-1}|\leq b_i$ for each $i=1$, $\dots$ , $n$. Prove that $$\sum_{i=1}^n(a_i+a_{i-1})b_i\leq 2$$ [hide]I believe that the original problem was for nonnegative real numbers and it was a typo on the version of the exam paper we had but I'm not sure the inequality would hold[/hide]

2018 Romania Team Selection Tests, 1

Find the least number $ c$ satisfyng the condition $\sum_{i=1}^n {x_i}^2\leq cn$ and all real numbers $x_1,x_2,...,x_n$ are greater than or equal to $-1$ such that $\sum_{i=1}^n {x_i}^3=0$

1984 Balkan MO, 1

Let $n \geq 2$ be a positive integer and $a_{1},\ldots , a_{n}$ be positive real numbers such that $a_{1}+...+a_{n}= 1$. Prove that: \[\frac{a_{1}}{1+a_{2}+\cdots +a_{n}}+\cdots +\frac{a_{n}}{1+a_{1}+a_{2}+\cdots +a_{n-1}}\geq \frac{n}{2n-1}\]

1994 Balkan MO, 3

Let $a_1,a_2,\ldots,a_n$ be a permutation of the numbers $1,2,\ldots,n$, with $n\geq 2$. Determine the largest possible value of the sum \[ S(n)=|a_2-a_1|+ |a_3-a_2| + \cdots + |a_n-a_{n-1}| . \] [i]Romania[/i]

1970 IMO Shortlist, 9

Let $u_1, u_2, \ldots, u_n, v_1, v_2, \ldots, v_n$ be real numbers. Prove that \[1+ \sum_{i=1}^n (u_i+v_i)^2 \leq \frac 43 \Biggr( 1+ \sum_{i=1}^n u_i^2 \Biggl) \Biggr( 1+ \sum_{i=1}^n v_i^2 \Biggl) .\]

2005 Romania National Olympiad, 4

Let $x_1,x_2,\ldots,x_n$ be positive reals. Prove that \[ \frac 1{1+x_1} + \frac 1{1+x_1+x_2} + \cdots + \frac 1{1+x_1+\cdots + x_n} < \sqrt { \frac 1{x_1} + \frac 1{x_2} + \cdots + \frac 1{x_n}} . \] [i]Bogdan Enescu[/i]

2015 IMO Shortlist, A3

Let $n$ be a fixed positive integer. Find the maximum possible value of \[ \sum_{1 \le r < s \le 2n} (s-r-n)x_rx_s, \] where $-1 \le x_i \le 1$ for all $i = 1, \cdots , 2n$.

1985 IMO Shortlist, 18

Let $x_1, x_2, \cdots , x_n$ be positive numbers. Prove that \[\frac{x_1^2}{x_1^2+x_2x_3} + \frac{x_2^2}{x_2^2+x_3x_4} + \cdots +\frac{x_{n-1}^2}{x_{n-1}^2+x_nx_1} +\frac{x_n^2}{x_n^2+x_1x_2} \leq n-1\]

2001 Kazakhstan National Olympiad, 3

For positive numbers $ x_1, x_2, \ldots, x_n $ $ (n \geq 1) $ the following equality holds $$ \frac {1} {{1 + x_1}} + \frac {1} {{1 + x_2}} + \ldots + \frac {1} {{1 + x_n}} = 1. $$ Prove that $ x_1 \cdot x_2 \cdot \ldots \cdot x_n \geq (n-1) ^ n. $

2021 Taiwan TST Round 3, A

Let $n$ and $k$ be positive integers. Prove that for $a_1, \dots, a_n \in [1,2^k]$ one has \[ \sum_{i = 1}^n \frac{a_i}{\sqrt{a_1^2 + \dots + a_i^2}} \le 4 \sqrt{kn}. \]

1987 IMO, 3

Let $x_1,x_2,\ldots,x_n$ be real numbers satisfying $x_1^2+x_2^2+\ldots+x_n^2=1$. Prove that for every integer $k\ge2$ there are integers $a_1,a_2,\ldots,a_n$, not all zero, such that $|a_i|\le k-1$ for all $i$, and $|a_1x_1+a_2x_2+\ldots+a_nx_n|\le{(k-1)\sqrt n\over k^n-1}$.

2016 EGMO, 1

Let $n$ be an odd positive integer, and let $x_1,x_2,\cdots ,x_n$ be non-negative real numbers. Show that \[ \min_{i=1,\ldots,n} (x_i^2+x_{i+1}^2) \leq \max_{j=1,\ldots,n} (2x_jx_{j+1}) \]where $x_{n+1}=x_1$.

2016 IMO Shortlist, A8

Find the largest real constant $a$ such that for all $n \geq 1$ and for all real numbers $x_0, x_1, ... , x_n$ satisfying $0 = x_0 < x_1 < x_2 < \cdots < x_n$ we have \[\frac{1}{x_1-x_0} + \frac{1}{x_2-x_1} + \dots + \frac{1}{x_n-x_{n-1}} \geq a \left( \frac{2}{x_1} + \frac{3}{x_2} + \dots + \frac{n+1}{x_n} \right)\]

1966 IMO Longlists, 26

Prove the inequality [b]a.)[/b] $ \left( a_{1}+a_{2}+...+a_{k}\right) ^{2}\leq k\left( a_{1}^{2}+a_{2}^{2}+...+a_{k}^{2}\right) , $ where $k\geq 1$ is a natural number and $a_{1},$ $a_{2},$ $...,$ $a_{k}$ are arbitrary real numbers. [b]b.)[/b] Using the inequality (1), show that if the real numbers $a_{1},$ $a_{2},$ $...,$ $a_{n}$ satisfy the inequality \[ a_{1}+a_{2}+...+a_{n}\geq \sqrt{\left( n-1\right) \left( a_{1}^{2}+a_{2}^{2}+...+a_{n}^{2}\right) }, \] then all of these numbers $a_{1},$ $a_{2},$ $\ldots,$ $a_{n}$ are non-negative.

1991 APMO, 3

Let $a_1$, $a_2$, $\cdots$, $a_n$, $b_1$, $b_2$, $\cdots$, $b_n$ be positive real numbers such that $a_1 + a_2 + \cdots + a_n = b_1 + b_2 + \cdots + b_n$. Show that \[ \frac{a_1^2}{a_1 + b_1} + \frac{a_2^2}{a_2 + b_2} + \cdots + \frac{a_n^2}{a_n + b_n} \geq \frac{a_1 + a_2 + \cdots + a_n}{2} \]

2021 IMO Shortlist, A4

Show that the inequality \[\sum_{i=1}^n \sum_{j=1}^n \sqrt{|x_i-x_j|}\leqslant \sum_{i=1}^n \sum_{j=1}^n \sqrt{|x_i+x_j|}\]holds for all real numbers $x_1,\ldots x_n.$

1999 Kazakhstan National Olympiad, 5

For real numbers $ x_1, x_2, \dots, x_n $ and $ y_1, y_2, \dots, y_n $ , the inequalities hold $ x_1 \geq x_2 \geq \ldots \geq x_n> 0 $ and $$ y_1 \geq x_1, ~ y_1y_2 \geq x_1x_2, ~ \dots, ~ y_1y_2 \dots y_n \geq x_1x_2 \dots x_n. $$ Prove that $ ny_1 + (n-1) y_2 + \dots + y_n \geq x_1 + 2x_2 + \dots + nx_n $.

1998 Singapore Team Selection Test, 2

Let $ a_1\geq \cdots \geq a_n \geq a_{n \plus{} 1} \equal{} 0$ be real numbers. Show that \[ \sqrt {\sum_{k \equal{} 1}^n a_k} \leq \sum_{k \equal{} 1}^n \sqrt k (\sqrt {a_k} \minus{} \sqrt {a_{k \plus{} 1}}). \] [i]Proposed by Romania[/i]

1967 IMO Shortlist, 6

Prove the following inequality: \[\prod^k_{i=1} x_i \cdot \sum^k_{i=1} x^{n-1}_i \leq \sum^k_{i=1} x^{n+k-1}_i,\] where $x_i > 0,$ $k \in \mathbb{N}, n \in \mathbb{N}.$

2010 Danube Mathematical Olympiad, 5

Let $n\ge3$ be a positive integer. Find the real numbers $x_1\ge0,\ldots,x_n\ge 0$, with $x_1+x_2+\ldots +x_n=n$, for which the expression \[(n-1)(x_1^2+x_2^2+\ldots+x_n^2)+nx_1x_2\ldots x_n\] takes a minimal value.