Find all polynomials $P(x)$ of degree $1$ such that $\underset {a\le x\le b}{max} P(x) - \underset {a\le x\le b}{min} P(x) =b-a$ , $\forall a,b\in R$ where $a < b$

Let $ S\equal{}\{1,2,\ldots,n\}$. Let $ A$ be a subset of $ S$ such that for $ x,y\in A$, we have $ x\plus{}y\in A$ or $ x\plus{}y\minus{}n\in A$. Show that the number of elements of $ A$ divides $ n$.

There are $n$ different integers on the blackboard. Whenever two of these integers are chosen, either their sum or difference (possibly both) will be a positive integral power of $2$. Find the greatest possible value of $n$.

Find the maximum number of increasing arithmetic progressions that can have a finite sequence of real numbers $a_1<a_2<\cdots<a_n$ of $n\ge 3$ real numbers.

Let $ n$ and $ k$ be positive integers with $ k \geq n$ and $ k \minus{} n$ an even number. Let $ 2n$ lamps labelled $ 1$, $ 2$, ..., $ 2n$ be given, each of which can be either [i]on[/i] or [i]off[/i]. Initially all the lamps are off. We consider sequences of steps: at each step one of the lamps is switched (from on to off or from off to on). Let $ N$ be the number of such sequences consisting of $ k$ steps and resulting in the state where lamps $ 1$ through $ n$ are all on, and lamps $ n \plus{} 1$ through $ 2n$ are all off. Let $ M$ be number of such sequences consisting of $ k$ steps, resulting in the state where lamps $ 1$ through $ n$ are all on, and lamps $ n \plus{} 1$ through $ 2n$ are all off, but where none of the lamps $ n \plus{} 1$ through $ 2n$ is ever switched on. Determine $ \frac {N}{M}$. [i]Author: Bruno Le Floch and Ilia Smilga, France[/i]

The numbers $12,14,37,65$ are one of the solutions of the equation $xy-xz+yt=182$. What number corresponds to which letter?

In the trapezoid $ABCD$ , the base $AB$ is smaller than the $CD$ base. The point $K$ is chosen such that $AK$ is parallel to BC and $BK$ is parallel to $AD$. The points $P$ and $Q$ are chosen on the $AK$ and $BK$ rays respectively, such that $\angle ADP = \angle BCK$ and $\angle BCQ = \angle ADK$. (a) Show that the lines $AD, BC$ and $PQ$ go through the same point. (b) Assuming that the circumscribed circumferences of the $APD$ and $BCQ$ triangles intersect at two points, show that one of those points belongs to the line $PQ$.

Let $M$ be an interior point of the triangle $ABC$ such that $AMC = 90^\circ$, $AMB = 150^\circ$, and $BMC = 120^\circ$. The circumcenters of the triangles $AMC$, $AMB$, and $BMC$ are $P$, $Q$, and $R$ respectively. Prove that the area of $\Delta PQR$ is greater than or equal to the area of $\Delta ABC$.

Circles $o_1, o_2$ with equal radii intersect at points $A, B$. Points $C, D, E, F$ lie in this order on one line, with $C, E$ lying on $o_1$ and $D, F$ on $o_2$. Perpendicular bisectors of $CD$ and $EF$ intersect $AB$ at $X, Y$ respectively. Prove that $AX=BY$.

Conside the continuous $ f: \mathbb{R}\to\mathbb{R}$ . It is also know that equation $f(f(f(x)))=x$ has solution in $\mathbb{R}$. Prove that equation $f(x)=x$ has solution in $\mathbb{R}$.

Find all odd numbers $n\in \mathbb{N}$, for which the number of all natural numbers, that are no bigger than $n$ and coprime with $n$, divides $n^2+3$.

For which positive integer couples $(k,n)$, the equality $\Bigg|\Bigg\{{a \in \mathbb{Z}^+: 1\leq a\leq(nk)!, gcd \left(\binom{a}{k},n\right)=1}\Bigg\}\Bigg|=\frac{(nk)!}{6}$ holds?

Located inside equilateral triangle $ABC$ is a point $P$ such that $PA=8$, $PB=6$, and $PC=10$. To the nearest integer the area of triangle $ABC$ is: $\textbf{(A)}\ 159\qquad \textbf{(B)}\ 131\qquad \textbf{(C)}\ 95\qquad \textbf{(D)}\ 79\qquad \textbf{(E)}\ 50$

Find all pairs $(a,b)$ of positive integers such that $a^3$ is multiple of $b^2$ and $b-1$ is multiple of $a-1$.

Let $f(x)$ be a function which is differentiable twice and $f''(x)>0$ on $[0,\ 1]$. For a positive integer $n$, find $\lim_{n\to\infty} n\left\{\int_0^1 f(x)\ dx-\frac{1}{n}\sum_{k=0}^{n-1} f\left(\frac{k}{n}\right)\right\}.$

In a trapezoid $ABCD$ with $AD$ parallel to $BC$ points $E, F$ are on sides $AB, CD$ respectively. $A_1, C_1$ are on $AD,BC$ such that $A_1, E, F, A$ lie on a circle and so do $C_1, E, F, C$. Prove that lines $A_1C_1, BD, EF$ are concurrent.

On sides of convex quadrilateral $ABCD$ on external side constructed equilateral triangles $ABK, BCL, CDM, DAN$. Let $P,Q$- midpoints of $BL, AN$ respectively and $X$- circumcenter of $CMD$. Prove, that $PQ$ perpendicular to $KX$

Each integer in $\{1, 2, 3, . . . , 2020\}$ is coloured in such a way that, for all positive integers $a$ and $b$ such that $a + b \leq 2020$, the numbers $a$, $b$ and $a + b$ are not coloured with three different colours. Determine the maximum number of colours that can be used. [i]Massimiliano Foschi, Italy[/i]

Let $ABC$ be an acute triangle with orthocenter $H$. Let $G$ be the point such that the quadrilateral $ABGH$ is a parallelogram. Let $I$ be the point on the line $GH$ such that $AC$ bisects $HI$. Suppose that the line $AC$ intersects the circumcircle of the triangle $GCI$ at $C$ and $J$. Prove that $IJ = AH$.

Nick is taking a $10$ question test where each answer is either true or false with equal probability. Nick forgot to study, so he guesses randomly on each of the $10$ problems. What is the probability that Nick answers exactly half of the questions correctly?

What is the difference between the sum of the first $ 2003$ even counting numbers and the sum of the first $ 2003$ odd counting numbers? $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 2003 \qquad \textbf{(E)}\ 4006$

The diagram shows a rectangle that has been dissected into nine non-overlapping squares. Given that the width and the height of the rectangle are relatively prime positive integers, find the perimeter of the rectangle. [asy] defaultpen(linewidth(0.7)); draw((0,0)--(69,0)--(69,61)--(0,61)--(0,0));draw((36,0)--(36,36)--(0,36)); draw((36,33)--(69,33));draw((41,33)--(41,61));draw((25,36)--(25,61)); draw((34,36)--(34,45)--(25,45)); draw((36,36)--(36,38)--(34,38)); draw((36,38)--(41,38)); draw((34,45)--(41,45));[/asy]

Let $a$ be some positive number. Find the number of integer solutions $x$ of inequality $2 < xa < 3$ given that inequality $1 < xa < 2$ has exactly $3$ integer solutions. Consider all possible cases. [i](4 points)[/i]

Consider all the sums of the form \[\displaystyle\sum_{k=1}^{1985} e_kk^5=\pm 1^5\pm 2^5\pm\cdots\pm1985^5\] where $e_k=\pm 1$. What is the smallest nonnegative value attained by a sum of this type?

Determine the number of real solutions $a$ to the equation: \[ \left[\,\frac{1}{2}\;a\,\right]+\left[\,\frac{1}{3}\;a\,\right]+\left[\,\frac{1}{5}\;a\,\right] = a. \] Here, if $x$ is a real number, then $[\,x\,]$ denotes the greatest integer that is less than or equal to $x$.