Suppose that $\{D_n\}_{n\ge 1}$ is an finite sequence of disks in the plane whose total area is less than $1$. Prove that it is possible to rearrange the disks so that they are disjoint from each other and all contained inside a disk of area $4$.

Let $n$ be a positive integer. A panel of dimenisions $2n\times2n$ is divided in $4n^2$ squares with dimensions $1\times1$. What is the highest possible number of diagonals that can be drawn in $1\times1$ squares, such that each two diagonals have no common points.

Al[u][b]l[/b][/u] edges and all diagonals of regular hexagon $A_1A_2A_3A_4A_5A_6$ are colored blue or red such that each triangle $A_jA_kA_m, 1 \leq j < k < m\leq 6$ has at least one red edge. Let $R_k$ be the number of red segments $A_kA_j, (j \neq k)$. Prove the inequality \[\sum_{k=1}^6 (2R_k-7)^2 \leq 54.\]

A society created in the help to the police contains $100$ men exactly. Every evening $3$ men are on duty. Prove that you can not organise duties in such a way, that every couple will meet on duty once exactly.

For every positive integer $k$ let $a_{k,1},a_{k,2},\ldots$ be a sequence of positive integers. For every positive integer $k$ let sequence $\{a_{k+1,i}\}$ be the difference sequence of $\{a_{k,i}\}$, i.e. for all positive integers $k$ and $i$ the following holds: $a_{k,i+1}-a_{k,i}=a_{k+1,i}$. Is it possible that every positive integer appears exactly once among numbers $a_{k,i}$? [i]Proposed by Dávid Matolcsi, Berkeley[/i]

Let $S$ be a set of $2020$ distinct points in the plane. Let \[M=\{P:P\text{ is the midpoint of }XY\text{ for some distinct points }X,Y\text{ in }S\}.\] Find the least possible value of the number of points in $M$.

Consider $n$ points $A_1, A_2, \ldots, A_n$ on a circle. How many ways are there if we want to color these points by $p$ colors, so that each two neighbors points are colored with two different colors?

A $2^{2014} + 1$ by $2^{2014} + 1$ grid has some black squares filled. The filled black squares form one or more snakes on the plane, each of whose heads splits at some points but never comes back together. In other words, for every positive integer $n$ greater than $2$, there do not exist pairwise distinct black squares $s_1$, $s_2$, \dots, $s_n$ such that $s_i$ and $s_{i+1}$ share an edge for $i=1,2, \dots, n$ (here $s_{n+1}=s_1$). What is the maximum possible number of filled black squares? [i]Proposed by David Yang[/i]

Given is a table 4x4 and in every square there is 0 or 1. In a move we choose row or column and we change the numbers there. Call the square "zero" if we cannot decrease the number of zeroes in it. Call "degree of the square" the number zeroes in a "zero" square. Find all possible values of the degree.

In a school, there are totally $n$ students, with $n \ge 2$. The students take part in $m$ clubs and in each club, there are at least $2$ members (a student may take part in more than $1$ club). Eventually, the Principal notices that: If $2$ clubs share at least $2$ common members then they have different numbers of members. Prove that $$m \le (n - 1)^2$$

A clock has an hour, minute, and second hand, all of length $1$. Let $T$ be the triangle formed by the ends of these hands. A time of day is chosen uniformly at random. What is the expected value of the area of $T$? [i]Proposed by Dylan Toh[/i]

$100$ Queens are placed on a $100 \times 100$ chessboard so that no two attack each other. Prove that each of four $50 \times 50$ corners of the board contains at least one Queen.

Let $p$ be an odd prime, and put $N=\frac{1}{4} (p^3 -p) -1.$ The numbers $1,2, \dots, N$ are painted arbitrarily in two colors, red and blue. For any positive integer $n \leqslant N,$ denote $r(n)$ the fraction of integers $\{ 1,2, \dots, n \}$ that are red. Prove that there exists a positive integer $a \in \{ 1,2, \dots, p-1\}$ such that $r(n) \neq a/p$ for all $n = 1,2, \dots , N.$ [I]Netherlands[/i]

Let $AB$ be a segment of length $1$. Several particles start moving simultaneously at constant speeds from $A$ up to$ B$. As soon as a particle reaches $B$ , turns around and goes to $A$; when it reaches $A$, begins to move again towards $ B$ , and so on indefinitely. Find all rational numbers$ r>1$ such that there exists an instant $t$ with the following property: For each $n\ge 1$ , if $n+1$ particles with constant speeds $1,r,r^2,…,r^n$ move as described, at instant $t$, they all lie at the same interior point of segment $AB$.

Let $ n$ and $ k$ be given natural numbers, and let $ A$ be a set such that \[ |A| \leq \frac{n(n+1)}{k+1}.\] For $ i=1,2,...,n+1$, let $ A_i$ be sets of size $ n$ such that \[ |A_i \cap A_j| \leq k \;(i \not=j)\ ,\] \[ A= \bigcup_{i=1}^{n+1} A_i.\] Determine the cardinality of $ A$. [i]K. Corradi[/i]

An equilateral triangle of integer side length $n \geq 1$ is subdivided into small triangles of unit side length, as illustrated in the figure below for $n = 5$. In this diagram a subtriangle is a triangle of any size which is formed by connecting vertices of the small triangles along the grid lines. [img]https://cdn.artofproblemsolving.com/attachments/e/9/17e83ad4872fcf9e97f0479104b9569bf75ad0.jpg[/img] It is desired to color each vertex of the small triangles either red or blue in such a way that there is no subtriangle with all of its vertices having the same color. Let $f(n)$ denote the number of distinct colorings satisfying this condition. Determine, with proof, $f(n)$ for every $n \geq 1$

In a country, mathematicians chose an $\alpha> 2$ and issued coins in denominations of 1 ruble, as well as $\alpha ^k$ rubles for each positive integer k. $\alpha$ was chosen so that the value of each coins, except the smallest, was irrational. Is it possible that any natural number of rubles can be formed with at most 6 of each denomination of coins?

2010 MOPpers are assigned numbers 1 through 2010. Each one is given a red slip and a blue slip of paper. Two positive integers, A and B, each less than or equal to 2010 are chosen. On the red slip of paper, each MOPper writes the remainder when the product of A and his or her number is divided by 2011. On the blue slip of paper, he or she writes the remainder when the product of B and his or her number is divided by 2011. The MOPpers may then perform either of the following two operations: [list] [*] Each MOPper gives his or her red slip to the MOPper whose number is written on his or her blue slip. [*] Each MOPper gives his or her blue slip to the MOPper whose number is written on his or her red slip.[/list] Show that it is always possible to perform some number of these operations such that each MOPper is holding a red slip with his or her number written on it. [i]Brian Hamrick.[/i]

Given a $m\times n$ grid rectangle with $m,n \ge 4$ and a closed path $P$ that is not self intersecting from inner points of the grid, let $A$ be the number of points on $P$ such that $P$ does not turn in them and let $B$ be the number of squares that $P$ goes through two non-adjacent sides of them furthermore let $C$ be the number of squares with no side in $P$. Prove that $$A=B-C+m+n-1.$$

Let $n$ be an integer $> 1$. In a circular arrangement of $n$ lamps $L_0, \cdots, L_{n-1}$, each one of which can be either ON or OFF, we start with the situation that all lamps are ON, and then carry out a sequence of steps, $Step_0, Step_1, \cdots$. If $L_{j-1}$ ($j$ is taken mod n) is ON, then $Step_j$ changes the status of $L_j$ (it goes from ON to OFF or from OFF to ON) but does not change the status of any of the other lamps. If $L_{j-1}$ is OFF, then $Step_j$ does not change anything at all. Show that: [i](a)[/i] There is a positive integer $M(n)$ such that after $M(n)$ steps all lamps are ON again. [i](b)[/i] If $n$ has the form $2^k$, then all lamps are ON after $n^2 - 1$ steps. [i](c) [/i]If $n$ has the form $2^k +1$, then all lamps are ON after $n^2 -n+1$ steps.

Let the boxes in picture $1$ be marked as in picture $2$ below (from top to bottom in layers). In one move it is allowed to switch the empty box with another box adjacent to it (two boxes are adjacent if they share a common side). Can the arrangement of the numbers in picture $3$ be obtained after finitely many moves?

(a)The game of "super- chess" is played on a $30 \times 30$ board and involves $20$ different pieces. Each piece moves according to its own rules , but cannot move from any square to more than $20$ other squares . A piece "captures" another piece which is on a square to which it has moved. A permitted move (e.g. $m$ squares forward and $n$ squares to the right) does not depend on the piece 's starting square . Prove that (i) A piece cannot cap ture a piece on a given square from more than $20$ starting squares. (ii) It is possible to arrange all $20$ pieces on the board in such a way that not one of them can capture any of the others in one move. (b) The game of "super-chess" is played on a $100 \times 100$ board and involves $20$ different pieces. Each piece moves according to its own rules , but cannot move from any square to more than $20$ other squares. A piece "captures" another piece which is on a square to which it has moved. It is possible that a permitted move (e.g. $m$ squares forward and $n$ squares to the right) may vary, depending on the piece's position . Prove that one can arrange all $20$ pieces on the board in such a way that not one of them can capture any of the others in one move. ( A . K . Tolpygo, Kiev) PS. (a) for Juniors , (b) for Seniors

38th Austrian Mathematical Olympiad 2007, round 3 problem 5 Given is a convex $ n$-gon with a triangulation, that is a partition into triangles through diagonals that don’t cut each other. Show that it’s always possible to mark the $ n$ corners with the digits of the number $ 2007$ such that every quadrilateral consisting of $ 2$ neighbored (along an edge) triangles has got $ 9$ as the sum of the numbers on its $ 4$ corners.

Find all positive integers $n \ge 4$ for which there are $n$ points in general position on the plane such that an arbitrary triangle with vertices belonging to the convex hull of these $n$ points, containing exactly one of $n - 3$ points inside remained.

The points with integer coordinates in a plane are painted in two colors – blue and red. Prove that there exist an infinite monochromatic subset that is symmetrical on some point.