Is there a convex pentagon in which each diagonal is equal to some side?

Each detail of the “Young Solderer” instructor is a bracket in the shape of the letter $\Pi$, consisting of three single segments. Is it possible from the parts of this constructor are soldered together, a complete wire frame of the cube $2 \times 2 \times 2$, divided into $1 \times 1 \times 1$ cubes? (The frame consists of 27 points, connected by single segments; any two adjacent points must be connected by exactly one piece of wire.) [hide]=original wording]Каждая деталько нструктора ''Юный паяльщик'' — это скобка в виде буквы П, остоящая из трех единичных отрезков. Можно ли издеталей этого конструктора спаятьполный роволочный каркас куба 2 × × 2 × 2, разбитого на кубики 1 × 1 × 1? (Каркас состоит из 27 точек,соединенных единичными отрезками; любые две соседние точки должны бытьсоединены ровно одним проволочным отрезком.)[/hide]

The center of a circle and nine randomly selected points on this circle are colored in red. Every pair of those points is connected by a line segment, and every point of intersection of two line segments inside the circle is colored in red. What is the largest possible number of red points? A. $235$ B. $245$ C. $250$ D. $220$ E. $265$

On the plane are placed two triangles exterior to each other. Show that there always exists a line passing through two vertices of one triangle and separating the third vertex from all vertices of the other triangle.

Let $A_1,\ldots,A_n$ be different collinear points. Every point is dyed by one of four colors and every of these colors is used at least once. Show that there is a line segment where two colors are used exactly once and the other two are used at least once.

Find the greatest $n$ for which there exist $n$ lines in space, passing through a single point, such that any two of them form the same angle.

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?

An architect designed a hexagonal column with $37$ metal tubes of equal thickness. The figure shows the cross-section of this column. Is it possible to build a similar column whose number of tubes ends in $2003$? [img]https://cdn.artofproblemsolving.com/attachments/6/a/eb5714d2324aac8b78042d1f48f03b74ab0d78.png[/img]

(a) Several identical napkins, each in the shape of a regular hexagon, are put on a table (the napkins may overlap). Each napkin has one side which is parallel to a fixed line. Is it always possible to hammer a few nails into the table so that each napkin is nailed with exactly one nail? (b) The same question for regular pentagons. (A Kanel)

There are a number of arcs on the edge of a circular disk. Each pair of arcs has the least one point in common. Show that on the circle you can choose two diametrical opposites points such that each arc contains at least one of these two points.

The vertices of a regular $13$-gon are colored in three different colors. Show that there are three vertices which have the same color and are also the vertices of an isosceles triangle.

Let $P = \{(x, y) | x, y \in \{0, 1, 2,... , 2015\}\}$ be a set of points on the plane. Straight wires of unit length are placed to connect points in $P$ so that each piece of wire connects exactly two points in $P$, and each point in $P$ is an endpoint of exactly one wire. Prove that no matter how the wires are placed, it is always possible to draw a straight line parallel to either the horizontal or vertical axis passing through midpoints of at least $506$ pieces of wire.

Let $A$ be an infinite set of points in the plane such that inside each circle there are only a finite number of points of $A$, with the following properties: $\bullet$ $(0, 0)$ belongs to $A$. $\bullet$ If $(a, b)$ and $(c, d)$ belong to $A$, then $(a-c, b-d)$ belongs to $A$. $\bullet$ There is a value of $\alpha$ such that by rotating the set $A$ with center at $(0, 0)$ and angle $\alpha$, the set $A$ is obtained again. Prove that $\alpha$ must be equal to $\pm 60^{\circ}$ or $\pm 90^{\circ}$ or $\pm 120^{\circ}$ or $\pm 180^{\circ}$.

Call a convex polyhedron a [i]footballoid [/i] if it has the following properties. (1) Any face is either a regular pentagon or a regular hexagon. (2) All neighbours of a pentagonal face are hexagonal (a [i]neighbour [/i] of a face is a face that has a common edge with it). Find all possibilities for the number of pentagonal and hexagonal faces of a footballoid.

Given are $n$ $(n > 2)$ points on the plane such that no three of them are collinear. In how many ways this set of points can be divided into two non-empty subsets with non-intersecting convex envelops?

In the plane you have $2018$ points between which there are not three on the same line. These points are colored with $30$ colors so that no two colors have the same number of points. All triangles are formed with their three vertices of different colors. Determine the number of points for each of the $30$ colors so that the total number of triangles with the three vertices of different colors is as large as possible.

Let $E$ be the set of $n^2+1$ closed intervals on the real axis. Prove that there exists a subset of $n+1$ intervals that are monotonically increasing with respect to inclusion, or a subset of $n+1$ intervals none of which contains any other interval from the subset.

Show that we can find $\alpha>0$ such that, given any point $P$ inside a regular $2n+1$-gon which is inscribed in a circle radius $1$, we can find two vertices of the polygon whose distance from $P$ differ by less than $\frac1n-\frac\alpha{n^3}$.

A man disposes of sufficiently many metal bars of length $2$ and wants to construct a grill of the shape of an $n \times n$ unit net. He is allowed to fold up two bars at an endpoint or to cut a bar into two equal pieces, but two bars may not overlap or intersect. What is the minimum number of pieces he must use?

A table is covered by $15$ pieces of paper. Show that we can remove $7$ pieces so that the remaining $8$ cover at least $8/15$ of the table.

There are $n$ points in general position in space (no three lie on the same straight line, no four lie in the same plane). A plane is drawn through every three of them. Prove that If you take any whatever $n-3$ points in space, there is a plane from those drawn that does not contain any of these $n - 3$ points.

Let $n \ge 3$ be an integer, and consider a $n \times n$-board, divided into $n^2$ unit squares. For all $m \ge 1$, arbitrarily many $1\times m$-rectangles (type I) and arbitrarily many $m\times 1$-rectangles (type II) are available. We cover the board with $N$ such rectangles, without overlaps, and such that every rectangle lies entirely inside the board. We require that the number of type I rectangles used is equal to the number of type II rectangles used.(Note that a $1 \times 1$-rectangle has both types.) What is the minimal value of $N$ for which this is possible?

Given $1000$ squares on the plane with their sides parallel to the coordinate axes. Let $M$ be the set of those squares centres. Prove that you can mark some squares in such a way, that every point of $M$ will be contained not less than in one and not more than in four marked squares

Given a square with side $10$. Cut it into $100$ congruent quadrilaterals such that each of them is inscribed into a circle with diameter $\sqrt{3}$. [i](5 points)[/i] [i]Ilya Bogdanov[/i]

Show that no matter how $15$ points are plotted within a circle of radius $2$ (circle border included), there will be a circle with radius $1$ (circle border including) which contains at least three of the $15$ points.