A set of points has [i]point symmetry[/i] if a reflection in some point maps the set to itself. Let $\cal P$ be a solid convex polyhedron whose orthogonal projections onto any plane have point symmetry. Prove that $\cal P$ has point symmetry. [i]Proposed by Ethan Tan[/i]

Given points $O$ and $A$ in the plane. Every point in the plane is colored with one of a finite number of colors. Given a point $X$ in the plane, the circle $C(X)$ has center $O$ and radius $OX+{\angle AOX\over OX}$, where $\angle AOX$ is measured in radians in the range $[0,2\pi)$. Prove that we can find a point $X$, not on $OA$, such that its color appears on the circumference of the circle $C(X)$.

An integer $n > 2$ is given. Peter wants to draw $n{}$ arcs of length $\alpha{}$ of great circles on a unit sphere so that they do not intersect each other. Prove that [list=a] [*]for all $\alpha<\pi+2\pi/n$ it is possible; [*]for all $\alpha>\pi+2\pi/n$ it is impossible; [/list] [i]Ilya Bogdanov[/i]

There are $12$ points that are vertices of a regular polygon with $12$ sides. Rafael must draw segments that have their two ends at two of the points drawn. He is allowed to have each point be an endpoint of more than one segment and for the segments to intersect, but he is prohibited from drawing three segments that are the three sides of a triangle in which each vertex is one of the $12$ starting points. Find the maximum number of segments Rafael can draw and justify why he cannot draw a greater number of segments.

One bird lives in each of $n$ bird-nests in a forest. The birds change nests, so that after the change there is again one bird in each nest. Also for any birds $A, B, C, D$ (not necessarily distinct), if the distance $AB < CD$ before the change, then $AB > CD$ after the change. Find all possible values of $n$.

Several diagonals in a convex $n$-gon are drawn so as to divide the $n$-gon into triangles and: (i) the number of diagonals drawn at each vertex is even; (ii) no two of the diagonals have a common interior point. Prove that $n$ is divisible by $3$.

Let $ z_{1},z_{2},z_{3}$ be three complex numbers of moduli less than or equal to $ 1$. $ w_{1},w_{2}$ are two roots of the equation $ (z \minus{} z_{1})(z \minus{} z_{2}) \plus{} (z \minus{} z_{2})(z \minus{} z_{3}) \plus{} (z \minus{} z_{3})(z \minus{} z_{1}) \equal{} 0$. Prove that, for $ j \equal{} 1,2,3$, $\min\{|z_{j} \minus{} w_{1}|,|z_{j} \minus{} w_{2}|\}\leq 1$ holds.

Determine all triangles that can be split into two congruent pieces by one cut. A cut consists of segments $P_1P_2$, $P_2P_3$, . . . , $P_{n-1}P_n$ where points $P_1, P_2, . . . , P_n$ are distinct, points $P_1$ and $P_n$ lie on the perimeter of the triangle and the rest of the points lie in the interior of the triangle such that the segments are disjoint except for the endpoints.

The maximum number of solid regular tetrahedrons can be placed against each other so that one of their edges coincides with a given line segment in space? [hide=original wording]Hoeveel massieve regelmatige viervlakken kan men maximaal tegen mekaar plaatsen zodat ´e´en van hun ribben samenvalt met een gegeven lijnstuk in de ruimte?[/hide]

Two straight lines divide a square of side length $1$ into four regions. Show that at least one of the regions has a perimeter greater than or equal to $2$. [i]Proposed by Dylan Toh[/i]

Consider a rectangle whose lengths of sides are natural numbers. If someone places as many squares as possible, each with area $3$, inside of the given rectangle, such that the sides of the squares are parallel to the rectangle sides, then the maximal number of these squares fill exactly half of the area of the rectangle. Determine the dimensions of all rectangles with this property.

$ABCD$ is a square side $10$. There are four points $P_1, P_2, P_3, P_4$ inside the square. Show that we can always construct line segments parallel to the sides of the square of total length $25$ or less, so that each $P_i$ is linked by the segments to both of the sides $AB$ and $CD$. Show that for some points $P_i$ it is not possible with a total length less than $25$.

Seven congruent line segments are connected together at their endpoints as shown in the figure below at the left. By raising point $E$ the linkage can be made taller, as shown in the figure below and to the right. Continuing to raise $E$ in this manner, it is possible to use the linkage to make $A, C, F$, and $E$ collinear, while simultaneously making $B, G, D$, and $E$ collinear, thereby constructing a new triangle $ABE$. Prove that a regular polygon with center $E$ can be formed from a number of copies of this new triangle $ABE$, joined together at point $E$, and without overlapping interiors. Also find the number of sides of this polygon and justify your answer. [img]https://cdn.artofproblemsolving.com/attachments/2/6/b3826b7ba7ea49642477878a03ac590281df43.png[/img]

Does there exist a rectangle which can be cut into a hundred rectangles such that all of them are similar to the original one but no two are congruent? [i]Mikhail Murashkin[/i]

Find for which natural numbers $n$ one can color the sides and diagonals of a regular $n$-gon with $n$ colors in such a way that for each triplet in pairs of different colors, a triangle can be found, the sides of which are sides or diagonals of $n$-gon and which is colored with exactly these three colors.

Prove that the entire space can be partitioned into “crosses” made of seven unit cubes as shown in the picture. [img]https://cdn.artofproblemsolving.com/attachments/2/b/77c4a4309170e8303af321daceccc4010da334.png[/img]

On a chess board, the boundaries of the squares are assumed to be black. Draw a circle of the greatest possible radius lying entirely on the black squares.

Twenty cubes have been coloured in the following way: There are two red faces opposite each other, two blue faces opposite each other and two green faces opposite each other. The cubes have been glued together as shown in the figure. Two faces that are glued together always have the same colour. The figure shows the colours of some of the faces. Which colours are possible for the face marked with the symbol $\times$? [img]https://cdn.artofproblemsolving.com/attachments/8/2/6127db5bfdce7a749d730fe3626499582f62ba.png[/img]

There are $2023$ guinea pigs placed in a circle, from which everyone except one of them, call it $M$, has a mirror that points towards one of the $2022$ other guinea pigs. $M$ has a lantern that will shoot a light beam towards one of the guinea pigs with a mirror and will reflect to the guinea pig that the mirror is pointing and will keep reflecting with every mirror it reaches. Isaías will re-direct some of the mirrors to point to some other of the $2023$ guinea pigs. In the worst case scenario, what is the least number of mirrors that need to be re-directed, such that the light beam hits $M$ no matter the starting point of the light beam?

A domino is a rectangle whose length is twice its width. Any square can be divided into seven dominoes, for example as shown in the figure below. [img]https://cdn.artofproblemsolving.com/attachments/7/6/c055d8d2f6b7c24d38ded7305446721e193203.png[/img] a) Show that you can divide a square into $n$ dominoes for all $n \ge 5$. b) Show that you cannot divide a square into three or four dominoes.

$ S$ be a set of $ n$ points in the plane. No three points of $ S$ are collinear. Prove that there exists a set $ P$ containing $ 2n \minus{} 5$ points satisfying the following condition: In the interior of every triangle whose three vertices are elements of $ S$ lies a point that is an element of $ P.$

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]

In the plane $xOy$, a lot of points are considered $$X = \{P (a, b) | (a, b) \in \{1, 2,..., 10\} \times \{1, 2,..., 10 \}\}$$ Determine the number of different lines that can be obtained by joining two of them between the points of the set $X$; so that any two lines are not parallel.

On a circular billiard table a ball rebounds from the rails as if the rail was the tangent to the circle at the point of impact. A regular hexagon with its vertices on the circle is drawn on a circular billiard table. A (point-shaped) ball is placed somewhere on the circumference of the hexagon, but not on one of its edges. Describe a periodical track of this ball with exactly four points at the rails. With how many different directions of impact can the ball be brought onto such a track?

Two players $A$ and $B$ play the following game: $A$ chooses a point, with integer coordinates, on the plane and colors it green, then $B$ chooses $10$ points of integer coordinates, not yet colored, and colors them yellow. The game always continues with the same rules; $A$ and $B$ choose one and ten uncolored points and color them green and yellow, respectively. a. The objective of $A$ is to achieve $111^2$ green points that are the intersections of $111$ horizontal lines and $111$ vertical lines (parallel to the coordinate axes). $B$'s goal is to stop him. Determine which of the two players has a strategy that ensures you achieve your goal. b. The objective of $A$ is to achieve $4$ green points that are the vertices of a square with sides parallel to the coordinate axes. $B$'s goal is to stop him. Determine which of the two players has a strategy that will ensure that they achieve their goal.