Let $P$ be the intersection of lines $l_1$ and $l_2$. Let $S_1$ and $S_2$ be two circles externally tangent at $P$ and both tangent to $l_1$, and let $T_1$ and $T_2$ be two circles externally tangent at $P$ and both tangent to $l_2$. Let $A$ be the second intersection of $S_1$ and $T_1, B$ that of $S_1$ and $T_2, C$ that of $S_2$ and $T_1$, and $D$ that of $S_2$ and $T_2$. Show that the points $A,B,C,D$ are concyclic if and only if $l_1$ and $l_2$ are perpendicular.

It is given a 1001*1001 board divided in 1*1 squares. We want to amrk m squares in such a way that: 1: if 2 squares are adjacent then one of them is marked. 2: if 6 squares lie consecutively in a row or column then two adjacent squares from them are marked. Find the minimun number of squares we most mark.

The kid cut out of grid paper with the side of the cell $1$ rectangle along the grid lines and calculated its area and perimeter. Carlson snatched his scissors and cut out of this rectangle along the lines of the grid a square adjacent to the boundary of the rectangle. - My rectangle ... - kid sobbed. - There is something strange about this figure! - Nonsense, do not mention it - Carlson said - waving his hand carelessly. - Here you see, in this figure the perimeter is the same as the area of ​​the rectangle was, and the area is the same as was the perimeter! What size square did Carlson cut out?

Cut a rectangle into $18$ rectangles so that no two adjacent ones form a rectangle.

A $5\times5$ grid of squares is filled with integers. Call a rectangle [i]corner-odd[/i] if its sides are grid lines and the sum of the integers in its four corners is an odd number. What is the maximum possible number of corner-odd rectangles within the grid? Note: A rectangles must have four distinct corners to be considered [i]corner-odd[/i]; i.e. no $1\times k$ rectangle can be [i]corner-odd[/i] for any positive integer $k$.

A circle can be inscribed in the convex quadrilateral $ ABCD$. The incircle touches the sides $ AB, BC, CD, DA$ at $ A_1, B_1, C_1, D_1$ respectively. The points $ E, F, G, H$ are the midpoints of $ A_1B_1, B_1C_1, C_1D_1, D_1A_1$ respectively. Prove that the quadrilateral $ EFGH$ is a rectangle if and only if $ A, B, C, D$ are concyclic.

Two $4\times 4$ squares intersect at right angles, bisecting their intersecting sides, as shown. The circle's diameter is the segment between the two points of intersection. What is the area of the shaded region created by removing the circle from the squares? [asy] filldraw((0,1)--(1,2)--(3,0)--(1,-2)--(0,-1)--(-1,-2)--(-3,0)--(-1,2)--cycle, gray, black+linewidth(0.8)); filldraw(Circle(origin, 1.01), white, black+linewidth(0.8)); [/asy] $ \textbf{(A)}\ 16-4\pi\qquad\textbf{(B)}\ 16-2\pi\qquad\textbf{(C)}\ 28-4\pi\qquad\textbf{(D)}\ 28-2\pi\qquad\textbf{(E)}\ 32-2\pi $

We are given a positive integer $ r$ and a rectangular board $ ABCD$ with dimensions $ AB \equal{} 20, BC \equal{} 12$. The rectangle is divided into a grid of $ 20 \times 12$ unit squares. The following moves are permitted on the board: one can move from one square to another only if the distance between the centers of the two squares is $ \sqrt {r}$. The task is to find a sequence of moves leading from the square with $ A$ as a vertex to the square with $ B$ as a vertex. (a) Show that the task cannot be done if $ r$ is divisible by 2 or 3. (b) Prove that the task is possible when $ r \equal{} 73$. (c) Can the task be done when $ r \equal{} 97$?

Let $AXYZB$ be a convex pentagon inscribed in a semicircle of diameter $AB$. Denote by $P$, $Q$, $R$, $S$ the feet of the perpendiculars from $Y$ onto lines $AX$, $BX$, $AZ$, $BZ$, respectively. Prove that the acute angle formed by lines $PQ$ and $RS$ is half the size of $\angle XOZ$, where $O$ is the midpoint of segment $AB$.

A $9 \times 9$ square consists of $81$ unit squares. Some of these unit squares are painted black, and the others are painted white, such that each $2 \times 3$ rectangle and each $3 \times 2$ rectangle contain exactly 2 black unit squares and 4 white unit squares. Determine the number of black unit squares.

Let $ABCD$ be a square, and let $E$ and $F$ be points on $\overline{AB}$ and $\overline{BC}$, respectively. The line through $E$ parallel to $\overline{BC}$ and the line through $F$ parallel to $\overline{AB}$ divide $ABCD$ into two squares and two non square rectangles. The sum of the areas of the two squares is $\frac{9}{10}$ of the area of square $ABCD$. Find $\frac{AE}{EB} + \frac{EB}{AE}$.

Is it possible to write a natural number in every cell of an infinite chessboard in such a manner that for all integers $m, n > 100$, the sum of numbers in every $m\times n$ rectangle is divisible by $m + n \ ?$

You can tile a $2 \times5$ grid of squares using any combination of three types of tiles: single unit squares, two side by side unit squares, and three unit squares in the shape of an L. The diagram below shows the grid, the available tile shapes, and one way to tile the grid. In how many ways can the grid be tiled? [asy] import graph; size(15cm); pen dps = linewidth(1) + fontsize(10); defaultpen(dps); draw((-3,3)--(-3,1)); draw((-3,3)--(2,3)); draw((2,3)--(2,1)); draw((-3,1)--(2,1)); draw((-3,2)--(2,2)); draw((-2,3)--(-2,1)); draw((-1,3)--(-1,1)); draw((0,3)--(0,1)); draw((1,3)--(1,1)); draw((4,3)--(4,2)); draw((4,3)--(5,3)); draw((5,3)--(5,2)); draw((4,2)--(5,2)); draw((5.5,3)--(5.5,1)); draw((5.5,3)--(6.5,3)); draw((6.5,3)--(6.5,1)); draw((5.5,1)--(6.5,1)); draw((7,3)--(7,1)); draw((7,1)--(9,1)); draw((7,3)--(8,3)); draw((8,3)--(8,2)); draw((8,2)--(9,2)); draw((9,2)--(9,1)); draw((11,3)--(11,1)); draw((11,3)--(16,3)); draw((16,3)--(16,1)); draw((11,1)--(16,1)); draw((12,3)--(12,2)); draw((11,2)--(12,2)); draw((12,2)--(13,2)); draw((13,2)--(13,1)); draw((14,3)--(14,1)); draw((14,2)--(15,2)); draw((15,3)--(15,1));[/asy]

$p$ parallel lines are drawn in the plane and $q$ lines perpendicular to them are also drawn. How many rectangles are bounded by the lines?

In the rectangle $ABCD$ with $AB> BC$, the perpendicular bisecotr of $AC$ intersects the side $CD$ at point $E$. The circle with the center at point $E$ and the radius $AE$ intersects again the side $AB$ at point $F$. If point $O$ is the orthogonal projection of point $C$ on the line $EF$, prove that points $B, O$ and $D$ are collinear.

Determine all positive integers $m$ satisfying the condition that there exists a unique positive integer $n$ such that there exists a rectangle which can be decomposed into $n$ congruent squares and can also be decomposed into $m+n$ congruent squares.

The bisector of the diagonal $BD$ of a rectangle $ABCD$ (with $AB < BC$) intersects the lines $BC$ and $BA$ at points $E$ and $F$, respectively. The line passing through point $F$ and parallel to segment $AC$ intersects line $CD$ at point $G$. Prove that lines $EG$ and $AC$ are perpendicular

A Christmas tree must be erected inside a convex rectangular garden and attached to the posts at the corners of the garden with four ropes running at the same height from the ground. At what point should the Christmas tree be placed, so that the sum of the lengths of these four cords is as small as possible?

The rectangle is cut into 6 squares, as shown on the figure below. The gray square in the middle has a side equal to 1. What is the area of the rectangle? [img]https://i.ibb.co/gg1tBTN/Kyiv-MO-2023-7-1.png[/img]

In the diagram of rectangles below, with lengths as labeled, let $A$ be the area of the rectangle labeled $A$, and so on. Find $36A+6B+C+6D$. [asy] size(3cm); real[] A = {0,8,13}; real[] B = {0,7,12}; for (int i = 0; i < 3; ++i) { draw((A[i],0)--(A[i],-B[2])); draw((0,-B[i])--(A[2],-B[i])); } label("8", (4,0), N); label("5", (10.5,0),N); label("7", (0,-3.5),W); label("5", (0,-9.5),W); label("$A$", (4,-3.5)); label("$B$", (10.5,-3.5)); label("$C$", (10.5,- 9.5)); label("$D$", (4, -9.5)); [/asy] [i]2018 CCA Math Bonanza Team Round #1[/i]

A convex, closed figure lies inside a given circle. The figure is seen from every point of the circumference at a right angle (that is, the two rays drawn from the point and supporting the convex figure are perpendicular). Prove that the center of the circle is a center of symmetry of the figure.

Two equal rectangles are intersecting in $8$ points. Prove that the common part area is greater than the half of the rectangle's area.

Divide a $ 2\times 4 $ rectangle into $ 8 $ unit squares to obtain a set of $ 15 $ vertices denoted by $ \mathcal{M} . $ Find the points $ A\in\mathcal{M} $ that have the property that the set $ \mathcal{M}\setminus \{ A\} $ can form $ 7 $ pairs $ \left( A_1,B_1\right) ,\left( A_2,B_2\right) ,\ldots ,\left( A_7,B_7\right)\in\mathcal{M}\times\mathcal{M} $ such that $$ \overrightarrow{A_1B_1} +\overrightarrow{A_2B_2} +\cdots +\overrightarrow{A_7B_7} =\overrightarrow{O} . $$

In a $2^n \times 2^n$ square with $n$ positive integer is covered with at least two non-overlapping rectangle pieces with integer dimensions and a power of two as surface. Prove that two rectangles of the covering have the same dimensions (Two rectangles have the same dimensions as they have the same width and the same height, wherein they, not allowed to be rotated.)

Helen has a wooden rectangle of unknown dimensions, a straightedge, and a pencil (no compass). Is it possible for her to construct a line segment on the rectangle connecting the midpoints of two opposite sides, where she cannot draw any lines or points outside the rectangle? Note: Helen is allowed to draw lines between two points she has already marked, and mark the intersection of any two lines she has already drawn, if the intersection lies on the rectangle. Further, Helen is allowed to mark arbitrary points either on the rectangle or on a segment she has previously drawn. Assume that only the four vertices of the rectangle have been marked prior to the beginning of this process.