What maximum number of elements can be selected from the set $\{1, 2, 3, \dots, 100\}$ so that [b]no[/b] sum of any three selected numbers is equal to a selected number? [i]Proposed by A. Golovanov[/i]

We colour every square of the $ 2009$ x $ 2009$ board with one of $ n$ colours (we do not have to use every colour). A colour is called connected if either there is only one square of that colour or any two squares of the colour can be reached from one another by a sequence of moves of a chess queen without intermediate stops at squares having another colour (a chess quen moves horizontally, vertically or diagonally). Find the maximum $ n$, such that for every colouring of the board at least on colour present at the board is connected.

Alice and Bob are playing game on an $n \times n$ grid. Alice goes first, and they take turns drawing a black point from the coordinate set \[\{(i, j) \mid i, j \in \mathbb{N}, 1 \leq i, j \leq n\}\] There is a constraint that the distance between any two black points cannot be an integer. The player who cannot draw a black point loses. Find all integers $n$ such that Alice has a winning strategy. [i]Proposed by chengbilly[/i]

For $x\geq 0$, Prove that $\int_0^x (t-t^2)\sin ^{2002} t \,dt<\frac{1}{2004\cdot 2005}$

Eighteen people are standing in a (socially-distanced) line to enter a grocery store. Five people are wearing a black mask, $6$ are wearing a gray mask, and $7$ are wearing a white mask. Suppose that these $18$ people got on line in a random order. The expected number of pairs of adjacent people wearing different-colored masks can be given by $\tfrac{a}{b}$, where $\gcd(a, b) = 1$. Compute $a+b$.

Sequence $(G_n)$ is defined by $G_0 = 0, G_1 = 1$ and $G_n = G_{n-1} + G_{n-2} + 1$ for every $n \ge2$. Prove that for every positive integer $m$ there exist two consecutive terms in the sequence that are both divisible by $m$.

Find all positive integers $n \geq 3$ for which there exists a set $S$ which consists of rational numbers such that the following two conditions hold: 1) any rational number can be represented as the sum of at most $n$ elements of $S$ 2) there exists a rational number, which can not be represented as the sum of at most $n-1$ elements of $S$ (in the sum some elements can repeat) [i]M. Shutro, M. Zorka[/i]

A cyclic quadrilateral $ABCD$ is given. An arbitrary circle passing through $C$ and $D$ meets $AC,BC$ at points $X,Y$ respectively. Find the locus of common points of circles $CAY$ and $CBX$.

Let $\tau(n)$ denote the number of positive divisors of the positive integer $n$. Prove that there exist infinitely many positive integers $a$ such that the equation $ \tau(an)=n $ does not have a positive integer solution $n$.

Let $N$ be a positive integer such that the sum of the squares of all positive divisors of $N$ is equal to the product $N(N+3)$. Prove that there exist two indices $i$ and $j$ such that $N=F_iF_j$ where $(F_i)_{n=1}^{\infty}$ is the Fibonacci sequence defined as $F_1=F_2=1$ and $F_n=F_{n-1}+F_{n-2}$ for $n\geq 3$. [i]Proposed by Alain Rossier, Switzerland[/i]

Given a quadrilateral $ABCD$ such that $AB^2 + CD^2 = AD^2 + BC^2$, prove that $AC \perp BD$.

Assuming that the roots of $x^3 + p \cdot x^2 + q \cdot x + r = 0$ are real and positive, find a relation between $p,q$ and $r$ which gives a necessary condition for the roots to be exactly the cosines of the three angles of a triangle.

Let $F$ be a family of subsets of $S = \left \{ 1,2,...,n \right \}$ ($n \geq 2$). A valid play is to choose two disjoint sets $A$ and $B$ from $F$ and add $A \cup B$ to $F$ (without removing $A$ and $B$). Initially, $F$ has all the subsets that contain only one element of $S$. The goal is to have all subsets of $n - 1$ elements of $S$ in $F$ using valid plays. Determine the lowest number of plays required in order to achieve the goal.

For how many positive integers $n$ less than or equal to $1000$ is \[(\sin t + i \cos t)^n=\sin nt + i \cos nt\] true for all real $t$?

Suppose that we are given an $n$-gon of which all sides have the same length, and of which all the vertices have rational coordinates. Prove that $n$ is even.

How many $0$'s are there in the sequence $x_1, x_2,..., x_{2014}$ where $x_n =\big[ \frac{n + 1}{\sqrt{2015}}\big] -\big[ \frac{n }{\sqrt{2015}}\big]$ , $n = 1, 2,...,2014$ ? (A): $1128$, (B): $1129$, (C): $1130$, (D): $1131$, (E) None of the above.

Let $a,b,A,B$ be given reals. We consider the function defined by \[ f(x) = 1 - a \cdot \cos(x) - b \cdot \sin(x) - A \cdot \cos(2x) - B \cdot \sin(2x). \] Prove that if for any real number $x$ we have $f(x) \geq 0$ then $a^2 + b^2 \leq 2$ and $A^2 + B^2 \leq 1.$

A convex pentagon $ ABCDE$ is inscribed in a circle. The distances of $ A$ from the lines $ BC,CD,DE$ are $ a,b,c,$ respectively. Compute the distance of $ A$ from the line $ BE$.

Several dwarves were lined up in a row, and then they lined up in a row in a different order. Is it possible that exactly one third of the dwarves have both of their neighbours remained and exactly one third of the dwarves have only one of their neighbours remained, if the number of the dwarves is a) 6; b) 9?

A man gets lost in a large forest, the boundary of which is a straight line. (We can assume that the forest fills the half-plane.) It is known that the distance from a person to Granina forest does not exceed $2$ km. a) Suggest a path along which he will certainly be able to get out of the forest after walking no more than $14$ km. (Of course, a person does not know in which direction the border of the forest is, BUT he has the opportunity to move along any pre-selected curve. It is believed that a person left the forest as soon as he reached its border, while the border of the forest is invisible to him, no matter how close he would have approached it.) b) Find a path with the same property and length no more than $13$ km.

Find the real number satisfying $x=\sqrt{1+\sqrt{1+\sqrt{1+x}}}$.

A triangle is inscribed in a circle. The vertices of the triangle divide the circle into three arcs of lengths $3$, $4$, and $5$. What is the area of the triangle? $\textbf{(A)}\ 6 \qquad \textbf{(B)}\ \frac{18}{\pi^2} \qquad \textbf{(C)}\ \frac{9}{\pi^2}\left(\sqrt{3}-1\right) \qquad \textbf{(D)}\ \frac{9}{\pi^2}\left(\sqrt{3}+1\right) \qquad \textbf{(E)}\ \frac{9}{\pi^2}\left(\sqrt{3}+3\right)$

The sum of squares of four reals $x,y,z,u$ is $1$. Find the minimum value of the expression $E=(x-y)(y-z)(z-u)(u-x)$. Find also the minimum values of $x$, $y$, $z$ and $u$ when this minimum occurs.

Let $ABCD$ be a convex quadrilateral. The circle $\omega_1$ is tangent to $AB$ in $S$ and the continuations after $A$ and $B$ of sides $DA$ and $CB$, circle $\omega_2$ with center $I$ is tangent to $BC$ and the continuations after $B$ and $C$ of sides $AB$ and $DC$, circle $\omega_3$ is tangent to $CD$ in $T$ and the continuations after $C$ and $D$ of sides $BC$ and $AD$, and circle $\omega_4$ with center $J$ is tangent to $DA$ and the continuations after $D$ and $A$ of sides $CD$ and $BA$. Prove that points $S$ and $T$ are on equal distance from the middle point of segment $IJ$.

Show that for every integer $k \ge 1$ there is a positive integer $n$ such that the decimal representation of $2^n$ contains a block of exactly $k$ zeros, i.e. $2^n = \dots a00 \dots 0b \cdots$ with $k$ zeros and $a, b \ne 0$.