Several points on the plane are given, no three of them lie on the same line. Some of these points are connected by line segments. Assume that any line that does not pass through any of these points intersects an even number of these segments. Prove that from each point exits an even number of the segments.

Let $\mathcal S$ be a set of $16$ points in the plane, no three collinear. Let $\chi(S)$ denote the number of ways to draw $8$ lines with endpoints in $\mathcal S$, such that no two drawn segments intersect, even at endpoints. Find the smallest possible value of $\chi(\mathcal S)$ across all such $\mathcal S$. [i]Ankan Bhattacharya[/i]

For what $n$ can the vertices of a regular $n$-gon be connected in a $n$-link closed polyline so that such a polyline does not have three equal links?

Eva draws an equilateral triangle and its altitudes. In a first step she draws the center triangle of the equilateral triangle, in a second step the center triangle of this center triangle and so on. After each step Eva counts all triangles whose sides lie completely on drawn lines. What is the minimum number of center triangles she must have drawn so that the figure contains more than 2022 such triangles?

There are $1998$ rectangular pieces $2$ cm wide and $3$ cm long and with them squares are assembled (without overlapping or gaps). What is the greatest number of different squares that can be had at the same time?

Let $D$ be a regular dodecagon in the plane. How many squares are there in the plane at least two vertices in common with the vertices of $D$?

Each face of a cube is of the same size as each square of a chessboard. The cube is coloured black and white, placed on one of the squares of the chessboard and rolled so that each square of the chessboard is visited exactly once. Can this be done in such a way that the colour of the visited square and the colour of the bottom face of the cube are always the same? (A Shapovalov)

Each of the $9$ straight lines divides the given square onto two quadrangles with the areas ratio as $2:3$. Prove that there exist three of them intersecting in one point

Given $n>3$ points in the plane such that no three of the points are collinear. Does there exist a circle passing through (at least) $3$ of the given points and not containing any other of the $n$ points in its interior ?

Prove that for any finite bipartite planar graph, a circle can be assigned to each vertex so that all circles are coplanar, the circles assigned to any two adjacent vertices are tangent to one another, while the circles assigned to any two distinct, non-adjacent vertices intersect in two points.

Given a figure, containing $16$ segments. You should prove that there is no curve, that intersect each segment exactly once. The curve may be not closed, may intersect itself, but it is not allowed to touch the segments or to pass through the vertices. [asy] draw((0,0)--(6,0)--(6,3)--(0,3)--(0,0)); draw((0,3/2)--(6,3/2)); draw((2,0)--(2,3/2)); draw((4,0)--(4,3/2)); draw((3,3/2)--(3,3)); [/asy]

A polygon is decomposed into triangles by drawing some non-intersecting interior diagonals in such a way that for every pair of triangles of the triangulation sharing a common side, the sum of the angles opposite to this common side is greater than $180^o$. a) Prove that this polygon is convex. b) Prove that the circumcircle of every triangle used in the decomposition contains the entire polygon. [i]Proposed by Morteza Saghafian - Iran[/i]

Suppose \(40\) objects are placed along a circle at equal distances. In how many ways can \(3\) objects be chosen from among them so that no two of the three chosen objects are adjacent nor diametrically opposite?

Alice and Bob play a game, in which they take turns drawing segments of length $1$ in the Euclidean plane. Alice begins, drawing the first segment, and from then on, each segment must start at the endpoint of the previous segment. It is not permitted to draw the segment lying over the preceding one. If the new segment shares at least one point - except for its starting point - with one of the previously drawn segments, one has lost. a) Show that both Alice and Bob could force the game to end, if they don’t care who wins. b) Is there a winning strategy for one of them?

Let $ABCD$ be a square with side $20$ and $T_1, T_2, ..., T_{2000}$ are points in $ABCD$ such that no $3$ points in the set $S = \{A, B, C, D, T_1, T_2, ..., T_{2000}\}$ are collinear. Prove that there exists a triangle with vertices in $S$, such that the area is less than $1/10$.

Consider all trapezoids in a coordinate plane with interior angles of $90^o, 90^o, 45^o$ and $135^o$ whose bases are parallel to a coordinate axis and whose vertices have integer coordinates. Define the [i]size [/i] of such a trapezoid as the total number of points with integer coordinates inside and on the boundary of the trapezoid. (a) How many pairwise non-congruent such trapezoids of size $2001$ are there? (b) Find all positive integers not greater than $50$ that do not appear as sizes of any such trapezoid.

Let $S$ denote a square of side-length $7$, and let eight squares with side-length $3$ be given. Show that it is impossible to cover $S$ by those eight small squares with the condition: an arbitrary side of those (eight) squares is either coincided, parallel, or perpendicular to others of $S$ .

Bengt wants to put out crosses and rings in the squares of an $n \times n$-square, so that it is exactly one ring and exactly one cross in each row and in each column, and no more than one symbol in each box. Mona wants to stop him by setting a number in advance ban on crosses and a number of bans on rings, maximum one ban in each square. She want to use as few bans as possible of each variety. To succeed in preventing Bengt, how many prohibitions she needs to use the least of the kind of prohibitions she uses the most of?

$6$ points are selected on the plane, none of which $3$ lie on one straight line, and all pairwise segments connecting these points are plotted. Some of the sections are plotted in red and others in blue. Prove that any three of the given points are the vertices of a triangle with sides of the same color.

Let $\mathcal{S}$ be a finite set of at least two points in the plane. Assume that no three points of $\mathcal S$ are collinear. A [i]windmill[/i] is a process that starts with a line $\ell$ going through a single point $P \in \mathcal S$. The line rotates clockwise about the [i]pivot[/i] $P$ until the first time that the line meets some other point belonging to $\mathcal S$. This point, $Q$, takes over as the new pivot, and the line now rotates clockwise about $Q$, until it next meets a point of $\mathcal S$. This process continues indefinitely. Show that we can choose a point $P$ in $\mathcal S$ and a line $\ell$ going through $P$ such that the resulting windmill uses each point of $\mathcal S$ as a pivot infinitely many times. [i]Proposed by Geoffrey Smith, United Kingdom[/i]

What is the largest number of parts into which $n$ planes can divide space? We assume that the set of planes is non-degenerate in the sense that any three planes intersect in one point and no four planes have a common point (and for n=2 it is necessary to require that the planes are not parallel).

From a squared sheet of paper of size $29 \times 29, 99$ pieces, each a $2\times 2$ square, are cut off (all cutting is along the lines bounding the squares). Prove that at least one more piece of size $2\times 2$ may be cut from the remaining part of the sheet. (S Fomin, Leningrad)

In an aquarium there are nine small fish. The aquarium is cube shaped with a side length of two meters and is completely filled with water. Show that it is always possible to find two small fish with a distance of less than $\sqrt3$ meters.

The map of a town shows a plane divided into equal equilateral triangles. The sides of these triangles are streets and their vertices are intersections; $6$ streets meet at each junction. Two cars start simultaneously in the same direction and at the same speed from points $A$ and $B$ situated on the same street (the same side of a triangle). After any intersection an admissible route for each car is either to proceed in its initial direction or turn through $120^o$ to the right or to the left. Can these cars meet? (Either prove that these cars won’t meet or describe a route by which they will meet.) [img]https://cdn.artofproblemsolving.com/attachments/2/d/2c934bcd0c7fc3d9dca9cee0b6f015076abbdb.png[/img]

A rectangle is tiled with rectangles of size $6\times 1$. Prove that one of its side lengths is divisible by $6$.