Given a regular $n$-sided polygon with $n \ge 3$. Maria draws some of its diagonals in such a way that each diagonal intersects at most one of the other diagonals drawn in the interior of the polygon. Determine the maximum number of diagonals that Maria can draw in such a way. Note: Two diagonals can share a vertex of the polygon. Vertices are not part of the interior of the polygon.

Is it possible to divide the integers from $1$ to $100$ inclusive into $50$ pairs such that for $1\le k\le 50$, the difference between the two numbers in the $k$-th pair is $k$? (V Proizvolov)

Let $X$ be a set with $n$ elements, and let $A_{1}$, $A_{2}$, ..., $A_{m}$ be subsets of $X$ such that: 1) $|A_{i}|=3$ for every $i\in\left\{1,2,...,m\right\}$; 2) $|A_{i}\cap A_{j}|\leq 1$ for all $i,j\in\left\{1,2,...,m\right\}$ such that $i \neq j$. Prove that there exists a subset $A$ of $X$ such that $A$ has at least $\left[\sqrt{2n}\right]$ elements, and for every $i\in\left\{1,2,...,m\right\}$, the set $A$ does not contain $A_{i}$. [i]Alternative formulation.[/i] Let $X$ be a finite set with $n$ elements and $A_{1},A_{2},\ldots, A_{m}$ be three-elements subsets of $X$, such that $|A_{i}\cap A_{j}|\leq 1$, for every $i\neq j$. Prove that there exists $A\subseteq X$ with $|A|\geq \lfloor \sqrt{2n}\rfloor$, such that none of $A_{i}$'s is a subset of $A$.

A library has one exit and one entrance and a blackboard at each. Only one person enters or leaves at a time. As he does so he records the number of people found/remaining in the library on the blackboard. Prove that at the end of the day exactly the same numbers will be found on the two blackboards (possibly in a different order).

Prove that a finite simple planar graph has an orientation so that every vertex has out-degree at most 3.

A game is played on a $23\times 23$ board. The first player controls two white chips which start in the bottom left and top right corners. The second player controls two black ones which start in bottom right and top left corners. The players move alternately. In each move, a player moves one of the chips under control to a square which shares a side with the square the chip is currently in. The first player wins if he can bring the white chips to squares which share a side with each other. Can the second player prevent the first player from winning?

Consider the set $G$ of $2011^2$ points $(x, y)$ in the plane where $x$ and $y$ are both integers between $ 1$ and $2011$ inclusive. Let $A$ be any subset of $G$ containing at least $4\times 2011\times \sqrt{2011}$ points. Show that there are at least $2011^2$ parallelograms whose vertices lie in $A$ and all of whose diagonals meet at a single point.

Among the $n$ inhabitants of an island, where $n$ is even, every two are either friends or enemies. Some day, the chief of the island orders that each inhabitant (including himself) makes and wears a necklace consisting of marbles, in such a way that two necklaces have a marble of the same type if and only if their owners are friends. (a) Show that the chief’s order can be achieved by using $n^2/4$ different types of stones. (b) Prove that this is not necessarily true with less than $n^2/4$ types.

Each point of the sphere of radius $r\ge 1$ is colored in one of $n$ colors ($n \ge 2$), and for each color there is a point on the sphere colored in this color. Prove that there are points $A_i$, $B_i$, $i= 1, ..., n$ on the sphere such that the colors of the points $A_1, ..., A_n$ are pairwise different and the color of the point $B_i$ at a distance of $1$ from $A_i$ is different from the color of the point $A_1, i= 1, ..., n$

Can a closed disk can be decomposed into a union of two congruent parts having no common point?

Pebbles are placed on the squares of a $2021\times 2021$ board in such a way that each square contains at most one pebble. The pebble set of a square of the board is the collection of all pebbles which are in the same row or column as this square. (A pebble belongs to the pebble set of the square in which it is placed.) What is the least possible number of pebbles on the board if no two squares have the same pebble set?

We consider the following figure: [See attachment] We are looking for labellings of the nine fields with the numbers 1, 2, ..., 9. Each of these numbers has to be used exactly once. Moreover, the six sums of three resp. four numbers along the drawn lines have to be be equal. Give one such labelling. Show that all such labellings have the same number in the top field. How many such labellings do there exist? (Two labellings are considered different, if they disagree in at least one field.) (Walther Janous)

For a positive integer $n$, consider all nonincreasing functions $f : \{1,\hdots,n\}\to\{1,\hdots,n\}$. Some of them have a fixed point (i.e. a $c$ such that $f(c) = c$), some do not. Determine the difference between the sizes of the two sets of functions. [i]Remark.[/i] A function $f$ is [i]nonincreasing[/i] if $f(x) \geq f(y)$ holds for all $x \leq y$

Three wise men live in an old region. As they do not always agree on their advice to the king, he decided to stay with the wisest of the three, killing the others. To decide which of them was saved, performed the following test: He put each sage a hat, without him seeing its color, then locked them in a common room and told them: $\bullet$ Only the first to guess the color of his own hat will save his life. $\bullet$ In total there are five hats, three are white and two are black. $\bullet$ You cannot communicate with each other, but you can look at each other. After a long time, one of the wise men says: "I know the color of my hat." What color did they have? How did you figure it out? What color were the other hats used?

$n$ men and one woman are in the meeting room with $n+1$ chairs, each of them having their own seat. Show that the following two number of cases are equal. (1) Number of cases to choose one man to get out of the room, and make the left $n-1$ men to sit to each other's chair. (2) Number of cases to make $n+1$ people to sit to each other's chair.

In the city built are $2019$ metro stations. Some pairs of stations are connected. tunnels, and from any station through the tunnels you can reach any other. The mayor ordered to organize several metro lines: each line should include several different stations connected in series by tunnels (several lines can pass through the same tunnel), and in each station must lie at least on one line. To save money no more than $k$ lines should be made. It turned out that the order of the mayor is not feasible. What is the largest $k$ it could to happen?

Each square of a $33\times 33$ square grid is colored in one of the three colors: red, yellow or blue, such that the numbers of squares in each color are the same. If two squares sharing a common edge are in different colors, call that common edge a separating edge. Find the minimal number of separating edges in the grid.

Alice has a map of Wonderland, a country consisting of $n \geq 2$ towns. For every pair of towns, there is a narrow road going from one town to the other. One day, all the roads are declared to be “one way” only. Alice has no information on the direction of the roads, but the King of Hearts has offered to help her. She is allowed to ask him a number of questions. For each question in turn, Alice chooses a pair of towns and the King of Hearts tells her the direction of the road connecting those two towns. Alice wants to know whether there is at least one town in Wonderland with at most one outgoing road. Prove that she can always find out by asking at most $4n$ questions.

Let $k,n$ be positive integers. There are $kn$ points $P_1, P_2, \cdots, P_{kn}$ on a circle. We can color each points with one of color $ c_1, c_2, \cdots , c_k $. In how many ways we can color the points satisfying the following conditions? (a) Each color is used $ n $ times. (b) $ \forall i \not = j $, if $ P_a $ and $ P_b $ is colored with color $ c_i $ , and $ P_c $ and $ P_d $ is colored with color $ c_j $, then the segment $ P_a P_b $ and segment $ P_c P_d $ doesn't meet together.

Let $A$ be the sequence of zeroes and ones (binary sequence). The sequence can be modified by the following operation: we may pick a block or a contiguous subsequence where there are an unequal number of zeroes and ones, and then flip their order within the block (so block $a_1, a_2, \ldots, a_r$ becomes $a_r, a_{r-1}, \ldots, a_1$). As an example, let $A$ be the sequence $1,1,0,0,1$. We can pick block $1,0,0$ and flip it, so the sequence $1,\boxed{1,0,0},1$ becomes $1,\boxed{0,0,1},1$. However, we cannot pick block $1,1,0,0$ and flip their order since they contain the same number of $1$s and $0$s. Two sequences $A$ and $B$ are called [i]related[/i] if $A$ can be transformed into $B$ using a finite number the operation mentioned above. Determine the largest natural number $n$ for which there exists $n$ different sequences $A_1, A_2, \ldots, A_n$ where each sequence consists of 2022 digits, and for every index $i \neq j$, the sequence $A_i$ is not related to $A_j$.

In a group of $199$ persons, each person is a friend of exactly $100$ other persons in the group. All friendships are mutual, and we do not count a person as a friend of himself/herself. For which integers $k > 1$ is the existence of $k$ persons, all being friends of each other, guaranteed?

We are given $n$ intervals $[l_1,r_1],[l_2,r_2],[l_3,r_3],\dots, [l_n,r_n]$ in the number line. We can divide the intervals into two sets such that no two intervals in the same set have overlaps. Prove that there are at most $n-1$ pairs of overlapping intervals.

Let $S = \mathbb Z \times \mathbb Z$. A subset $P$ of $S$ is called [i]nice[/i] if [list] [*] $(a, b) \in P \implies (b, a) \in P$ [*] $(a, b)$, $(c, d)\in P \implies (a + c, b - d) \in P$ [/list] Find all $(p, q) \in S$ so that if $(p, q) \in P$ for some [i]nice[/i] set $P$ then $P = S$.

Let $G$ be a complete directed graph with $2024$ vertices and let $k \leq 10^5$ be a positive integer. Angel and Boris play the following game: Angel colors $k$ of the edges in red and puts a pawn in one of the vertices. After that in each move, first Angel moves the pawn to a neighboring vertex and then Boris has to flip one of the non-colored edges. Boris wins if at some point Angel can't make a move. Find, depending on $G$ and $k$, whether or not Boris has a winning strategy.

Find the sum of the values of $x$ for which $\binom{x}{0}-\binom{x}{1}+\binom{x}{2}-...+\binom{x}{2008}=0$