Consider a $m\times n$ rectangular board consisting of $mn$ unit squares. Two of its unit squares are called [i]adjacent[/i] if they have a common edge, and a [i]path[/i] is a sequence of unit squares in which any two consecutive squares are adjacent. Two parths are called [i]non-intersecting[/i] if they don't share any common squares. Each unit square of the rectangular board can be colored black or white. We speak of a [i]coloring[/i] of the board if all its $mn$ unit squares are colored. Let $N$ be the number of colorings of the board such that there exists at least one black path from the left edge of the board to its right edge. Let $M$ be the number of colorings of the board for which there exist at least two non-intersecting black paths from the left edge of the board to its right edge. Prove that $N^{2}\geq M\cdot 2^{mn}$.

Let $ABCD$ be a rectangle. Points $E$ and $F$ are on diagonal $AC$ such that $F$ lies between $A$ and $E$; and $E$ lies between $C$ and $F$. The circumcircle of triangle $BEF$ intersects $AB$ and $BC$ at $G$ and $H$ respectively, and the circumcircle of triangle $DEF$ intersects $AD$ and $CD$ at $I$ and $J$ respectively. Prove that the lines $GJ, IH$ and $AC$ concur at a point.

A ball was launched on a rectangular billiard table at an angle of $45^o$ to one of the sides. Reflected from all sides (the angle of incidence is equal to the angle of reflection), he returned to his original position . It is known that one of the sides of the table has a length of one meter. Find the length of the second side. [img]https://cdn.artofproblemsolving.com/attachments/3/d/e0310ea910c7e3272396cd034421d1f3e88228.png[/img]

Given a scalene acute triangle $ABC$, let M be the midpoints of its side $BC$ and $N$ the midpoint of the arc $BAC$ of its circumcircle. Let $\omega$ be the circle with diameter $BC$ and $D$, $E$ its intersections with the bisector of angle $\angle BAC$. Points $D'$, $E'$ lie on $\omega$ such that $DED'E' $ is a rectangle. Prove that $D'$, $E'$, $M$, $N$ lie on a single circle. [i] (Patrik Bak)[/i]

A $1\times 2$ rectangle is inscribed in a semicircle with longer side on the diameter. What is the area of the semicircle? $\textbf{(A)}\ \frac\pi2 \qquad \textbf{(B)}\ \frac{2\pi}3 \qquad \textbf{(C)}\ \pi \qquad \textbf{(D)}\ \frac{4\pi}3 \qquad \textbf{(E)}\ \frac{5\pi}3$

Cut the $10$ cm $x 20$ cm rectangle into two pieces with one straight cut so that they can be placed inside the $19.4$ cm diameter circle without intersecting.

Consider all possible rectangles that can be drawn on a $8 \times 8$ chessboard, covering only whole cells. Calculate the sum of their areas. What formula is obtained if “$8 \times 8$” is replaced with “$a \times b$”, where $a, b$ are positive integers?

A semicircle with diameter $d$ is contained in a square whose sides have length $8$. Given the maximum value of $d$ is $m- \sqrt{n}$, find $m+n$.

Given a matrix $\{a_{ij}\}_{i,j=0}^{9}$, $a_{ij}=10i+j+1$. Andrei is going to cover its entries by $50$ rectangles $1\times 2$ (each such rectangle contains two adjacent entries) so that the sum of $50$ products in these rectangles is minimal possible. Help him. [i]A. Badzyan[/i]

A $ 9 \times 12$ rectangle is partitioned into unit squares. The centers of all the unit squares, except for the four corner squares and eight squares sharing a common side with one of them, are coloured red. Is it possible to label these red centres $ C_1,C_2,\ldots ,C_{96}$ in such way that the following to conditions are both fulfilled i) the distances $C_1C_2,\ldots ,C_{95}C_{96}, C_{96}C_{1}$ are all equal to $ \sqrt {13}$, ii) the closed broken line $ C_1C_2\ldots C_{96}C_1$ has a centre of symmetry? [i]Bulgaria[/i]

For $n>2$, an $n\times n$ grid of squares is coloured black and white like a chessboard, with its upper left corner coloured black. Then we can recolour some of the white squares black in the following way: choose a $2\times 3$ (or $3\times 2$) rectangle which has exactly $3$ white squares and then colour all these $3$ white squares black. Find all $n$ such that after a series of such operations all squares will be black.

Let $ ABC$ be an acute angled triangle; let $ D,F$ be the midpoints of $ BC,AB$ respectively. Let the perpendicular from $ F$ to $ AC$ and the perpendicular from $ B$ ti $ BC$ meet in $ N$: Prove that $ ND$ is the circumradius of $ ABC$. [15 points out of 100 for the 6 problems]

On a $2004 \times 2004$ chess table there are 2004 queens such that no two are attacking each other\footnote[1]{two queens attack each other if they lie on the same row, column or direction parallel with on of the main diagonals of the table}. Prove that there exist two queens such that in the rectangle in which the center of the squares on which the queens lie are two opposite corners, has a semiperimeter of 2004.

Two polygons are given on the plane. Assume that the distance between any two vertices of the same polygon is at most 1, and that the distance between any two vertices of different polygons is at least $ 1/\sqrt{2}$. Prove that these two polygons have no common interior points. By the way, can two sides of a polygon intersect?

The area of a rectangle remains unchanged when it is made $2 \frac{1}{2}$ inches longer and $\frac{2}{3}$ inch narrower, or when it is made $2 \frac{1}{2}$ inches shorter and $\frac{4}{3}$ inch wider. Its area, in square inches, is: $\textbf{(A)}\ 30\qquad \textbf{(B)}\ \frac{80}{3}\qquad \textbf{(C)}\ 24\qquad \textbf{(D)}\ \frac{45}{2}\qquad \textbf{(E)}\ 20$

Inside a rectangle is inscribed a quadrilateral, which has a vertex on each side of the rectangle. Prove that the perimeter of the inscribed quadrilateral is not smaller than double the length of a diagonal of the rectangle. (V. V . Proizvolov , Moscow)

Let $ABCD$ be a rectangle and $U, V$ two points of its circumcircle. Lines $AU,CV$ intersect at $P$ and lines $BU,DV$ intersect at $Q$, distinct from $P$. Prove that $$\frac{1}{PQ^2} \ge \frac{1}{UV^2} - \frac{1}{AC^2}$$ Michel Bataille

The director of a marching band wishes to place the members into a formation that includes all of them and has no unfilled positions. If they are arranged in a square formation, there are 5 members left over. The director realizes that if he arranges the group in a formation with 7 more rows than columns, there are no members left over. Find the maximum number of members this band can have.

The city is a rectangle divided onto squares by $m$ streets coming from the West to the East and $n$ streets coming from the North to the South. There are militioners (policemen) on the streets but not on the crossroads. They watch the certain automobile, moving along the closed route, marking the time and the direction of its movement. Its trace is not known in advance, but they know, that it will not pass over the same segment of the way twice. What is the minimal number of the militioners providing the unique determination of the route according to their reports?

Let $ABCD$ be a tetrahedron such that $AD \perp BD$, $BD \perp CD$, $CD \perp AD$ and $AD=10$, $BD=15$, $CD=20$. Let $E$ and $F$ be points such that $E$ lies on $BC$, $DE \perp BC$, and $ADEF$ is a rectangle. If $S$ is the solid consisting of all points inside $ABCD$ but outside $FBCD$, compute the volume of $S$. [i]2015 CCA Math Bonanza Individual Round #13[/i]

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.)

In the cartesian plane consider rectangles with sides parallel to the coordinate axes. We say that one rectangle is [i]below[/i] another rectangle if there is a line $g$ parallel to the $x$-axis such that the first rectangle is below $g$, the second one above $g$ and both rectangles do not touch $g$. Similarly, we say that one rectangle is [i]to the right of[/i] another rectangle if there is a line $h$ parallel to the $y$-axis such that the first rectangle is to the right of $h$, the second one to the left of $h$ and both rectangles do not touch $h$. Show that any finite set of $n$ pairwise disjoint rectangles with sides parallel to the coordinate axes can be enumerated as a sequence $(R_1,\dots,R_n)$ so that for all indices $i,j$ with $1 \le i<j \le n$ the rectangle $R_i$ is to the right of or below the rectangle $R_j$

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]

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?

Let $C_1$ and $C_2$ be two circles intersecting at $A $ and $B$. Let $S$ and $T $ be the centres of $C_1 $ and $C_2$, respectively. Let $P$ be a point on the segment $AB$ such that $ |AP|\ne |BP|$ and $P\ne A, P \ne B$. We draw a line perpendicular to $SP$ through $P$ and denote by $C$ and $D$ the points at which this line intersects $C_1$. We likewise draw a line perpendicular to $TP$ through $P$ and denote by $E$ and F the points at which this line intersects $C_2$. Show that $C, D, E,$ and $F$ are the vertices of a rectangle.