There are $30$ contestants and each contestant has $6$ friends each. $3$ people is selected from these $30$ contestants, and it is called $good~triple$, if either all three are mutual friends, or none of them are friends with each other. How many $good~triples$ are there? (Note: If contestant $A$ is friends with $B$, then $B$ is friends with $A$. Similarly, if $A$ is not friends with $B$, then $B$ is not friends with $A$)

Albert and Barbara play the following game. On a table there are $1999$ sticks, and each player in turn removes some of them: at least one stick, but at most half of the currently remaining sticks. The player who leaves just one stick on the table loses the game. Barbara moves first. Decide which player has a winning strategy and describe that strategy.

A lottery ticket is a choice of $5$ distinct numbers from $1, 2,3,...,90$. Suppose that $5^5$ distinct lottery tickets are such that any two of them have a common number. Prove that one can find four numbers such that every ticket contains at least one of the four.

Define a "hook" to be a figure made up of six unit squares as shown below in the picture, or any of the figures obtained by applying rotations and reflections to this figure. [asy] unitsize(0.5 cm); draw((0,0)--(1,0)); draw((0,1)--(1,1)); draw((2,1)--(3,1)); draw((0,2)--(3,2)); draw((0,3)--(3,3)); draw((0,0)--(0,3)); draw((1,0)--(1,3)); draw((2,1)--(2,3)); draw((3,1)--(3,3)); [/asy] Determine all $ m\times n$ rectangles that can be covered without gaps and without overlaps with hooks such that - the rectangle is covered without gaps and without overlaps - no part of a hook covers area outside the rectangle.

What is the smallest $r$ such that three disks of radius $r$ can completely cover up a unit disk?

The squares in a $9\times 9$ grid are numbered from $11$ to $99$, where the first digit is the row and the second the column. Each square is colored black or white. Squares $44$ and $49$ are black. Every black square shares an edge with at most one other black square, and each white square shares an edge with at most one other white square. What color is square $99$?

On competition which has $16$ teams, it is played $55$ games. Prove that among them exists $3$ teams such that they have not played any matches between themselves.

Ten sportsmen have taken part in a table-tennis tournament (each pair has met once only, no draws). Let $xi$ be the number of $i$-th player victories, $yi$ -- losses. Prove that $$x_1^2 + ... + x_{10}^2 = y_1^2 + ... + y_{10}^2$$

$\bullet$ In how many ways can triangles be formed whose sides are integers greater than $50$ and less than $100$? $\bullet$ In how many of these triangles is the perimeter divisible by $3$?

Let $A$ be a set, and let $P (A)$ be the powerset of all non-empty subsets of $A$. (For example, $A = \{1,2,3\}$, then $P (A) = \{\{1\},\{2\} ,\{3\},\{1,2\}, \{1,3\},\{2,3\}, \{1,2,3\}\}$.) A subset $F$ of P $(A)$ is called [i]strong [/i] if the following is true: If $B_1$ and $B_2$ are elements of $F$, then $B_1 \cup B_2$ is also an element of $F$. Suppose that $F$ and $G$ are strong subsets of $P (A)$. a) Is the union $F \cup G$ necessarily strong? b) Is the intersection $F \cap G$ necessarily strong?

On a chessboard $5 \times 9$ squares, the following game is played. Initially, a number of frogs are randomly placed on some of the squares, no square containing more than one frog. A turn consists of moving all of the frogs subject to the following rules: $\bullet$ Each frog may be moved one square up, down, left, or right; $\bullet$ If a frog moves up or down on one turn, it must move left or right on the next turn, and vice versa; $\bullet$ At the end of each turn, no square can contain two or more frogs. The game stops if it becomes impossible to complete another turn. Prove that if initially $33$ frogs are placed on the board, the game must eventually stop. Prove also that it is possible to place $32$ frogs on the board so that the game can continue forever.

In the convex $(2n+2) $-gon are drawn $n^2$ diagonals. Prove that one of these of diagonals cuts the $(2n+2)$ -gon into two polygons, each of which has an odd number vertices.

Find the maximal possible numbers one can choose from $1,\ldots,100$ such that none of the products of non-empty subset of this numbers was a perfect square.

We have seven equal pails with water, filled to one half, one third, one quarter, one fifth, one eighth, one ninth, and one tenth, respectively. We are allowed to pour water from one pail into another until the first pail empties or the second one fills to the brim. Can we obtain a pail that is filled to (a) one twelfth, (b) one sixth after several such steps?

Given positive integer $n (n \geq 2)$, find the largest positive integer $\lambda$ satisfying : For $n$ bags, if every bag contains some balls whose weights are all integer powers of $2$ (the weights of balls in a bag may not be distinct), and the total weights of balls in every bag are equal, then there exists a weight among these balls such that the total number of balls with this weight is at least $\lambda$.

$2003$ dollars are placed into $N$ purses, and the purses are placed into $M$ pockets. It is known that $N$ is greater than the number of dollars in any pocket. Is it true that there is a purse with less than $M$ dollars in it?

The kingdom of Pinguinia has various cities and streets, the latter being all one-way streets always run between exactly two cities, so there are no intermediate stops. Every city has exactly two streets that lead out of it and exactly two that lead into it. Prove that the streets can be divided into black and white streets so that exactly one exit of each city is black and one is white and exactly one white and one black entrance in each city.

Determine the smallest number $n \in Z_+$, which can be written as $n = \Sigma_{a\in A}a^2$, where $A$ is a finite set of positive integers and $\Sigma_{a\in A}a= 2014$. In other words: what is the smallest positive number which can be written as a sum of squares of different positive integers summing to $2014$?

Find all possible values of $k $ such that there exist a $k\times k$ table colored in $k$ colors such that there do not exist two cells in a column or a row with the same color or four cells made of intersecting two columns and two rows painted in exactly three colors.

$2015$ points are given in a plane such that from any five points we can choose two points with distance less than $1$ unit. Prove that $504$ of the given points lie on a unit disc.

Students in a class of $n$ students had to solve $2^{n-1}$ problems on an exam. It turned out that for each pair of distinct problems: • there is at least one student who has solved both • there is at least one student who has solved one of them, but not the other. Show that there is a problem solved by all the students in the class.

There is a safe that can be opened by entering a secret code consisting of $n$ digits, each of them is $0$ or $1$. Initially, $n$ zeros were entered, and the safe is closed (so, all zeros is not the secret code). In one attempt, you can enter an arbitrary sequence of $n$ digits, each of them is $0$ or $1$. If the entered sequence matches the secret code, the safe will open. If the entered sequence matches the secret code in more positions than the previously entered sequence, you will hear a click. In any other cases the safe will remain locked and there will be no click. Find the smallest number of attempts that is sufficient to open the safe in all cases.

Georg has a circular game board with 100 squares labelled $1, 2, . . . , 100$. Georg chooses three numbers $a, b, c$ among the numbers $1, 2, . . . , 99$. The numbers need not be distinct. Initially there is a piece on the square labelled $100$. First, Georg moves the piece $a$ squares forward $33$ times and puts a caramel on each of the squares the piece lands on. Then he moves the piece $b$ squares forward $33$ times and puts a caramel on each of the squares the piece lands on. Finally, he moves the piece $c$ squares forward $33$ times and puts a caramel on each of the squares the piece lands on. Thus he puts a total of $99$ caramels on the board. Georg wins all the caramels on square number $1$. How many caramels can Georg win, at most? [img]https://cdn.artofproblemsolving.com/attachments/d/c/af438e5feadca5b1bfc98ae427f6fc24655e29.png[/img]

Consider all words of length $n$ consisting of the letters $I,O,M$. How many such words are there, which contain no two consecutive $M$’s?

The plane is divided into strips of width $1$ by parallel lines (a strip - the region between two parallel lines). The points from the interior of each strip are coloured with red or white, such that in each strip only one color is used (the points of a strip are coloured with the same color). The points on the lines are not coloured. Show that there is an equilateral triangle of side-length $100$, with all vertices of the same colour.