Let $ n$ be a given positive integer. Show that we can choose numbers $ c_k\in\{\minus{}1,1\}$ ($ i\le k\le n$) such that \[ 0\le\sum_{k\equal{}1}^nc_k\cdot k^2\le4.\]

A train passes an observer in $t_1$ sec. At the same speed the train crosses a bridge $\ell$ m long. It takes the train $t_2$ sec to cross the bridge from the moment the locomotive drives onto the bridge until the last car leaves it. Find the length and speed of the train.

The numbers $1, 2, ..., 2020$ and $2021$ are written on a blackboard. The following operation is executed: Two numbers are chosen, both are erased and replaced by the absolute value of their difference. This operation is repeated until there is only one number left on the blackboard. (a) Show that $2021$ can be the final number on the blackboard. (b) Show that $2020$ cannot be the final number on the blackboard. (Karl Czakler)

Among the $900$ residents of Aimeville, there are $195$ who own a diamond ring, $367$ who own a set of golf clubs, and $562$ who own a garden spade. In addition, each of the $900$ residents owns a bag of candy hearts. There are $437$ residents who own exactly two of these things, and $234$ residents who own exactly three of these things. Find the number of residents of Aimeville who own all four of these things.

Let $ABC$ be a triangle. Its incircle meets the sides $BC, CA$ and $AB$ in the points $D, E$ and $F$, respectively. Let $P$ denote the intersection point of $ED$ and the line perpendicular to $EF$ and passing through $F$, and similarly let $Q$ denote the intersection point of $EF$ and the line perpendicular to $ED$ and passing through $D$. Prove that $B$ is the mid-point of the segment $PQ$. Proposed by Karl Czakler

Let a triangle $ABC$ inscribed in circle $c(O,R)$ and $D$ an arbitrary point on $BC$(different from the midpoint).The circumscribed circle of $BOD$,which is $(c_1)$, meets $c(O,R)$ at $K$ and $AB$ at $Z$.The circumscribed circle of $COD$ $(c_2)$,meets $c(O,R)$ at $M$ and $AC$ at $E$.Finally, the circumscribed circle of $AEZ$ $(c_3)$,meets $c(O,R)$ at $N$.Prove that $\triangle{ABC}=\triangle{KMN}.$

Let $P(X)=a_{2n+1}X^{2n+1}+a_{2n}X^{2n}+...+a_1X+a_0$ be a polynomial with all positive coefficients. Prove that there exists a permutation $(b_{2n+1},b_{2n},...,b_1,b_0)$ of numbers $(a_{2n+1},a_{2n},...,a_1,a_0)$ such that the polynomial $Q(X)=b_{2n+1}X^{2n+1}+b_{2n}X^{2n}+...+b_1X+b_0$ has exactly one real root.

An $8'\text{ X }10'$ table sits in the corner of a square room, as in Figure 1 below. The owners desire to move the table to the position shown in Figure 2. The side of the room is $S$ feet. What is the smallest integer value of $S$ for which the table can be moved as desired without tilting it or taking it apart? [asy] size(200); defaultpen(linewidth(0.7)+fontsize(10)); pair A=(0,0), B=(16,0), C=(16,16), D=(0,16), E=(32,0), F=(48,0), G=(48,16), H=(32,16), I=(0,8), J=(10,8), K=(10,16), L=(32,6), M=(40,6), N=(40,16); draw(A--B--C--D--A^^E--F--G--H--E^^I--J--K^^L--M--N); label("S", (18,8)); label("S", (50,8)); label("Figure 1", (A+B)/2, 2*S); label("Figure 2", (E+F)/2, 2*S); label("10'", (I+J)/2, S); label("8'", (12,12)); label("8'", (L+M)/2, S); label("10'", (42,11)); label("table", (5,12)); label("table", (36,11)); [/asy] $ \textbf{(A)}\ 11\qquad\textbf{(B)}\ 12\qquad\textbf{(C)}\ 13\qquad\textbf{(D)}\ 14\qquad\textbf{(E)}\ 15 $

Let $A_1A_2 \dots A_n$ be a polygon (not necessarily regular) with $n$ sides. Suppose there is a translation that maps each point $A_i$ to a point $B_i$ in the same plane. For convenience, define $A_0 = A_n$ and $B_0 = B_n$. Prove that \[ \sum_{i=1}^{n} (A_{i-1} B_{i})^2 = \sum_{i=1}^{n} (B_{i-1} A_{i})^2 \, . \]

On a circular table are sitting $ 2n$ people, equally spaced in between. $ m$ cookies are given to these people, and they give cookies to their neighbors according to the following rule. (i) One may give cookies only to people adjacent to himself. (ii) In order to give a cookie to one's neighbor, one must eat a cookie. Select arbitrarily a person $ A$ sitting on the table. Find the minimum value $ m$ such that there is a strategy in which $ A$ can eventually receive a cookie, independent of the distribution of cookies at the beginning.

For exactly two real values of $b$, $b_1$ and $b_2$, the line $y=bx-17$ intersects the parabola $y=x^2 +2x+3$ at exactly one point. Compute $b_1^2+b_2^2$.

Let $n$ be a positive integer and $\mathcal S$ be the set of points $(x, y)$ with $x, y \in \{1, 2, \ldots , n\}$. Let $\mathcal T$ be the set of all squares with vertices in the set $\mathcal S$. We denote by $a_k$ ($k \geq 0$) the number of (unordered) pairs of points for which there are exactly $k$ squares in $\mathcal T$ having these two points as vertices. Prove that $a_0 = a_2 + 2a_3$. [i]Yugoslavia[/i]

Let $\omega=e^{\frac{2\pi i}{2017}}$ and $\zeta = e^{\frac{2\pi i}{2019}}$. Let $S=\{(a,b)\in\mathbb{Z}\,|\,0\leq a \leq 2016, 0 \leq b \leq 2018, (a,b)\neq (0,0)\}$. Compute $$\prod_{(a,b)\in S}(\omega^a-\zeta^b).$$

$ 30$ students participated in the mathematical Olympiad. Each of them was given $ 8$ problems to solve. Jury estimated their work with the following rule: 1) Each problem was worth $ k$ points, if it wasn't solved by exactly $ k$ students; 2) Each student received the maximum possible points in each problem or got $ 0$ in it; Lasha got the least number of points. What's the maximal number of points he could have? Remark: 1) means that if the problem was solved by exactly $ k$ students, than each of them got $ 30 \minus{} k$ points in it.

Let $f(x)=\lim_{n\to\infty} \frac{\sin^{n+2}x+\cos^{n+2}x}{\sin^n x+\cos^n x}$ for $0\leq x\leq \frac{\pi}2.$ Evaluate $\int_0^{\frac{\pi}2} f(x)\ dx.$

Evaluate \[\int_0^{\pi} \{(1-x\sin 2x)e^{\cos ^2 x}+(1+x\sin 2x)e^{\sin ^ 2 x}\}\ dx.\]