Today there are $2^n$ species on the planet Kerbin, all of which are exactly n steps from an original species. In an evolutionary step, One species split into exactly two new species and died out in the process. There were already $2^n-1$ species in the past, which are no longer present today can be found, but are only documented by fossils. The famous space pioneer Jebediah Kerman once suggested reducing the biodiversity of a planet by doing this to measure how closely two species are on average related, with also already extinct species should be taken into account. The degree of relationship is measured two types, of course, by how many evolutionary steps before or back you have to do at least one to get from one to the other. What is the biodiversity of the planet Kerbin?

Given an $ n\times n$ chessboard. a) Find the number of rectangles on the chessboard. b) Assume there exists an $ r\times r$ square (label $ B$) with $ r<n$ which is located on the upper left corner of the board. Define "inner border" of $ A$ as the border of $ A$ which is not the border of the chessboard. How many rectangles in $ B$ that touch exactly one inner border of $ B$?

For a finite simple graph $G$, we define $G'$ to be the graph on the same vertex set as $G$, where for any two vertices $u \neq v$, the pair $\{u,v\}$ is an edge of $G'$ if and only if $u$ and $v$ have a common neighbor in $G$. Prove that if $G$ is a finite simple graph which is isomorphic to $(G')'$, then $G$ is also isomorphic to $G'$. [i]Mehtaab Sawhney and Zack Chroman[/i]

Lalo and Sergio play in a regular polygon of $n\geq 4$ sides. In his turn, Lalo paints a diagonal or side of pink, and in his turn Sergio paint a diagonal or side of orange. Wins the game who achieve paint the three sides of a triangle with his color, if none of the players can win, they game tie. Lalo starts playing. Determines all natural numbers $n$ such that one of the players have winning strategy.

Urn A contains $4$ white balls and $2$ red balls. Urn B contains $3$ red balls and $3$ black balls. An urn is randomly selected, and then a ball inside of that urn is removed. We then repeat the process of selecting an urn and drawing out a ball, without returning the first ball. What is the probability that the first ball drawn was red, given that the second ball drawn was black?

There are $2014$ airports in the faraway land of Artinia. Each pair of airports is connected by a nonstop flight in one or both directions. Show that there is some airport from which it is possible to reach every other airport in at most two flights.

Let $n$ be odd natural number and $x_1,x_2,\cdots,x_n$ be pairwise distinct numbers. Prove that someone can divide the difference of these number into two sets with equal sum. ( $X=\{\mid x_i-x_j \mid | i<j\}$ )

Show that there is a set of $2002$ consecutive positive integers containing exactly $150$ primes. (You may use the fact that there are $168$ primes less than $1000$)

Suppose $a_1, a_2, ..., a_r$ are integers with $a_i \geq 2$ for all $i$ such that $a_1 + a_2 + ... + a_r = 2010$. Prove that the set $\{1,2,3,...,2010\}$ can be partitioned in $r$ subsets $A_1, A_2, ..., A_r$ each with $a_1, a_2, ..., a_r$ elements respectively, such that the sum of the numbers on each subset is divisible by $2011$. Decide whether this property still holds if we replace $2010$ by $2011$ and $2011$ by $2012$ (that is, if the set to be partitioned is $\{1,2,3,...,2011\}$).

In a chess tournament there are $n \geq 5$ players, and they have already played $\left[ \frac{n^2}{4} \right] +2$ games (each pair have played each other at most once). [b](a)[/b] Prove that there are five players $a, b, c, d, e$ for which the pairs $ab, ac, bc, ad, ae, de$ have already played. [b](b)[/b] Is the statement also valid for the $\left[ \frac{n^2}{4} \right] +1$ games played? Make the proof by induction over $n.$

A word is a sequence of n letters of the alphabet {a, b, c, d}. A word is said to be complicated if it contains two consecutive groups of identic letters. The words caab, baba and cababdc, for example, are complicated words, while bacba and dcbdc are not. A word that is not complicated is a simple word. Prove that the numbers of simple words with n letters is greater than $2^n$, if n is a positive integer.

Is it possible to find a set of $100$ (or $200$) points on the boundary of a cube such that this set remains fixed under all rotations which leave the cube fixed ?

Let $n$ be a natural number. Each cell of a $n \times n$ square contains one of $n$ different symbols, such that each of the symbols is in exactly $n$ cells. Show that a row or a column exists that contains at least \sqrt{n} different symbols.

Let $A$ be the largest subset of $\{1,\dots,n\}$ such that for each $x\in A$, $x$ divides at most one other element in $A$. Prove that \[\frac{2n}3\leq |A|\leq \left\lceil \frac{3n}4\right\rceil. \]

In there $2018\times 2018$ square cells colored in white or black. It is known, that exists $10 \times 10$ square with only white cells and $10\times 10$ square with only black cells. For what minimal $d$ always exists square $10\times 10$ such that the number of black and white cells differs by no more than $d$?

For $2n$ positive integers a matching (i.e. dividing them into $n$ pairs) is called {\it non-square} if the product of two numbers in each pair is not a perfect square. Prove that if there is a non-square matching, then there are at least $n!$ non-square matchings. (By $n!$ denote the product $1\cdot 2\cdot 3\cdot \ldots \cdot n$.)

A bear is in the center of the left down corner of a $100*100$ square .we call a cycle in this grid a bear cycle if it visits each square exactly ones and gets back to the place it started.Removing a row or column with compose the bear cycle into number of pathes.Find the minimum $k$ so that in any bear cycle we can remove a row or column so that the maximum length of the remaining pathes is at most $k$.

A $tetromino$ is a figure made up of four unit squares connected by common edges. [List=i] [*] If we do not distinguish between the possible rotations of a tetromino within its plane, prove that there are seven distinct tetrominos. [*]Prove or disprove the statement: It is possible to pack all seven distinct tetrominos into $4\times 7$ rectangle without overlapping. [/list]

On the name day of a man there are $5$ people. The men observed that of any $3$ people there are $2$ that knows each other. Prove that the man may order his guests around circular table in such way that every man have on its both side people that he knows. [i]N. Nenov, N. Hazhiivanov[/i]

Thin and Fat eat a pizza of $2n$ pieces. Each piece contains a distinct amount of olives between $1$ and $2n$. Thin eats the first piece, and the two players alternately eat a piece neighbor of an eaten piece. However, neither Thin nor Fat like olives, so they will choose pieces that minimizes the total amount of olives they eat. For each arrangement $\sigma$ of the olives, let $s(\sigma)$ the minimal amount of olives that Thin can eat, considering that both play in the best way possible. Let $S(n)$ the maximum of $s(\sigma)$, considering all arrangements. $a)$ Prove that $n^2-1+\lfloor \frac{n}{2} \rfloor \le S(n) \le n^2+\lfloor \frac{n}{2} \rfloor$ $b)$ Prove that $S(n)=n^2-1+\frac{n}{2}$ for each even n.

The number $B=\overline{a_1a_2\dots a_na_1a_2\dots a_n}$ it is called $repetition$ of the natural positive number $A = \overline{a_1a_2\dots a_n}$.Prove that there is an infinity of natural numbers ,whose $repetition$ is a perfect square .

The great Zagier and his assistant performed a magic trick, which was a natural one number $n$ involved. To do this, Zagier distributes $n$ identical coins (with heads and tails on the sides) and then leave the hall. The audience now arranges the coins in a row, you can choose the top side of each coin as you like, and then tell the assistant one natural number $k$ from $1$ to $n$. This then turns over exactly one coin, whereupon Zagier is brought in and placed in front of said coins. To the surprise of the non-mathematical, he can name the number $k$ to the public. For which natural numbers $n$ can this trick be carried out, if the two are allowed to coordinate only before the show, but during the show they do not use any magic tricks?

Let $P$ be the set of all $2012$ tuples $(x_1, x_2, \dots, x_{2012})$, where $x_i \in \{1,2,\dots 20\}$ for each $1\leq i \leq 2012$. The set $A \subset P$ is said to be decreasing if for each $(x_1,x_2,\dots ,x_{2012} ) \in A$ any $(y_1,y_2,\dots, y_{2012})$ satisfying $y_i \leq x_i (1\leq i \leq 2012)$ also belongs to $A$. The set $B \subset P$ is said to be increasing if for each $(x_1,x_2,\dots ,x_{2012} ) \in B$ any $(y_1,y_2,\dots, y_{2012})$ satisfying $y_i \geq x_i (1\leq i \leq 2012)$ also belongs to $B$. Find the maximum possible value of $f(A,B)= \dfrac {|A\cap B|}{|A|\cdot |B|}$, where $A$ and $B$ are nonempty decreasing and increasing sets ($\mid \cdot \mid$ denotes the number of elements of the set).

Laura has $2010$ lamps connected with $2010$ buttons in front of her. For each button, she wants to know the corresponding lamp. In order to do this, she observes which lamps are lit when Richard presses a selection of buttons. (Not pressing anything is also a possible selection.) Richard always presses the buttons simultaneously, so the lamps are lit simultaneously, too. a) If Richard chooses the buttons to be pressed, what is the maximum number of different combinations of buttons he can press until Laura can assign the buttons to the lamps correctly? b) Supposing that Laura will choose the combinations of buttons to be pressed, what is the minimum number of attempts she has to do until she is able to associate the buttons with the lamps in a correct way?

Players $A$ and $B$ play the following game. Each of them throws a dice, and if the outcomes are $x$ and $y$ respectively, a list of all two digit numbers $10a + b$ with $a,b\in \{1,..,6\}$ and $10a + b \le 10x + y$ is created. Then the players alternately reduce the list by replacing a pair of numbers in the list by their absolute difference, until only one number remains. If the remaining number is of the same parity as the outcome of $A$’s throw, then $A$ is proclaimed the winner. What is the probability that $A$ wins the game?