There are$ 1$ cm long bars with a number$ 1$, $2$ or $3$ written on each one from them. There is an unlimited supply of bars with each number. Two triangles formed by three bars are considered different if none of them can be built with the bars of the other triangle. (a) How many different triangles formed by three bars are possible? (b) An equilateral triangle of side length $3$ cm is formed using $18$ bars, , divided into $9$ equilateral triangles, different by pairs, $1$ cm long on each side. Find the largest sum possible from the numbers written on the $9$ bars of the border of the big triangle. [center][img]https://cdn.artofproblemsolving.com/attachments/1/1/c2f7edeea3c70ba4689d7b12fe8ac8be72f115.png[/img][/center]

Five points are given on the plane. Prove that among all the triangles with vertices at these points there are no more than seven acute-angled ones.

We are given $101$ rectangles with sides of integer lengths not exceeding $100$ . Prove that among these $101$ rectangles there are $3$ rectangles, say $A , B$ and $C$ such that $A$ will fit inside $B$ and $B$ inside $C$. ( N . Sedrakyan, Yerevan)

$3n$ points are given ($n\ge 1$) in the plane, each $3$ of them are not collinear. Prove that there are $n$ distinct triangles with the vertices those points.

Given several points, not all lying on one straight line. Some number is assigned to every point. It is known, that if a straight line contains two or more points, than the sum of the assigned to those points equals zero. Prove that all the numbers equal to zero.

For which integers $N\ge 3$ can we find $N$ points on the plane such that no three are collinear, and for any triangle formed by three vertices of the points’ convex hull, there is exactly one point within that triangle?

Is it possible to release a ray on a plane from each point with rational coordinates so that no two rays have a common point and at the same time, among the lines containing these rays, no two are parallel and do not coincide? [i]Proposed by P. Kozhevnikov[/i]

Prove that the squares with sides $\frac{1}{1}, \frac{1}{2}, \frac{1}{3},\ldots$ may be put into the square with side $\frac{3}{2} $ in such a way that no two of them have any interior point in common.

$2000$ lines are set on the plane. Prove that among them there are two such that have the same number of different intersection points with the rest of the lines.

Inside a square of side $16$ are placed $1000$ points. Show that it is possible to put a equilateral triangle of side $2\sqrt3$ in the plane so that it covers at least $16$ of these points.

Bob plotted $2003$ green points on the plane, so all triangles with three green vertices have area less than $1$. Prove that the $2003$ green points are contained in a triangle $T$ of area less than $4$.

Let $n$ be a positive integer. For a set of points in the plane $M$, we call $2$ distinct points $A,B \in M$ [i]connected[/i] if the line $AB$ contains exactly $n+1$ points from $M$. Find the minimum value of a positive integer $m$ such that there exists a set $M$ of $m$ points in the plane with the property that any point $A \in M$ is connected with exactly $2n$ other points from $M$.

Let $n \geq 4$, and consider a (not necessarily convex) polygon $P_1P_2\hdots P_n$ in the plane. Suppose that, for each $P_k$, there is a unique vertex $Q_k\ne P_k$ among $P_1,\hdots, P_n$ that lies closest to it. The polygon is then said to be [i]hostile[/i] if $Q_k\ne P_{k\pm 1}$ for all $k$ (where $P_0 = P_n$, $P_{n+1} = P_1$). (a) Prove that no hostile polygon is convex. (b) Find all $n \geq 4$ for which there exists a hostile $n$-gon.

Define the distance between two triangles to be the closest distance between two vertices, one from each triangle. Is it possible to draw five triangles in the plane such that for any two of them, their distance equals the sum of their circumradii?

Find all integers $n \geq 2$ for which there exists a sequence of $2n$ pairwise distinct points $(P_1, \dots, P_n, Q_1, \dots, Q_n)$ in the plane satisfying the following four conditions: [list=i] [*]no three of the $2n$ points are collinear; [*] $P_iP_{i+1} \ge 1$ for all $i = 1, 2, \dots ,n$, where $P_{n+1}=P_1$; [*] $Q_iQ_{i+1} \ge 1$ for all $i = 1, 2, \dots, n$, where $Q_{n+1} = Q_1$; and [*] $P_iQ_j \le 1$ for all $i = 1, 2, \dots, n$ and $j = 1, 2, \dots, n$.[/list] [i]Ray Li[/i]

Consider an equilateral triangle with every side divided by $n$ points into $n+1$ equal parts. We put a marker on every of the $3n$ division points. We draw lines parallel to the sides of the triangle through the division points, and this way divide the triangle into $(n+1)^2$ smaller ones. Consider the following game: if there is a small triangle with exactly one vertex unoccupied, we put a marker on it and simultaneously take markers from the two its occupied vertices. We repeat this operation as long as it is possible. (a) If $n\equiv1\pmod3$, show that we cannot manage that only one marker remains. (b) If $n\equiv0$ or $n\equiv2\pmod3$, prove that we can finish the game leaving exactly one marker on the triangle.

We are given $64$ cubes, each with five white faces and one black face. One cube is placed on each square of a chessboard, with its edges parallel to the sides of the board. We are allowed to rotate a complete row of cubes about the axis of symmetry running through the cubes or to rotate a complete column of cubes about the axis of symmetry running through the cubes. Show that by a sequence of such rotations we can always arrange that each cube has its black face uppermost

A convex $1993$-gon is divided into convex $7$-gons. Prove that there are $3$ neighbouring sides of the $1993$-gon belonging to one such $7$-gon. (A vertex of a $7$-gon may not be positioned on the interior of a side of the $1993$-gon, and two $7$-gons either have no common points, exactly one common vertex or a complete common side.) (A Kanel-Belov)

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?

In a plane $5$ points are given such that all triangles having vertices at these points are of area not greater than $1$. Show that there exists a trapezoid which contains all point in the interior (or on the sides) and having the area not exceeding $3$.

Can you draw some diagonals in a convex $2014$-gon so that they do not intersect, the whole $2014$-gon is divided into triangles and each vertex belongs to an odd number of these triangles?

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

Given four colours and enough square plates $1\times 1$. We have to paint four edges of every plate with four different colours and combine plates, putting them with the edges of the same colour together. Describe all the pairs $m,n$, such that we can combine those plates in a $n\times m$ rectangle, that has every edge of one colour, and its four edges have different colours.

Two squares are said to be [i]juxtaposed [/i] if their intersection is a point or a segment. Prove that it is impossible to [i]juxtapose [/i] to a square more than eight non-overlapping squares of the same size.

It is intended to make a map locating $30$ different cities on it. For this, all the distances between these cities are available as data (each of these distances is considered as a “data”). Three of these cities are already laid out on the map, and they turn out to be non-collinear. How much data must be used as a minimum to complete the map?