What is the largest amount of elements that can be taken from the set $\{1, 2, ... , 2012, 2013\}$, such that within them there are no distinct three, say $a$, $b$,and $c$, such that $a$ is a divisor or multiple of $b-c$?

There are n cars waiting at distinct points of a circular race track. At the starting signal each car starts. Each car may choose arbitrarily which of the two possible directions to go. Each car has the same constant speed. Whenever two cars meet they both change direction (but not speed). Show that at some time each car is back at its starting point.

Find the number of subsets $X$ of $\{1,2,\dots,10\}$ such that $X$ contains at least two elements and such that no two elements of $X$ differ by $1$.

Consider the equilateral triangular lattice in the complex plane defined by the Eisenstein integers; let the ordered pair $(x,y)$ denote the complex number $x+y\omega$ for $\omega=e^{2\pi i/3}$. We define an $\omega$-chessboard polygon to be a (non self-intersecting) polygon whose sides are situated along lines of the form $x=a$ or $y=b$, where $a$ and $b$ are integers. These lines divide the interior into unit triangles, which are shaded alternately black and white so that adjacent triangles have different colors. To tile an $\omega$-chessboard polygon by lozenges is to exactly cover the polygon by non-overlapping rhombuses consisting of two bordering triangles. Finally, a [i]tasteful tiling[/i] is one such that for every unit hexagon tiled by three lozenges, each lozenge has a black triangle on its left (defined by clockwise orientation) and a white triangle on its right (so the lozenges are BW, BW, BW in clockwise order). a) Prove that if an $\omega$-chessboard polygon can be tiled by lozenges, then it can be done so tastefully. b) Prove that such a tasteful tiling is unique. [i]Victor Wang.[/i]

How does one tile a plane, without gaps or overlappings, with the tiles equal to a given irregular quadrilateral?

Prove that in the interior of an equilateral triangle with side $a$ you can put a finite number of equal circles that do not overlap, with radius $r = \frac{a}{2010}$, so that the sum of their areas is greater than $\frac{17\sqrt3}{80}$ a$^2$.

Every member of a certain parliament has not more than $3$ enemies. Prove that it is possible to divide it onto two subparliaments so, that everyone will have not more than one enemy in his subparliament. ($A$ is the enemy of $B$ if and only if $B$ is the enemy of $A$.)

Let $S = \{1, 2, 3, ..., 100\}$ and $P$ is the collection of all subset $T$ of $S$ that have $49$ elements, or in other words: $$P = \{T \subset S : |T| = 49\}.$$ Every element of $P$ is labelled by the element of $S$ randomly (the labels may be the same). Show that there exist subset $M$ of $S$ that has $50$ members such that for every $x \in M$, the label of $M -\{x\}$ is not equal to $x$

Ana and Beto play on a grid of $2022 \times 2022$. Ana colors the sides of some squares on the board red, so that no square has two red sides that share a vertex. Next, Bob must color a blue path that connects two of the four corners of the board, following the sides of the squares and not using any red segments. If Beto succeeds, he is the winner, otherwise Ana wins. Who has a winning strategy?

$k > 1$ is fixed. Show that for $n$ sufficiently large for every partition of $\{1,2,\dots,n\}$ into $k$ disjoint subsets we can find $a \neq b$ such that $a$ and $b$ are in the same subset and $a+1$ and $b+1$ are in the same subset. What is the smallest $n$ for which this is true?

Determine the largest integer $N$ for which there exists a table $T$ of integers with $N$ rows and $100$ columns that has the following properties: $\text{(i)}$ Every row contains the numbers $1$, $2$, $\ldots$, $100$ in some order. $\text{(ii)}$ For any two distinct rows $r$ and $s$, there is a column $c$ such that $|T(r,c) - T(s, c)|\geq 2$. (Here $T(r,c)$ is the entry in row $r$ and column $c$.)

In a directed graph with $2013$ vertices, there is exactly one edge between any two vertices and for every vertex there exists an edge outwards this vertex. We know that whatever the arrangement of the edges, from every vertex we can reach $k$ vertices using at most two edges. Find the maximum value of $k$.

During a game of chess, at a certain point, in each row and column of the board there is an odd number of pieces. Prove that the number of pieces that are on black squares is even. (Note: a chessboard has $8$ rows and $8$ columns)

In a city, there are some buildings. We say the building $A$ is dominant to the building $B$ if the line that connects upside of $A$ to upside of $B$ makes an angle more than $45^{\circ}$ with earth. We want to make a building in a given location. Suppose none of the buildings are dominant to each other. Prove that we can make the building with a height such that again, none of the buildings are dominant to each other. (Suppose the city as a horizontal plain and each building as a perpendicular line to the plain.)

On a given circle, six points $A$, $B$, $C$, $D$, $E$, and $F$ are chosen at random, independently and uniformly with respect to arc length. Determine the probability that the two triangles $ABC$ and $DEF$ are disjoint, i.e., have no common points.

Let n be a positive interger. Let n real numbers be wrote on a paper. We call a "transformation" :choosing 2 numbers $a,b$ and replace both of them with $a*b$. Find all n for which after a finite number of transformations and any n real numbers, we can have the same number written n times on the paper.

The infinite sequence $a_0,a _1, a_2, \dots$ of (not necessarily distinct) integers has the following properties: $0\le a_i \le i$ for all integers $i\ge 0$, and \[\binom{k}{a_0} + \binom{k}{a_1} + \dots + \binom{k}{a_k} = 2^k\] for all integers $k\ge 0$. Prove that all integers $N\ge 0$ occur in the sequence (that is, for all $N\ge 0$, there exists $i\ge 0$ with $a_i=N$).

Find the smallest constant $c$ such that for every $4$ points in a unit square there are two a distance $\leq c$ apart.

For every positive integer $n$, denote by $D_n$ the number of permutations $(x_1, \dots, x_n)$ of $(1,2,\dots, n)$ such that $x_j\neq j$ for every $1\le j\le n$. For $1\le k\le \frac{n}{2}$, denote by $\Delta (n,k)$ the number of permutations $(x_1,\dots, x_n)$ of $(1,2,\dots, n)$ such that $x_i=k+i$ for every $1\le i\le k$ and $x_j\neq j$ for every $1\le j\le n$. Prove that $$\Delta (n,k)=\sum_{i=0}^{k=1} \binom{k-1}{i} \frac{D_{(n+1)-(k+i)}}{n-(k+i)}$$ (Proposed by Combinatorics; Ferdowsi University of Mashhad, Iran; Mirzavaziri)

Positive integer $k$ and $k$ colors are given. We will say that a set of $2k$ points on a plane is $colorful$, if it contains exactly 2 points of each color and if lines connecting every two points of the same color are pairwise distinct. Find, in terms of $k$ the least integer $n\geq 2$ such that: in every set of $nk$ points of a plane, no three of which are collinear, consisting of $n$ points of every color there exists a $colorful$ subset.

Let $n$ and $m$ be fixed positive integers. The hexagon $ABCDEF$ with vertices $A = (0,0)$, $B = (n,0)$, $C = (n,m)$, $D = (n-1,m)$, $E = (n-1,1)$, $F = (0,1)$ has been partitioned into $n+m-1$ unit squares. Find the number of paths from $A$ to $C$ along grid lines, passing through every grid node at most once.

Let $n \ge 2$ be an integer. A cube of size $n \times n \times n$ is dissected into $n^3$ unit cubes. A nonzero real number is written at the center of each unit cube so that the sum of the $n^2$ numbers in each slab of size $1 \times n \times n$, $n \times 1 \times n$, or $n \times n \times 1$ equals zero. (There are a total of $3n$ such slabs, forming three groups of $n$ slabs each such that slabs in the same group are parallel and slabs in different groups are perpendicular.) Could it happen that some plane in three-dimensional space separates the positive and the negative written numbers? (The plane should not pass through any of the numbers.) [i]Nikolai Beluhov[/i]

Let $n$ be an integer. Dayang are given $n$ sticks of lengths $1,2, 3,..., n$. She may connect the sticks at their ends to form longer sticks, but cannot cut them. She wants to use all these sticks to form a square. For example, for $n = 8$, she can make a square of side length $9$ using these connected sticks: $1 + 8$, $2 + 7$, $3 + 6$, and $4 + 5$. How many values of $n$, with $1 \le n \le 2018$, that allow her to do this?

A rectangle formed by the lines of checkered paper is divided into figures of three kinds: isosceles right triangles (1) with base of two units, squares (2) with unit side, and parallelograms (3) formed by two sides and two diagonals of unit squares (figures may be oriented in any way). Prove that the number of figures of the third kind is even. [img]http://up.iranblog.com/Files7/dda310bab8b6455f90ce.jpg[/img]

In the lower left corner of the $8 \times 8$ chessboard there is a king. He can move one cell either to the right, or up, or diagonally - to the right and up. How many ways can the king go to the upper right corner of the board if his route does not contain cells located on opposite sides of the diagonal going from the lower left to the upper right corner of the board?