Found problems: 112
Let $x_1, \ldots , x_{100}$ be nonnegative real numbers such that $x_i + x_{i+1} + x_{i+2} \leq 1$ for all $i = 1, \ldots , 100$ (we put $x_{101 } = x_1, x_{102} = x_2).$ Find the maximal possible value of the sum $S = \sum^{100}_{i=1} x_i x_{i+2}.$
[i]Proposed by Sergei Berlov, Ilya Bogdanov, Russia[/i]
Let $n\ge 3$ be an integer, and let $a_2,a_3,\ldots ,a_n$ be positive real numbers such that $a_{2}a_{3}\cdots a_{n}=1$. Prove that
\[(1 + a_2)^2 (1 + a_3)^3 \dotsm (1 + a_n)^n > n^n.\]
[i]Proposed by Angelo Di Pasquale, Australia[/i]
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]
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)\]
For every positive integer $n$ determine the least possible value of the expression
\[|x_{1}|+|x_{1}-x_{2}|+|x_{1}+x_{2}-x_{3}|+\dots +|x_{1}+x_{2}+\dots +x_{n-1}-x_{n}|\]
given that $x_{1}, x_{2}, \dots , x_{n}$ are real numbers satisfying $|x_{1}|+|x_{2}|+\dots+|x_{n}| = 1$.
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) .\]
The positive integers $a_1,a_2, \dots, a_n$ are aligned clockwise in a circular line with $n \geq 5$. Let $a_0=a_n$ and $a_{n+1}=a_1$. For each $i \in \{1,2,\dots,n \}$ the quotient \[ q_i=\frac{a_{i-1}+a_{i+1}}{a_i} \] is an integer. Prove \[ 2n \leq q_1+q_2+\dots+q_n < 3n. \]
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.
Let $n$ be a positive integer and let $a_1,\cdots ,a_n$ be real numbers satisfying $0\le a_i\le 1$ for $i=1,\cdots ,n.$ Prove the inequality \[(1-{a_i}^n)(1-{a_2}^n)\cdots (1-{a_n}^n)\le (1-a_1a_2\cdots a_n)^n.\]
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.$
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?
For a given positive integer $n\ge 2$, suppose positive integers $a_i$ where $1\le i\le n$ satisfy $a_1<a_2<\ldots <a_n$ and $\sum_{i=1}^n \frac{1}{a_i}\le 1$. Prove that, for any real number $x$, the following inequality holds
\[\left(\sum_{i=1}^n\frac{1}{a_i^2+x^2}\right)^2\le\frac{1}{2}\cdot\frac{1}{a_1(a_1-1)+x^2} \]
[i]Li Shenghong[/i]
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$.
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 $x_1, x_2, ... , x_n$ and $y_1, y_2, ..., y_n$ be positive real numbers so that
$$x_1 + x_2 + ...+ x_n \ge x_1y_1 + x_2y_2 + ... + x_ny_n.$$
Show that for any non-negative integer $p$ the following inequality holds
$$\frac{x_1}{y_1^p} +\frac{ x_2}{y_2^p} + ...+ \frac{x_n}{y_n^p} \ge x_1 + x_2 + ...+ x_n.$$
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}$.
Let $n \geq 2$ be an integer. Positive reals $x_1, x_2, \cdots, x_n$ satisfy $x_1x_2 \cdots x_n = 1$.
Show: $$\{x_1\} + \{x_2\} + \cdots + \{x_n\} < \frac{2n-1}{2}$$
Where $\{x\}$ denotes the fractional part of $x$.
Let be a natural number $ n\ge 2 $ and $ n $ positive real numbers $ a_1,a_n,\ldots ,a_n $ that satisfy the inequalities
$$ \sum_{j=1}^i a_j\le a_{i+1} ,\quad \forall i\in\{ 1,2,\ldots ,n-1 \} . $$
Prove that
$$ \sum_{k=1}^{n-1} \frac{a_k}{a_{k+1}}\le n/2 . $$
Let $x_1, \ldots , x_{100}$ be nonnegative real numbers such that $x_i + x_{i+1} + x_{i+2} \leq 1$ for all $i = 1, \ldots , 100$ (we put $x_{101 } = x_1, x_{102} = x_2).$ Find the maximal possible value of the sum $S = \sum^{100}_{i=1} x_i x_{i+2}.$
[i]Proposed by Sergei Berlov, Ilya Bogdanov, Russia[/i]
Let $x_1,x_2,\dots,x_n$ be positive numbers with product equal to 1. Prove that there exists a $k\in\{1,2,\dots,n\}$ such that
\[\frac{x_k}{k+x_1+x_2+\cdots+x_k}\ge 1-\frac{1}{\sqrt[n]{2}}.\]
Let $n\geq 2$ be some fixed positive integer and suppose that $a_1, a_2,\dots,a_n$ are positive real numbers satisfying $a_1+a_2+\cdots+a_n=2^n-1$.
Find the minimum possible value of $$\frac{a_1}{1}+\frac{a_2}{1+a_1}+\frac{a_3}{1+a_1+a_2}+\cdots+\frac{a_n}{1+a_1+a_2+\cdots+a_{n-1}}$$
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]
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]
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. $
Let $n\ge 3$ be an integer, and let $a_2,a_3,\ldots ,a_n$ be positive real numbers such that $a_{2}a_{3}\cdots a_{n}=1$. Prove that
\[(1 + a_2)^2 (1 + a_3)^3 \dotsm (1 + a_n)^n > n^n.\]
[i]Proposed by Angelo Di Pasquale, Australia[/i]