Each side of a convex $2019$-gon polygon is dyed with red, yellow and blue, and there are exactly $673$ sides of each kind of color. Prove that there exists at least one way to draw $2016$ diagonals to divide the convex $2019$-gon polygon into $2017$ triangles, such that any two of the $2016$ diagonals don't have intersection inside the $2019$-gon polygon,and for any triangle in all the $2017$ triangles, the colors of the three sides of the triangle are all the same, either totally different.

Numbers $1$ through $2014$ are written on a board. A valid operation is to erase two numbers $a$ and $b$ on the board and replace them with the greatest common divisor and the least common multiple of $a$ and $b$. Prove that, no matter how many operations are made, the sum of all the numbers that remain on the board is always larger than $2014$ $\times$ $\sqrt[2014]{2014!}$

Let $A_k$ be the number of pairs $(a_1, a_2, ..., a_{2k})$ for $k\leq 50$, where $a_1, a_2, ..., a_{2k}$ are all different positive integers that satisfy the following. [b]$\cdot$[/b] $a_1, a_2, ..., a_{2k} \leq 100$ [b]$\cdot$[/b] For an odd number less or equal than $2k-1$, we have $a_i > a_{i+1}$ [b]$\cdot$[/b] For an even number less or equal than $2k-2$, we have $a_i < a_{i+1}$ Prove that $A_1 \leq A_2 \leq \cdots \leq A_{49}$.

There are $6$ different bus lines in a city, each stopping at exactly $5$ stations and running in both directions. Nevertheless, for every two different stations there is always a bus line connecting these two stations. Determine the maximum number of stations in this city. [i](Karl Czakler)[/i]

Suppose that $n$ persons meet in a meeting, and that each of the persons is acquainted to exactly $8$ others. Any two acquainted persons have exactly $4$ common acquaintances, and any two non-acquainted persons have exactly $2$ common acquaintances. Find all possible values of $n$.

A journalist wants to report on the island of scoundrels and knights, where all inhabitants are either scoundrels (and they always lie) or knights (and they always tell the truth). The journalist interviews each inhabitant exactly once and gets the following answers: $A_1$: On this island there is at least one scoundrel, $A_2$: On this island there are at least two scoundrels, $...$ $A_{n-1}$: On this island there are at least $n-1$ scoundrels, $A_n$: On this island everybody is a scoundrel. Can the journalist decide whether there are more scoundrels or more knights?

When preparing for a competition with more than two participating teams two of them play against each other at most once. When looking at the game plan it turns out: (1) If two teams play against each other, there are no more team playing against both of them. (2) If two teams do not play against each other, then there is always exactly two other teams playing against them both. Prove that all teams play the same number of games.

In a country, one can get from some point $A$ to any other point either by walking, or by calling a cab, waiting for it, and then being driven. Every citizen always chooses the method of transportation that requires the least time. It turns out that the distances and the traveling times are as follows: $1$ km takes $10$ min, $2$ km takes $15$ min, $3$ km takes $17.5 $ min. We assume that the speeds of the pedestrian and the cab, and the time spent waiting for cabs, are all constants. How long does it take to reach a point which is $6$ km from $A$?

Prove that for every positive integer $t$ there is a unique permutation $a_0, a_1, \ldots , a_{t-1}$ of $0, 1, \ldots , t-1$ such that, for every $0 \leq i \leq t-1$, the binomial coefficient $\binom{t+i}{2a_i}$ is odd and $2a_i \neq t+i$.

Determine the largest natural number $r$ with the property that among any five subsets with $500$ elements of the set $\{1,2,\ldots,1000\}$ there exist two of them which share at least $r$ elements.

A finite set of integers is called [i]bad[/i] if its elements add up to $2010$. A finite set of integers is a [i]Benelux-set[/i] if none of its subsets is bad. Determine the smallest positive integer $n$ such that the set $\{502, 503, 504, . . . , 2009\}$ can be partitioned into $n$ Benelux-sets. (A partition of a set $S$ into $n$ subsets is a collection of $n$ pairwise disjoint subsets of $S$, the union of which equals $S$.) [i](2nd Benelux Mathematical Olympiad 2010, Problem 1)[/i]

Let $k$ be a positive integer. The organising commitee of a tennis tournament is to schedule the matches for $2k$ players so that every two players play once, each day exactly one match is played, and each player arrives to the tournament site the day of his first match, and departs the day of his last match. For every day a player is present on the tournament, the committee has to pay $1$ coin to the hotel. The organisers want to design the schedule so as to minimise the total cost of all players' stays. Determine this minimum cost.

A lattice point $(x, y, z) \in Z^3$ can be seen from the origin if the line from the origin does not contain any other lattice point $(x', y', z')$ with $$(x')^2 + (y')^2 + (z')^2 < x^2 + y^2 + z^2.$$ Let $p$ be the probability that a randomly selected point on the cubic lattice $Z^3$ can be seen from the origin. Given that $$\frac{1}{p}= \sum^{\infty}_{n=i} \frac{k}{n^s}$$ for some integers $ i, k$, and $s$, find $i, k$ and $s$.

Does there exist a sequence of positive integers \( a_1, a_2, \ldots, a_{100} \) such that every number from \( 1 \) to \( 100 \) appears exactly once, and for each \( 1 \leq i \leq 100 \), the condition \[ a_{a_i + i} = i \] holds? Here it is assumed that \( a_{k+100} = a_k \) for each \( 1 \leq k \leq 100 \). [i]Proposed by Mykhailo Shtandenko[/i]

Given an integer $n\geq 2$. Call a positive integer ${T}$ [i]Pingsheng Number[/i], if there exists pairwise different non empty subsets $A_1,A_2,\cdots ,A_m$ $(m\geq 3)$ of set $S=\{1,2,\cdots ,n\},$ satisfying $T=\sum\limits_{i=1}^m|A_i|,$ and for $\forall p,q,r\in\{1,2,\cdots ,m\},p\neq q,q\neq r,r\neq p,$ we have $A_p\cap(A_q\triangle A_r)=\varnothing$ or $A_p\subseteq (A_q\triangle A_r).$ Find the max [i]Pingsheng Number[/i].

Let $n$ be a positive integer. Determine the minimum number of lines that can be drawn on the plane so that they intersect in exactly $n$ distinct points.

An insect is on a square ceiling side $1$. The insect can jump to the midpoint of the segment joining it to any of the four corners of the ceiling. Show that in $8$ jumps it can get to within $1/100$ of any chosen point on the ceiling

In Miss Lies' class there are only students who never lie and students who always lie. All students know which category they belong to. During the day in a class discussion, every student in the class says about every other student or he or she a liar or not. In total, it is said $320$ times that someone is not lying. The next day, one of the students who always lies is sick. There will be one again organize such a class discussion in which no mention is made of the sick pupil. Now it is said $300$ times that someone does lie. How many liars are there in the Miss Lies' class ?

There are $13$ marked points on the circumference of a circle with radius $13$. Prove that we can choose three of the marked points which form a triangle with area less than $13$.

Among a set of $2N$ coins, all identical in appearance, $2N - 2$ are real and $2$ are fake. Any two real coins have the same weight . The fake coins have the same weight, which is different from the weight of a real coin. How can one divide the coins into two groups of equal total weight by using a balance at most $4$ times, if (a) $N = 16$, ( b ) $N = 11$ ? (A Shapovalov)

In a family album, there are ten photos. On each of them, three people are pictured: in the middle stands a man, to the right of him stands his brother, and to the left of him stands his son. What is the least possible total number of people pictured, if all ten of the people standing in the middle of the ten pictures are different.

We have a machine that has an input and an output. The input is a letter from the finite set $I$ and the output is a lamp that at each moment has one of the colors of the set $C=\{c_1,\dots,c_p\}$. At each moment the machine has an inner state that is one of the $n$ members of finite set $S$. The function $o: S \rightarrow C$ is a surjective function defining that at each state, what color must the lamp be, and the function $t:S \times I \rightarrow S$ is a function defining how does giving each input at each state changes the state. We only shall see the lamp and we have no direct information from the state of the car at current moment. In other words a machine is $M=(S,I,C,o,t)$ such that $S,I,C$ are finite, $t:S \times I \rightarrow S$ , and $o:S \rightarrow C$ is surjective. It is guaranteed that for each two different inner states, there's a sequence of inputs such that the color of the lamp after giving the sequence to the machine at the first state is different from the color of the lamp after giving the sequence to the machine at the second state. (a) The machine $M$ has $n$ different inner states. Prove that for each two different inner states, there's a sequence of inputs of length no more than $n-p$ such that the color of the lamp after giving the sequence to the machine at the first state is different from the color of the lamp after giving the sequence to the machine at the second state. (b) Prove that for a machine $M$ with $n$ different inner states, there exists an algorithm with no more than $n^2$ inputs that starting at any unknown inner state, at the end of the algorithm the state of the machine at that moment is known. Can you prove the above claim for $\frac{n^2}{2}$?

Several policemen try to catch a thief who has $2m$ accomplices. To that end they place the accomplices under surveillance. In the beginning, the policemen shadow nobody. Every morning each policeman places under his surveillance one of the accomplices. Every evening the thief stops trusting one of his accomplices The thief is caught if by the $m$-th evening some policeman shadows exactly those $m$ accomplices who are still trusted by the thief. Prove that to guarantee the capture of the thief at least $2^m$ policemen are needed.

We call a subset $S$ of vertices of graph $G$, $2$-dominating, if and only if for every vertex $v\notin S,v\in G$, $v$ has at least two neighbors in $S$. prove that every $r$-regular $(r\ge3)$ graph has a $2$-dominating set with size at most $\frac{n(1+\ln(r))}{r}$.(15 points) time of this exam was 3 hours

Consider the set: $A = \{1, 2,..., 100\}$ Prove that if we take $11$ different elements from $A$, there are $x, y$ such that $x \neq y$ and $0 < |\sqrt{x} - \sqrt{y}| < 1$