a) Let $a,b\in R$, $a <b$. Prove that $x \in (a,b)$ if and only if there exists $\lambda \in (0,1)$ such that $x=\lambda a +(1-\lambda)b$. b) If the function $f: R \to R$ has the property: $$f (\lambda x+(1-\lambda) y) < \lambda f(x) + (1-\lambda)f(y), \forall x,y \in R, x\ne y, \forall \lambda \in (0,1), $$ prove that one cannot find four points on the function’s graph that are the vertices of a parallelogram

Given a pyramid with square base $ ABCD $ and vertex $ S $. Find the shortest path whose starting and ending point is the point $ S $ and which passes through all the vertices of the base.

Find all positive integers $x,y,z$ and $t$ such that $2^x3^y+5^z=7^t$.

Find the area of the smallest region bounded by the graphs of $y=|x|$ and $x^2+y^2=4$. $\textbf{(A) }\frac{\pi}{4}\qquad\textbf{(B) }\frac{3\pi}{4}\qquad\textbf{(C) }\pi\qquad\textbf{(D) }\frac{3\pi}{2}\qquad\textbf{(E) }2\pi$

Let $a, b, c$, and $d$ be four distinct integers. Prove that $(a-b)(a-c)(a-d)(b-c)(b-d)(c-d)$ is divisible by $12$.

There are $n$ cities in a country, where $n \geq 100$ is an integer. Some pairs of cities are connected by direct (two-way) flights. For two cities $A$ and $B$ we define: $(i)$ A $\emph{path}$ between $A$ and $B$ as a sequence of distinct cities $A = C_0, C_1, \dots, C_k, C_{k+1} = B$, $k \geq 0$, such that there are direct flights between $C_i$ and $C_{i+1}$ for every $0 \leq i \leq k$; $(ii)$ A $\emph{long path}$ between $A$ and $B$ as a path between $A$ and $B$ such that no other path between $A$ and $B$ has more cities; $(iii)$ A $\emph{short path}$ between $A$ and $B$ as a path between $A$ and $B$ such that no other path between $A$ and $B$ has fewer cities. Assume that for any pair of cities $A$ and $B$ in the country, there exist a long path and a short path between them that have no cities in common (except $A$ and $B$). Let $F$ be the total number of pairs of cities in the country that are connected by direct flights. In terms of $n$, find all possible values $F$ Proposed by David-Andrei Anghel, Romania.

Consider the expansion \[(1 + x + x^2 + x^3 + x^4)^{496} = a_0 + a_1x + \cdots + a_{1984}x^{1984}.\] [b](a)[/b] Determine the greatest common divisor of the coefficients $a_3, a_8, a_{13}, \ldots , a_{1983}.$ [b](b)[/b] Prove that $10^{340 }< a_{992} < 10^{347}.$

Prove that for integer $n$ we have: \[n! \le \left( \frac{n+1}{2} \right)^n\] [size=75][i](please note that the pupils in the competition never heard of AM-GM or alikes, it is intended to be solved without any knowledge on inequalities)[/i][/size]

Find all natural numbers $n$ that are smaller than $128^{97}$ and have exactly $2019$ divisors.

For integers $0\le a\le n$, let $f(n,a)$ denote the number of coefficients in the expansion of $(x+1)^a(x+2)^{n-a}$ that is divisible by $3.$ For example, $(x+1)^3(x+2)^1=x^4+5x^3+9x^2+7x+2$, so $f(4,3)=1$. For each positive integer $n$, let $F(n)$ be the minimum of $f(n,0),f(n,1),\ldots ,f(n,n)$. (1) Prove that there exist infinitely many positive integer $n$ such that $F(n)\ge \frac{n-1}{3}$. (2) Prove that for any positive integer $n$, $F(n)\le \frac{n-1}{3}$.

Triangle $ABC$ satisfies $\overline{CA} > \overline{AB}$. Let the incenter of triangle $ABC$ be $\omega$, which touches $BC, CA, AB$ at $D, E, F$, respectively. Let $M$ be the midpoint of $BC$. Let the circle centered at $M$ passing through $D$ intersect $DE, DF$ at $P(\neq D), Q(\neq D)$, respecively. Let line $AP$ meet $BC$ at $N$, line $BP$ meet $CA$ at $L$. Prove that the three lines $EQ, FP, NL$ are concurrent.

Seven cards numbered $1$ through $7$ lay stacked in a pile in ascending order from top to bottom ($1$ on top, $7$ on bottom). A shuffle involves picking a random card [i]of the six not currently on top[/i], and putting it on top. The relative order of all the other cards remains unchanged. Find the probability that, after $10$ shuffles, $6$ is higher in the pile than $3$.

The rook, standing on the surface of the checkered cube, beats the cells, located in the same row as well as on the continuations of this series through one or even several edges. (The picture shows an example for a $4 \times 4 \times 4$ cube,visible cells that some beat the rook, shaded gray.) What is the largest number do not beat each other rooks can be placed on the surface of the cube $50 \times 50 \times 50$?

In an acute triangle $ABC$,$O$ is the center of the circumscribed circle $\omega$, $P$ is the point of intersection of the tangents to $\omega$ through the points $B$ and $C$, the median AM intersects the circle $\omega$ at point $D$. Prove that points $A, D, P$ and $O$ lie on the same circle. (D. Prokopenko)

Justine has a coin which will come up the same as the last flip $\frac23$ of the time and the other side $\frac13$ of the time. She flips it and it comes up heads. She then flips it $2010$ more times. What is the probability that the last flip is heads?

$(NET 4)$ A boy has a set of trains and pieces of railroad track. Each piece is a quarter of circle, and by concatenating these pieces, the boy obtained a closed railway. The railway does not intersect itself. In passing through this railway, the train sometimes goes in the clockwise direction, and sometimes in the opposite direction. Prove that the train passes an even number of times through the pieces in the clockwise direction and an even number of times in the counterclockwise direction. Also, prove that the number of pieces is divisible by $4.$

Let $ C $ denote the complex unit circle centered at the origin. [b]a)[/b] Prove that $ \left( |z+1|-\sqrt 2 \right)\cdot \left( |z-1|-\sqrt 2 \right)\le 0,\quad\forall z\in C. $ [b]b)[/b] Prove that for any twelve numbers from $ C, $ namely $ z_1,\ldots ,z_{12} , $ there exist another twelve numbers $ \varepsilon_1,\ldots ,\varepsilon_{12}\in\{-1,1\} $ such that $$ \sum_{k=1}^{12} \left| z_k+\varepsilon_k \right| <17. $$

Each of the $n^2$ cells of an $n \times n$ grid is colored either black or white. Let $a_i$ denote the number of white cells in the $i$-th row, and let $b_i$ denote the number of black cells in the $i$-th column. Determine the maximum value of $\sum_{i=1}^n a_ib_i$ over all coloring schemes of the grid. [i]Proposed by Alex Zhai[/i]

For nonnegative integers $a$ and $b$ with $a + b \leq 6$, let $T(a, b) = \binom{6}{a} \binom{6}{b} \binom{6}{a + b}$. Let $S$ denote the sum of all $T(a, b)$, where $a$ and $b$ are nonnegative integers with $a + b \leq 6$. Find the remainder when $S$ is divided by $1000$.

Find all prime numbers $p$ and positive integers $m$ such that $2p^2 + p + 9 = m^2.$

Solve in positive reals the system: $x+y+z+w=4$ $\frac{1}{x}+\frac{1}{y}+\frac{1}{z}+\frac{1}{w}=5-\frac{1}{xyzw}$

Let $r$ be a positive integer, and let $a_0 , a_1 , \cdots $ be an infinite sequence of real numbers. Assume that for all nonnegative integers $m$ and $s$ there exists a positive integer $n \in [m+1, m+r]$ such that \[ a_m + a_{m+1} +\cdots +a_{m+s} = a_n + a_{n+1} +\cdots +a_{n+s} \] Prove that the sequence is periodic, i.e. there exists some $p \ge 1 $ such that $a_{n+p} =a_n $ for all $n \ge 0$.

The letter [b]M[/b] in the figure below is first reflected over the line $q$ and then reflected over the line $p$. What is the resulting image? [asy] // pog diagram usepackage("newtxtext"); size(3cm); draw((-1,0)--(1,0)); draw((0,-1)--(0,1)); label("$\textbf{\textsf{M}}$",(0.25,0.6)); draw((-0.8,-0.8)--(0.8,0.8),linewidth(1.1)); label("$p$", (-1,0),NE); label("$q$", (-0.75,-0.75), N*1.5); [/asy] [asy] // pog diagram usepackage("newtxtext"); size(12.5cm); draw((-1,0)--(1,0)); draw((0,-1)--(0,1)); label(rotate(90)*"$\textbf{\textsf{M}}$",(0.6,-0.25)); draw((-0.8,-0.8)--(0.8,0.8),linewidth(1.1)); label("$\textbf{(A)}$",(-1,1),W); draw((2,0)--(4,0)); draw((3,-1)--(3,1)); label(rotate(270)*"$\textbf{\textsf{M}}$",(2.8,0.7)); draw((2.2,-0.8)--(3.8,0.8),linewidth(1.1)); label("$\textbf{(B)}$",(2,1),W); draw((5,0)--(7,0)); draw((6,-1)--(6,1)); label(rotate(90)*"$\textbf{\textsf{M}}$",(5.4,0.2)); draw((5.2,-0.8)--(6.8,0.8),linewidth(1.1)); label("$\textbf{(C)}$",(5,1),W); draw((-1,-2.5)--(1,-2.5)); draw((0,-3.5)--(0,-1.5)); label(rotate(180)*"$\textbf{\textsf{M}}$",(-0.25,-3.1)); draw((-0.8,-3.3)--(0.8,-1.7),linewidth(1.1)); label("$\textbf{(D)}$",(-1,-1.5),W); draw((2,-2.5)--(4,-2.5)); draw((3,-3.5)--(3,-1.5)); label(rotate(270)*"$\textbf{\textsf{M}}$",(3.6,-2.75)); draw((2.2,-3.3)--(3.8,-1.7),linewidth(1.1)); label("$\textbf{(E)}$",(2,-1.5),W); [/asy]

There are $n$ natural numbers written on the board. Every move, we could erase $a,b$ and change it to $\gcd(a,b)$ and $\text{lcm}(a,b) - \gcd(a,b)$. Prove that in finite number of moves, all numbers in the board could be made to be equal.

A circle centered at point $O$ is separated by points $A_1,A_2,...,A_n$ on $n$ equal parts (points are listed sequentially clockwise) and the rays $OA_1,OA_2,...,OA_n$ are constructed. The angle $A_2OA_3$ is divided by rays into two equal angles at vertex $O$, the angle $A_3OA_4$ is divided into three equal angles, and so on, finally, the angle $A_nOA_1$ divided into $n$ equal angles at vertex $O$. A point belonging to the ray other than $OA_1$, is connected by a segment with its orthogonal projection $B_0$ on the neighboring (clockwise) arrow) with ray $OA_1$, point$ B_1$ is connected by a segment with its orthogonal projection on the next (clockwise) ray, etc. As a result of such process it turns out the broken line $B_0B_1B_2B_3...$ infinitely "twists". Consider the question of giving the thus obtained broken numerical value of "length" $L (n)$ and explore the value of $L(n)$ depending on $n$.