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.

Some squares of the infinite sheet of cross-lined paper are red. Each $2\times 3$ rectangle (of $6$ squares) contains exactly two red squares. How many red squares can be in the $9\times 11$ rectangle of $99$ squares?

The points of space are painted in two colors. Prove that there is a tetrahedron such that all its vertices and its centroid are of the same color.

The following spiral sequence of squares is drawn on an infinite blackboard: The $1$st square $(1 \times 1)$ has a common vertical side with the $2$nd square (also $1\times 1$) drawn on the right side of it; the 3rd square $(2 \times 2)$ is drawn on the upper side of the $1$st and 2nd ones; the $4$th square $(3 \times 3)$ is drawn on the left side of the $1$st and $3$rd ones; the $5$th square $(5 \times 5)$ is drawn on the bottom side of the $4$th, 1st and $2$nd ones; the $6$th square $(8 \times 8)$ is drawn on the right side, and so on. Each of the squares has a common side with the rectangle consisting of squares constructed earlier. Prove that the centres of all the squares except the $1$st lie on two straight lines. (A Andjans, Riga)

On the plane $n$ points are chosen so that exactly $m$ of them lie on one straight line and no three points not included in these $m$ points lie on one straight line. What is the number of all lines, each of which contains at least two of these points?

With $28$ points, a “triangular grid” of equal sides is formed, as shown in the figure. One operation consists of choosing three points that are the vertices of an equilateral triangle and removing these three points from the grid. If after performing several of these operations there is only one point left, in what positions can that point remain? Give all the possibilities and indicate in each case the operations carried out. Justify why the remaining point cannot be in another position. [img]https://cdn.artofproblemsolving.com/attachments/f/c/1cedfe0e1c5086b77151538265f8e253e93d2e.gif[/img]

Find the greatest $n$ such that $(z+1)^n = z^n + 1$ has all its non-zero roots in the unitary circumference, e.g. $(\alpha+1)^n = \alpha^n + 1, \alpha \neq 0$ implies $|\alpha| = 1.$

Cut pyramid $ABCD$ into $8$ equal and similar pyramids, if: a) $AB = BC = CD$, $\angle ABC =\angle BCD = 90^o$, dihedral angle at edge $BC$ is right b) all plane angles at vertex $B$ are right and $AB = BC = BD\sqrt2$. Note. Whether there are other types of triangular pyramids that can be cut into any number similar to the original pyramids (their number is not necessarily $8$ and the pyramids are not necessarily equal to each other) is currently unknown

Is it possible to draw in the plane the graph presented in the figure so that all the vertices are different points and all the edges are unit segments? (The segments can intersect at points different from vertices.)

All vertices of a hexagon, whose sides may intersect at points other than the vertices, lie on a circle. (a) Draw a hexagon such that it has the largest possible number of points of self-intersection. (b) Prove that this number is indeed maximum. (NB Vassiliev)

$9$ points are given in the interior of the unit square. Prove there exists a triangle of area $\le \frac18$ whose vertices are three of the points.

Assume there are $ n\ge3$ points in the plane, Prove that there exist three points $ A,B,C$ satisfying $ 1\le\frac{AB}{AC}\le\frac{n\plus{}1}{n\minus{}1}.$

Pete claims that he can draw $4$ segments of length $1$ and a circle of radius less than $\sqrt3 /3 $ on a piece of paper, such that all segments would lie inside the circle and there would be no line that intersects each of $4$ segments. Is Pete right?

The streets of a town are arranged in three directions , dividing the town into blocks which are equilateral triangles of equal area. Traffic , when reaching an intersection, may only go straight ahead, or turn left or right through $120^0$ , as shown in the diagram. [img]https://cdn.artofproblemsolving.com/attachments/3/6/a100a5c39bf15116582bc0bceb76fcbae28af9.png[/img] No turns are permitted except the ones at intersections . One car departs for a certain nearby intersection and when it reaches it a second car starts moving toward it. From then on both cars continue travelling at the same speed (but do not necessarily take the same turns). Is it possible that there will be a time when they will encounter each other somewhere? ( N . N . Konstantinov , Moscow )

A square is given. Lines divide it into $n$ polygons. What is he the largest possible sum of the internal angles of all polygons?

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

Let $S$ be a set of $2022$ lines in the plane, no two parallel, no three concurrent. $S$ divides the plane into finite regions and infinite regions. Is it possible for all the finite regions to have integer area? [i]Proposed by Tony Wang[/i]

Consider a regular 2n-gon $ P$,$A_1,A_2,\cdots ,A_{2n}$ in the plane ,where $n$ is a positive integer . We say that a point $S$ on one of the sides of $P$ can be seen from a point $E$ that is external to $P$ , if the line segment $SE$ contains no other points that lie on the sides of $P$ except $S$ .We color the sides of $P$ in 3 different colors (ignore the vertices of $P$,we consider them colorless), such that every side is colored in exactly one color, and each color is used at least once . Moreover ,from every point in the plane external to $P$ , points of most 2 different colors on $P$ can be seen .Find the number of distinct such colorings of $P$ (two colorings are considered distinct if at least one of sides is colored differently). [i]Proposed by Viktor Simjanoski, Macedonia[/i] JBMO 2017, Q4

Consider the part of a lattice given by the corners $(0, 0), (n, 0), (n, 2)$ and $(0, 2)$. From a lattice point $(a, b)$ one can move to $(a + 1, b)$ or to $(a + 1, b + 1)$ or to $(a, b - 1$), provided that the second point is also contained in the part of the lattice. How many ways are there to move from $(0, 0)$ to $(n, 2)$ considering these rules?

Luke chose a set of three different dates $a,b,c$ in the month of May, where in any year, if one makes a calendar with a sheet of grid paper the centers of the cells with dates $a,b,c$ would form an isosceles right triangle or a straight line. How many sets can be chosen? [img]https://cdn.artofproblemsolving.com/attachments/7/3/dbf90fdc81fc0f0d14c32020b69df53b67b397.png[/img]

Given a trapezium with two parallel sides of lengths $m$ and $n$, where $m$, $n$ are integers, prove that it is possible to divide the trapezium into several congruent triangles.

A strip consists of $n$ squares which are numerated in their order by integers $1,2,3,..., n$. In the beginning, one square is empty while each remaining square contains one piece. Whenever a square contains a piece and its some neighbouring square contains another piece while the square immediately following the neighbouring square is empty, one may raise the first piece over the second one to the empty square, removing the second piece from the strip. Find all possibilites which square can be initially empty, if it is possible to reach a state where the strip contains only one piece and a) $n = 2008$, b) $n = 2009$.

What's the smallest positive integer \( n > 3 \), for which there does [b]not[/b] exist a (not necessarily convex) \( n \)-gon such that all its diagonals have equal lengths? A diagonal of any polygon is defined as a segment connecting any two non-adjacent vertices of the polygon. [i]Proposed by Anton Trygub[/i]

Call the ordered pair of distinct circles $(\omega, \gamma)$ scribable if there exists a triangle with circumcircle $\omega$ and incircle $\gamma$. Prove that among $n$ distinct circles there are at most $(n/2)^2$ scribable pairs. [i]Proposed by Daniel Liu

A straight line is drawn across an $8\times 8$ chessboard. It is said to [i]pierce [/i]a square if it passes through an interior point of the square. At most how many of the $64$ squares can this line [i]pierce[/i]?