Let $S$ be a set of 1980 points in the plane such that the distance between every pair of them is at least 1. Prove that $S$ has a subset of 220 points such that the distance between every pair of them is at least $\sqrt{3}.$

$(SWE 3)$ Find the natural number $n$ with the following properties: $(1)$ Let $S = \{P_1, P_2, \cdots\}$ be an arbitrary finite set of points in the plane, and $r_j$ the distance from $P_j$ to the origin $O.$ We assign to each $P_j$ the closed disk $D_j$ with center $P_j$ and radius $r_j$. Then some $n$ of these disks contain all points of $S.$ $(2)$ $n$ is the smallest integer with the above property.

Given a family $C$ of circles of the same radius $R$, which completely covers the plane (that is, every point in the plane belongs to at least one circle of the family), prove that there exist two circles of the family such that the distance between their centers is less than or equal to $R\sqrt3$ .

A rectangular building consists of $30$ square rooms situated like the cells of a $2 \times 15$ board. In each room there are three doors, each of which leads to another room (not necessarily different). How many ways are there to distribute the doors between the rooms so that it is possible to get from any room to any other one without leaving the building?

Given seven points on a plane, with no three points collinear. Prove that it is always possible to divide these points into the vertices of a triangle and a convex quadrilateral, with no shared parts between the two shapes.

Six points are given so that there are not three on the same line and that the lengths of the segments determined by these points are all different. We consider all the triangles that they have their vertices at these points. Show that there is a segment that is both the shortest side of one of those triangles and the longest side of another.

Find all numbers $n$ for which it is possible to cut a square into $n$ smaller squares.

The figure $F$ is the intersection of $N$ circles (they may have different radii). Find the maximal number of curvilinear “sides” which $F$ can have. Curvilinear sides of $F$ are the arcs (of the given circumferences) that constitute the boundary of $F$. (Their ends are the “vertices” of $F$ - the points of intersection of given circumferences that lie on the boundary of $F$.) (N Brodsky)

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$.

Given $100$ coplanar points, no three collinear, prove that at most $70\%$ of the triangles formed by the points have all angles acute.

Let $n$ be a positive integer. Consider $n^2+1$ (closed, i.e. including endpoints) segments on a single line. Show that at least one of the following statements holds: a) there are $n+1$ segments with non-empty intersection, b) there are $n+1$ segments among which two of them are disjoint.

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

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.

Prove that any identity that holds for every finite $ n$-distributive lattice also holds for the lattice of all convex subsets of the $ (n\minus{}1)$-dimensional Euclidean space. (For convex subsets, the lattice operations are the set-theoretic intersection and the convex hull of the set-theoretic union. We call a lattice $ n$-$ \textit{distributive}$ if \[ x \wedge (\bigvee_{i\equal{}0}^n y_i)\equal{}\bigvee_{j\equal{}0}^n(x \wedge (\bigvee_{0\leq i \leq n, \;i \not\equal{} j\ }y_i))\] holds for all elements of the lattice.) [i]A. Huhn[/i]

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?

Let $ u_1, u_2, \ldots, u_m$ be $ m$ vectors in the plane, each of length $ \leq 1,$ with zero sum. Show that one can arrange $ u_1, u_2, \ldots, u_m$ as a sequence $ v_1, v_2, \ldots, v_m$ such that each partial sum $ v_1, v_1 \plus{} v_2, v_1 \plus{} v_2 \plus{} v_3, \ldots, v_1, v_2, \ldots, v_m$ has length less than or equal to $ \sqrt {5}.$

(1) Prove that, on the complex plane, the area of the convex hull of all complex roots of $z^{20}+63z+22=0$ is greater than $\pi$. (2) Let $a_1,a_2,\ldots,a_n$ be complex numbers with sum $1$, and $k_1<k_2<\cdots<k_n$ be odd positive integers. Let $\omega$ be a complex number with norm at least $1$. Prove that the equation \[ a_1 z^{k_1}+a_2 z^{k_2}+\cdots+a_n z^{k_n}=w \] has at least one complex root with norm at most $3n|\omega|$.

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.

Is it possible to place some circles inside a square side length $1$, such that no two circles intersect and the sum of their radii is $2007$?

From a square board $1000\times 1000$ four rectangles $2\times 994$ have been cut off as shown on the picture. Initially, on the marked square there is a centaur - a piece that moves to the adjacent square to the left, up, or diagonally up-right in each move. Two players alternately move the centaur. The one who cannot make a move loses the game. Who has a winning strategy? [img]https://cdn.artofproblemsolving.com/attachments/c/6/f61c186413b642b5b59f3947bc7a108c772d27.png[/img]

A regular polygon with $n \ge 3$ sides is given. Each vertex is coloured either red, green or blue, and no two adjacent vertices of the polygon are the same colour. There is at least one vertex of each colour. Prove that it is possible to draw certain diagonals of the polygon in such a way that they intersect only at the vertices of the polygon and they divide the polygon into triangles so that each such triangle has vertices of three different colours.

Given a horizontal strip on the plane (its sides are parallel lines) and $n$ lines intersecting the strip. Every two of them intersect inside the strip, and not a triple has a common point. Consider all the paths along the segments of those lines, starting on the lower side of the strip and ending on the upper side with the properties: moving along such a path we are constantly rising up, and, having reached the intersection, we are obliged to turn to another line. Prove that: a) there are not less than $n/2$ such a paths without common points; b) there is a path consisting of not less than of $n$ segments; c) there is a path that goes along not more than along $n/2+1$ lines; d) there is a path that goes along all the $n$ lines.

There are $20$ points in the plane and no three of them are collinear. Of these points $10$ are red while the other $10$ are blue. Prove that there exists a straight line such that there are $5$ red points and $5$ blue points on either side of this line. (A Kushnirenko, Moscow)

Prove that there exists a positive constant $c$ such that the following statement is true: Consider an integer $n > 1$, and a set $\mathcal S$ of $n$ points in the plane such that the distance between any two different points in $\mathcal S$ is at least 1. It follows that there is a line $\ell$ separating $\mathcal S$ such that the distance from any point of $\mathcal S$ to $\ell$ is at least $cn^{-1/3}$. (A line $\ell$ separates a set of points S if some segment joining two points in $\mathcal S$ crosses $\ell$.) [i]Note. Weaker results with $cn^{-1/3}$ replaced by $cn^{-\alpha}$ may be awarded points depending on the value of the constant $\alpha > 1/3$.[/i] [i]Proposed by Ting-Feng Lin and Hung-Hsun Hans Yu, Taiwan[/i]