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$.

In an acute-angled triangle $ABC$ with $AB < AC$, the circle $\omega$ touches $AB$ at $B$ and passes through $C$ intersecting $AC$ again at $D$. Prove that the orthocentre of triangle $ABD$ lies on $\omega$ if and only if it lies on the perpendicular bisector of $BC$.

Let $\omega$ be incircle of $ABC$. $P$ and $Q$ are on $AB$ and $AC$, such that $PQ$ is parallel to $BC$ and is tangent to $\omega$. $AB,AC$ touch $\omega$ at $F,E$. Prove that if $M$ is midpoint of $PQ$, and $T$ is intersection point of $EF$ and $BC$, then $TM$ is tangent to $\omega$. [i]By Ali Khezeli[/i]

In the interior of the convex 2011-gon are $2011$ points, such that no three among the given $4022$ points (the interior points and the vertices) are collinear. The points are coloured one of two different colours and a colouring is called "good" if some of the points can be joined in such a way that the following conditions are satisfied: 1) Each segment joins two points of the same colour. 2) None of the line segments intersect. 3) For any two points of the same colour there exists a path of segments connecting them. Find the number of "good" colourings.

Let $a_1,a_2,\dots,a_m$ be a finite sequence of positive integers. Prove that there exist nonnegative integers $b,c,$ and $N$ such that $$\left\lfloor \sum_{i=1}^m \sqrt{n+a_i} \right\rfloor =\left\lfloor \sqrt{bn+c} \right\rfloor$$ holds for all integers $n>N.$ [i]Proposed by Carl Schildkraut[/i]

A city has a system of bus routes laid out in such a way that (a) there are exactly $11$ bus stops on each route; (b) it is possible to travel between any two bus stops without changing routes; (c) any two bus routes have exactly one bus stop in common. What is the number of bus routes in the city?

Consider the set $S=\{1,2,...,n\}$. For every $k\in S$, define $S_{k}=\{X \subseteq S, \ k \notin X, X\neq \emptyset\}$. Determine the value of the sum \[S_{k}^{*}=\sum_{\{i_{1},i_{2},...,i_{r}\}\in S_{k}}\frac{1}{i_{1}\cdot i_{2}\cdot...\cdot i_{r}}\] [hide]in fact, this problem was taken from an austrian-polish[/hide]

Find all integers $k \ge 5$ for which there is a positive integer $n$ with exactly $k$ positive divisors $1 = d_1 <d_2 < ... <d_k = n$ and $d_2d_3 + d_3d_5 + d_5d_2 = n$.

One has marked $n$ points on a circle and has drawn a certain number of chords whose endpoints are the marked points. It turned out that the following property is satisfied: whenever any $2021$ drawn chords are removed one can join any two marked points by a broken line composed of some of the remaining drawn chords. Prove that one can remove some of the drawn chords so that at most $2022n$ chords remain and the property described above is preserved.

This questions comprises two independent parts. (i) Let \(g:\mathbb{R}\to\mathbb{R}\) be continuous and such that \(g(0)=0\) and \(g(x)g(-x)>0\) for any \(x > 0\). Find all solutions \(f : \mathbb{R}\to\mathbb{R}\) to the functional equation \[g(f(x+y))=g(f(x))+g(f(y)),\ x,y\in\mathbb{R}\] (ii) Find all continuously differentiable functions \(\phi : [a, \infty) \to \mathbb{R}\), where \(a > 0\), that satisfies the equation \[(\phi(x))^2=\int_a^x \left(\left|\phi(y)\right|\right)^2+\left(\left|\phi'(y)\right|\right)^2\mathrm{d}y -(x-a)^3,\ \forall x\geq a.\]

Let $T$ be a triangulation of a $100$-gon.We construct $P(T)$ by copying the same $100$-gon and drawing a diagonal if it was not drawn in $T$ an there is a quadrilateral with this diagonal and two other vertices so that all the sides and diagonals(Except the one we are going to draw) are present in $T$.Let $f(T)$ be the number of intersections of diagonals in $P(T)$.Find the minimum and maximum of $f(T)$.

For an arbitrary ordinal number $\alpha$ let $H(\alpha)$ denote the set of functions $f\colon \alpha \rightarrow \{ -1,0,1\}$ that map all but finitely many elements of $\alpha$ to $0$. Order $H(\alpha)$ according to the last difference, that is, for $f, g\in H(\alpha)$ let $f\prec g$ if $f(\beta) < g(\beta)$ holds for the maximum ordinal number $\beta < \alpha$ with $f(\beta) \neq g(\beta)$. Prove that the ordered set $(H(\alpha), \prec)$ is scattered (i.e. it doesn't contain a subset isomorphic to the set of rational numbers with the usual order), and that any scattered order type can be embedded into some $(H(\alpha), \prec)$.

Let $LMT$ represent a 3-digit positive integer where $L$ and $M$ are nonzero digits. Suppose that the 2-digit number $MT$ divides $LMT$. Compute the difference between the maximum and minimum possible values of $LMT$.