Let $ 0 < x_{1}\leq\frac {x_{2}}{2}\leq\cdots\leq\frac {x_{n}}{n}, 0 < y_{n}\leq y_{n \minus{} 1}\leq\cdots\leq y_{1},$ Prove that $ (\sum_{k \equal{} 1}^{n}x_{k}y_{k})^2\leq(\sum_{k \equal{} 1}^{n}y_{k})(\sum_{k \equal{} 1}^{n}(x_{k}^2 \minus{} \frac {1}{4}x_{k}x_{k \minus{} 1})y_{k}).$ where $ x_{0} \equal{} 0.$

In a regular 100-gon, 41 vertices are colored black and the remaining 59 vertices are colored white. Prove that there exist 24 convex quadrilaterals $Q_{1}, \ldots, Q_{24}$ whose corners are vertices of the 100-gon, so that [list] [*] the quadrilaterals $Q_{1}, \ldots, Q_{24}$ are pairwise disjoint, and [*] every quadrilateral $Q_{i}$ has three corners of one color and one corner of the other color. [/list]

Find, with proof, the smallest real number $C$ with the following property: For every infinite sequence $\{x_i\}$ of positive real numbers such that $x_1 + x_2 +\cdots + x_n \leq x_{n+1}$ for $n = 1, 2, 3, \cdots$, we have \[\sqrt{x_1}+\sqrt{x_2}+\cdots+\sqrt{x_n} \leq C \sqrt{x_1+x_2+\cdots+x_n} \qquad \forall n \in \mathbb N.\]

Let $(a_i)_{i\in \mathbb{N}}$ be a sequence with $a_1=\frac{3}2$ such that $$a_{n+1}=1+\frac{n}{a_n}$$ Find $n$ such that $2020\le a_n <2021$

Let $p$ be an odd prime, and put $N=\frac{1}{4} (p^3 -p) -1.$ The numbers $1,2, \dots, N$ are painted arbitrarily in two colors, red and blue. For any positive integer $n \leqslant N,$ denote $r(n)$ the fraction of integers $\{ 1,2, \dots, n \}$ that are red. Prove that there exists a positive integer $a \in \{ 1,2, \dots, p-1\}$ such that $r(n) \neq a/p$ for all $n = 1,2, \dots , N.$ [I]Netherlands[/i]

Let $n > 1$ be a positive integer. A 2-dimensional grid, infinite in all directions, is given. Each 1 by 1 square in a given $n$ by $n$ square has a counter on it. A [i]move[/i] consists of taking $n$ adjacent counters in a row or column and sliding them each by one space along that row or column. A [i]returning sequence[/i] is a finite sequence of moves such that all counters again fill the original $n$ by $n$ square at the end of the sequence. [list] [*] Assume that all counters are distinguishable except two, which are indistinguishable from each other. Prove that any distinguishable arrangement of counters in the $n$ by $n$ square can be reached by a returning sequence. [*] Assume all counters are distinguishable. Prove that there is no returning sequence that switches two counters and returns the rest to their original positions.[/list] [i]Mitchell Lee and Benjamin Gunby.[/i]

Let $n$ be an integer greater than 1. Suppose $2n$ points are given in the plane, no three of which are collinear. Suppose $n$ of the given $2n$ points are colored blue and the other $n$ colored red. A line in the plane is called a [i]balancing line[/i] if it passes through one blue and one red point and, for each side of the line, the number of blue points on that side is equal to the number of red points on the same side. Prove that there exist at least two balancing lines.

Find all functions $f:\mathbb{Z}^{+} \rightarrow \mathbb{Z}^{+}$ such that the conditions $\quad a) \quad a-b \mid f(a)-f(b)$ for all $a\neq b$ and $a,b \in \mathbb{Z}^{+}$ $\quad b) \quad f(\varphi(a))=\varphi(f(a))$ for all $a \in \mathbb{Z}^{+}$ where $\varphi$ is the Euler's totient function. holds

Find the smallest positive real number $k$ such that the following inequality holds $$\left|z_{1}+\ldots+z_{n}\right| \geqslant \frac{1}{k}\big(\left|z_{1}\right|+\ldots+\left|z_{n}\right|\big) .$$ for every positive integer $n \geqslant 2$ and every choice $z_{1}, \ldots, z_{n}$ of complex numbers with non-negative real and imaginary parts. [Hint: First find $k$ that works for $n=2$. Then show that the same $k$ works for any $n \geqslant 2$.]

Find all functions $f$ from the reals to the reals such that \[ \left(f(x)+f(z)\right)\left(f(y)+f(t)\right)=f(xy-zt)+f(xt+yz) \] for all real $x,y,z,t$.

For any positive integer $n$, define $a_n$ to be the product of the digits of $n$. (a) Prove that $n \geq a(n)$ for all positive integers $n$. (b) Find all $n$ for which $n^2-17n+56 = a(n)$.

Suppose that a sequence $a_1,a_2,\ldots$ of positive real numbers satisfies \[a_{k+1}\geq\frac{ka_k}{a_k^2+(k-1)}\] for every positive integer $k$. Prove that $a_1+a_2+\ldots+a_n\geq n$ for every $n\geq2$.

$200n$ diagonals are drawn in a convex $n$-gon. Prove that one of them intersects at least 10000 others. [b]proposed by D. Karpov, S. Berlov[/b]

Let $a_1,a_2,\ldots a_n,k$, and $M$ be positive integers such that $$\frac{1}{a_1}+\frac{1}{a_2}+\cdots+\frac{1}{a_n}=k\quad\text{and}\quad a_1a_2\cdots a_n=M.$$ If $M>1$, prove that the polynomial $$P(x)=M(x+1)^k-(x+a_1)(x+a_2)\cdots (x+a_n)$$ has no positive roots.