Determine the poles of the inversions that transform four collienar points $A,B, C, D$, aligned in this order, at four points $A' $, $B' $, $C'$ , $D'$ that are vertices of a rectangle, and such that $A'$ and $C'$ are opposite vertices.

Several identical square sheets of paper are laid out on a rectangular table so that their sides are parallel to the edges of the table (sheets may overlap). Prove that you can stick a few pins in such a way that each sheet will be attached to the table exactly by one pin.

Sammy has a wooden board, shaped as a rectangle with length $2^{2014}$ and height $3^{2014}$. The board is divided into a grid of unit squares. A termite starts at either the left or bottom edge of the rectangle, and walks along the gridlines by moving either to the right or upwards, until it reaches an edge opposite the one from which the termite started. Depicted below are two possible paths of the termite. [img]https://cdn.artofproblemsolving.com/attachments/3/0/39f3b2aa9c61ff24ffc22b968790f4c61da6f9.png[/img] The termite’s path dissects the board into two parts. Sammy is surprised to find that he can still arrange the pieces to form a new rectangle not congruent to the original rectangle. This rectangle has perimeter $P$. How many possible values of $P$ are there?

In the plane we consider rectangles whose sides are parallel to the coordinate axes and have positive length. Such a rectangle will be called a [i]box[/i]. Two boxes [i]intersect[/i] if they have a common point in their interior or on their boundary. Find the largest $ n$ for which there exist $ n$ boxes $ B_1$, $ \ldots$, $ B_n$ such that $ B_i$ and $ B_j$ intersect if and only if $ i\not\equiv j\pm 1\pmod n$. [i]Proposed by Gerhard Woeginger, Netherlands[/i]

$ABCD$ is a rectangle. Segment $BA$ is extended through $A$ to a point $E$. Let the intersection of $EC$ and $AD$ be point $F$. Suppose that [the] measure of $\angle{ACD}$ is $60$ degrees, and that the length of segment $EF$ is twice the length of diagonal $AC$. What is the measure of $\angle{ECD}$?

Let $A=(a_{jk})$ be a $10\times 10$ array of positive real numbers such that the sum of numbers in row as well as in each column is $1$. Show that there exists $j<k$ and $l<m$ such that \[a_{jl}a_{km}+a_{jm}a_{kl}\ge \frac{1}{50}\]

Let $a,b$ be positive even integers. A rectangle with side lengths $a$ and $b$ is split into $a \cdot b$ unit squares. Anja and Bernd take turns and in each turn they color a square that is made of those unit squares. The person that can't color anymore, loses. Anja starts. Find all pairs $(a,b)$, such that she can win for sure. [b]Extension:[/b] Solve the problem for positive integers $a,b$ that don't necessarily have to be even. [b]Note:[/b] The [i]extension[/i] actually was proposed at first. But since this is a homework competition that goes over three months and some cases were weird, the problem was changed to even integers.

We call a coloring $f$ of the elements in the set $M = \{(x, y) | x = 0, 1, \dots , kn - 1; y = 0, 1, \dots , ln - 1\}$ with $n$ colors allowable if every color appears exactly $k$ and $ l$ times in each row and column and there are no rectangles with sides parallel to the coordinate axes such that all the vertices in $M$ have the same color. Prove that every allowable coloring $f$ satisfies $kl \leq n(n + 1).$

Let $\Gamma_{1}$ be a circle. $AB$ is a diameter, $\ell$ is the tangent at $B$, and $M$ is a point on $\Gamma_{1}$ other than $A$. $\Gamma_{2}$ is a circle tangent to $\ell$, and also to $\Gamma_{1}$ at $M$. a) Determine the point of tangency $P$ of $\ell$ and $\Gamma_{2}$ and find the locus of the center of $\Gamma_{2}$ as $M$ varies. b) Show that there exists a circle that is always orthogonal to $\Gamma_{2}$, regardless of the position of $M$.

A $9\times 9$ board has a number written on each square: all squares in the first row have $1$, all squares in the second row have $2$, $\ldots$, all squares in the ninth row have $9$. We will call [i]special [/i] rectangle any rectangle of $2\times 3$ or $3\times 2$ or $4\times 5$ or $5\times 4$ on the board. The permitted operations are: $\bullet$ Simultaneously add $1$ to all the numbers located in a special rectangle. $\bullet$ Simultaneously subtract $1$ from all numbers located in a special rectangle. Demonstrate that it is possible to achieve, through a succession of permitted operations, that $80$ squares to have $0$ (zero). What number is left in the remaining box?

Define a figure which is constructed by unit squares "cross star" if it satisfies the following conditions: $(1)$Square bar $AB$ is bisected by square bar $CD$ $(2)$At least one square of $AB$ lay on both sides of $CD$ $(3)$At least one square of $CD$ lay on both sides of $AB$ There is a rectangular grid sheet composed of $38\times 53=2014$ squares,find the number of such cross star in this rectangle sheet

A rectangle $\mathcal{R}$ with odd integer side lengths is divided into small rectangles with integer side lengths. Prove that there is at least one among the small rectangles whose distances from the four sides of $\mathcal{R}$ are either all odd or all even. [i]Proposed by Jeck Lim, Singapore[/i]

On sides $AC$ and $BC$ of acute-angled triangle $ABC$ rectangles with equal areas $ACPQ$ and $BKLC$ were built exterior. Prove that midpoint of $PL$, point $C$ and center of circumcircle are collinear.

A rectangle $ABEF$ is drawn on the leg $AB$ of a right triangle $ABC$, whose apex $F$ is on the leg $AC$. Let $X$ be the intersection of the diagonal of the rectangle $AE$ and the hypotenuse $BC$ of the triangle. In what ratio does point $X$ divide the hypotenuse $BC$ if it is known that $| AC | = 3 | AB |$ and $| AF | = 2 | AB |$?

A large rectangle is tiled by some $1\times1$ tiles. In the center there is a small rectangle tiled by some white tiles. The small rectangle is surrounded by a red border which is five tiles wide. That red border is surrounded by a white border which is five tiles wide. Finally, the white border is surrounded by a red border which is five tiles wide. The resulting pattern is pictured below. In all, $2900$ red tiles are used to tile the large rectangle. Find the perimeter of the large rectangle. [asy] import graph; size(5cm); fill((-5,-5)--(0,-5)--(0,35)--(-5,35)--cycle^^(50,-5)--(55,-5)--(55,35)--(50,35)--cycle,red); fill((0,30)--(0,35)--(50,35)--(50,30)--cycle^^(0,-5)--(0,0)--(50,0)--(50,-5)--cycle,red); fill((-15,-15)--(-10,-15)--(-10,45)--(-15,45)--cycle^^(60,-15)--(65,-15)--(65,45)--(60,45)--cycle,red); fill((-10,40)--(-10,45)--(60,45)--(60,40)--cycle^^(-10,-15)--(-10,-10)--(60,-10)--(60,-15)--cycle,red); fill((-10,-10)--(-5,-10)--(-5,40)--(-10,40)--cycle^^(55,-10)--(60,-10)--(60,40)--(55,40)--cycle,white); fill((-5,35)--(-5,40)--(55,40)--(55,35)--cycle^^(-5,-10)--(-5,-5)--(55,-5)--(55,-10)--cycle,white); for(int i=0;i<16;++i){ draw((-i,-i)--(50+i,-i)--(50+i,30+i)--(-i,30+i)--cycle,linewidth(.5)); } [/asy]

Let $ ABCD$ a cuadrilateral inscribed in a circumference. Suppose that there is a semicircle with its center on $ AB$, that is tangent to the other three sides of the cuadrilateral. (i) Show that $ AB \equal{} AD \plus{} BC$. (ii) Calculate, in term of $ x \equal{} AB$ and $ y \equal{} CD$, the maximal area that can be reached for such quadrilateral.

Is it possible to cover a rectangle of dimensions $m \times n$ with bricks that have the trimino angular shape (an arrangement of three unit squares forming the letter $\text L$) if: [b](a)[/b] $m \times n = 1985 \times 1987;$ [b](b)[/b] $m \times n = 1987 \times 1989 \quad ?$

Let $ABCD$ be a rectangle with $AB>BC$. Let points $E,F$ be on side $CD$ such that $CE=ED$ and $BC=CF$. Show that if $AC$ is prependicular to $BE$ then $AB=BF$.

On the infinite chessboard several rectangular pieces are placed whose sides run along the grid lines. Each two have no squares in common, and each consists of an odd number of squares. Prove that these pieces can be painted in four colours such that two pieces painted in the same colour do not share any boundary points.

In rectangle $ABCD$, $AB=6$ and $AD=8$. Point $M$ is the midpoint of $\overline{AD}$. What is the area of $\triangle AMC$? $\textbf{(A) }12\qquad\textbf{(B) }15\qquad\textbf{(C) }18\qquad\textbf{(D) }20\qquad \textbf{(E) }24$

Let $ABCD$ be a trapezoid such that side $[AB]$ and side $[CD]$ are perpendicular to side $[BC]$. Let $E$ be a point on side $[BC]$ such that $\triangle AED$ is equilateral. If $|AB|=7$ and $|CD|=5$, what is the area of trapezoid $ABCD$? $ \textbf{(A)}\ 27\sqrt{3} \qquad\textbf{(B)}\ 42 \qquad\textbf{(C)}\ 24\sqrt{3} \qquad\textbf{(D)}\ 40 \qquad\textbf{(E)}\ 36 $

Consider a rectangle with sides $2a$ and $2b$, where $a > b$. There should be four congruent right triangles (one triangle at each vertex of this rectangle , whose legs are on the sides of the rectangle lie) must be cut off so that the remaining figure forms an octagon with sides of equal length. The side of the octagon is to be expressed in terms of a and $b$ and constructed from $a$ and $b$. Besides that it must be stated under which conditions the problem can be solved.

Let $P$ be a variable point on arc $BC$ of the circumcircle of triangle $ABC$ not containing $A$. Let $I_1$ and $I_2$ be the incenters of the triangles $PAB$ and $PAC$, respectively. Prove that: [b](a)[/b] The circumcircle of $?PI_1I_2$ passes through a fixed point. [b](b)[/b] The circle with diameter $I_1I_2$ passes through a fixed point. [b](c)[/b] The midpoint of $I_1I_2$ lies on a fixed circle.

A rectangle \( m \times n \), where \( m \) and \( n \) are natural numbers strictly greater than 1, is partitioned into \( mn \) unit squares, each of which can be colored either black or white. An operation consists of changing the color of all the squares in a row or in a column to the opposite color. Is it possible that, although initially exactly one square is colored black and all the others are white, after a finite number of moves all squares have the same color?

How many rectangles can be formed by the vertices of a cube? (Note: square is also a special rectangle). A. $6$ B. $8$ C. $12$ D. $18$ E. $16$