There are given $20$ points in the plane, no three of which lie on a single line. Prove that there exist at least $969$ quadrilaterals with vertices from the given points.

There are three straight roads. Three pedestrians are moving along those roads, and they are NOT on one line in the initial moment. Prove that they will be one line not more than twice

In a chess tournament $ 2n\plus{}3$ players take part. Every two play exactly one match. The schedule is such that no two matches are played at the same time, and each player, after taking part in a match, is free in at least $ n$ next (consecutive) matches. Prove that one of the players who play in the opening match will also play in the closing match.

Three triangles (blue, green and red) have a common interior point $M$. Prove that it is possible to choose one vertex from each triangle so that point $M$ is located inside the triangle formed by these selected vertices. (Imre Barani, Hungary)

Find all natural numbers $n \ge 3$ for which in an arbitrary $n$-gon one can choose $3$ vertices dividing its boundary into three parts, the lengths of which can be the lengths of the sides of some triangle. (Fedir Yudin)

Consider $n \ge 2$ pairwise disjoint disks $D_1,D_2,\ldots,D_n$ on the Euclidean plane. For each $k=1,2,\ldots,n$, denote by $f_k$ the inversion with respect to the boundary circle of $D_k$. (Here, $f_k$ is defined at every point of the plane, except for the center of $D_k$.) How many fixed points can the transformation $f_n\circ f_{n-1}\circ\ldots\circ f_1$ have, if it is defined on the largest possible subset of the plane?

Four frogs sit on the vertices of a square, one on each vertex. They jump in arbitrary order but not simultaneously. Each frog jumps to the point symmetrical to its take-off position with respect to the centre of gravity of the three other frogs. Can one of them jump (at a given time) exactly on to one of the others (considering their locations as points)? (A Andzans)

Let $n \geqslant 3$ be integer. Given convex $n-$polygon $\mathcal{P}$. A $3-$coloring of the vertices of $\mathcal{P}$ is called [i]nice[/i] such that every interior point of $\mathcal{P}$ is inside or on the bound of a triangle formed by polygon vertices with pairwise distinct colors. Determine the number of different nice colorings. ([I]Two colorings are different as long as they differ at some vertices. [/i])

What is the largest possible number of acute angles in an $n$-gon which is not selfintersecting (no two non-adjacent edges interesect)?

Let $S > 1$ be a real number. The Cartesian plane is partitioned into rectangles whose sides are parallel to the axes of the coordinate system. and whose vertices have integer coordinates. Prove that if the area of each triangle if at most $S$, then for any positive integer $k$ there exist $k$ vertices of these rectangles which lie on a line.

A $7 \times 7$ square is made up of $16$ $1 \times 3$ tiles and $1$ $1 \times 1$ tile. Prove that the $1 \times 1$ tile lies either at the centre of the square or adjoins one of its boundaries .

An ant crawls along the edges of a cube turning only at its vertices. It has visited one of the vertices $25$ times. Is it possible that it has visited each of the other $7$ vertices exactly $20$ times? (S Tokarev)

An ant decides to walk on the perimeter of an $ABC$ triangle. The ant can start at any vertex. Whenever the ant is in a vertex, it chooses one of the adjacent vertices and walks directly (in a straight line) to the chosen vertex. a) In how many ways can the ant walk around each vertex exactly twice? b) In how many ways can the ant walk around each vertex exactly three times? Note: For each item, consider that the starting vertex is visited.

In the plane there are $2014$ plotted points, such that no $3$ are collinear. For each pair of plotted points, draw the line that passes through them. prove that for every three of marked points there are always two that are separated by an amount odd number of lines.

Find all values of $k$ by which it is possible to divide any triangular region in $k$ quadrilaterals of equal area.

On an infinite “squared” sheet six squares are shaded as in the diagram. On some squares there are pieces. It is possible to transform the positions of the pieces according to the following rule: if the neighbour squares to the right and above a given piece are free, it is possible to remove this piece and put pieces on these free squares. The goal is to have all the shaded squares free of pieces. Is it possible to reach this goal if (a) In the initial position there are $6$ pieces and they are placed on the $6$ shaded squares? (b) In the initial position there is only one piece, located in the bottom left shaded square? [img]https://cdn.artofproblemsolving.com/attachments/2/d/0d5cbc159125e2a84edd6ac6aca5206bf8d83b.png[/img] (M Kontsevich, Moscow)

$64$ distinct points are positioned in the plane so that they determine exactly $2003$ different lines. Prove that among the $64$ points there are at least $4$ collinear points.

For even positive integer $n$ we put all numbers $1,2,...,n^2$ into the squares of an $n\times n$ chessboard (each number appears once and only once). Let $S_1$ be the sum of the numbers put in the black squares and $S_2$ be the sum of the numbers put in the white squares. Find all $n$ such that we can achieve $\frac{S_1}{S_2}=\frac{39}{64}.$

In the plane are given $1997$ points. Show that among the pairwise distances between these points, there are at least $32$ different values.

For which natural number $n$ is it possible to draw $n$ line segments between vertices of a regular $2n$-gon so that every vertex is an endpoint for exactly one segment and these segments have pairwise different lengths?

Into how many regions do $n$ circles divide the plane, if each pair of circles intersects in two points and no point lies on three circles?

Into how many parts can a convex $n$-gon be divided by its diagonals if no three diagonals meet at one point?

Let $P_1$ be a convex polyhedron with vertices $A_1,A_2,\ldots,A_9$. Let $P_i$ be the polyhedron obtained from $P_1$ by a translation that moves $A_1$ to $A_i$. Prove that at least two of the polyhedra $P_1,P_2,\ldots,P_9$ have an interior point in common.

Each grid point of a cartesian plane is colored with one of three colors, whereby all three colors are used. Show that one can always find a right-angled triangle, whose three vertices have pairwise different colors.

Let $ n > 2$. Show that there is a set of $ 2^{n-1}$ points in the plane, no three collinear such that no $ 2n$ form a convex $ 2n$-gon.