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?

A domino is a $2$ by $1$ rectangle . For what integers $m$ and $n$ can we cover an $m*n$ rectangle with non-overlapping dominoes???

The base of a triangle is of length $b$, and the latitude is of length $h$. A rectangle of height $x$ is inscribed in the triangle with the base of the rectangle in the base of the triangle. The area of the rectangle is: $ \textbf{(A)}\ \frac{bx}{h}(h-x)\qquad\textbf{(B)}\ \frac{hx}{b}(b-x)\qquad\textbf{(C)}\ \frac{bx}{h}(h-2x)\qquad$ $\textbf{(D)}\ x(b-x)\qquad\textbf{(E)}\ x(h-x) $

For a regular $n$-gon, let $M$ be the set of the lengths of the segments joining its vertices. Show that the sum of the squares of the elements of $M$ is greater than twice the area of the polygon.

Define a "hook" to be a figure made up of six unit squares as shown below in the picture, or any of the figures obtained by applying rotations and reflections to this figure. [asy] unitsize(0.5 cm); draw((0,0)--(1,0)); draw((0,1)--(1,1)); draw((2,1)--(3,1)); draw((0,2)--(3,2)); draw((0,3)--(3,3)); draw((0,0)--(0,3)); draw((1,0)--(1,3)); draw((2,1)--(2,3)); draw((3,1)--(3,3)); [/asy] Determine all $ m\times n$ rectangles that can be covered without gaps and without overlaps with hooks such that - the rectangle is covered without gaps and without overlaps - no part of a hook covers area outside the rectangle.

The real positive numbers $a_1, a_2,a_3$ are three consecutive terms of an arithmetic progression, and similarly, $b_1, b_2, b_3$ are distinct real positive numbers and consecutive terms of an arithmetic progression. Is it possible to use three segments of lengths $a_1, a_2, a_3$ as bases, and other three segments of lengths $b_1, b_2, b_3$ as altitudes, to construct three rectangles of equal area ?

If a $5 \times n$ rectangle can be tiled using $n$ pieces like those shown in the diagram, prove that $n$ is even. Show that there are more than $2 \cdot 3^{k-1}$ ways to file a fixed $5 \times 2k$ rectangle $(k \geq 3)$ with $2k$ pieces. (symmetric constructions are supposed to be different.)

Let $ k$ be a circle and $ k_{1},k_{2},k_{3},k_{4}$ four smaller circles with their centres $ O_{1},O_{2},O_{3},O_{4}$ respectively, on $ k$. For $ i \equal{} 1,2,3,4$ and $ k_{5}\equal{} k_{1}$ the circles $ k_{i}$ and $ k_{i\plus{}1}$ meet at $ A_{i}$ and $ B_{i}$ such that $ A_{i}$ lies on $ k$. The points $ O_{1},A_{1},O_{2},A_{2},O_{3},A_{3},O_{4},A_{4}$ lie in that order on $ k$ and are pairwise different. Prove that $ B_{1}B_{2}B_{3}B_{4}$ is a rectangle.

An $8$ by $2\sqrt{2}$ rectangle has the same center as a circle of radius $2$. The area of the region common to both the rectangle and the circle is $ \textbf{(A)}\ 2\pi \qquad\textbf{(B)}\ 2\pi+2 \qquad\textbf{(C)}\ 4\pi-4 \qquad\textbf{(D)}\ 2\pi+4 \qquad\textbf{(E)}\ 4\pi-2 $

The figure shows a network of roads bounding $12$ blocks. Person $P$ goes from $A$ to $B,$ and person $Q$ goes from $B$ to $A,$ each going by a shortest path (along roads). The persons start simultaneously and go at the same constant speed. At each point with two possible directions to take, both have the same probability. Find the probability that the persons meet. [asy] import graph; size(150); real lsf = 0.5; pen dp = linewidth(0.7) + fontsize(10); defaultpen(dp); pen ds = black; draw((0,3)--(4,3),linewidth(1.2pt)); draw((4,3)--(4,0),linewidth(1.2pt)); draw((4,0)--(0,0),linewidth(1.2pt)); draw((0,0)--(0,3),linewidth(1.2pt)); draw((1,3)--(1,0),linewidth(1.2pt)); draw((2,3)--(2,0),linewidth(1.2pt)); draw((3,3)--(3,0),linewidth(1.2pt)); draw((0,1)--(4,1),linewidth(1.2pt)); draw((4,2)--(0,2),linewidth(1.2pt)); dot((0,0),ds); label("$A$", (-0.3,-0.36),NE*lsf); dot((4,3),ds); label("$B$", (4.16,3.1),NE*lsf); clip((-4.3,-10.94)--(-4.3,6.3)--(16.18,6.3)--(16.18,-10.94)--cycle); [/asy]

Square $ABCD$ has side length $4$. Points $E$ and $F$ are the midpoints of sides $AB$ and $CD$, respectively. Eight $1$ by $2$ rectangles are placed inside the square so that no two of the eight rectangles overlap (see diagram). If the arrangement of eight rectangles is chosen randomly, then there are relatively prime positive integers $m$ and $n$ so that $\tfrac{m}{n}$ is the probability that none of the rectangles crosses the line segment $EF$ (as in the arrangement on the right). Find $m + n$. [asy] size(200); defaultpen(linewidth(0.8)+fontsize(10pt)); real r = 7; path square=origin--(4,0)--(4,4)--(0,4)--cycle; draw(square^^shift((r,0))*square,linewidth(1)); draw((1,4)--(1,0)^^(3,4)--(3,0)^^(0,2)--(1,2)^^(1,3)--(3,3)^^(1,1)--(3,1)^^(2,3)--(2,1)^^(3,2)--(4,2)); draw(shift((r,0))*((2,4)--(2,0)^^(0,2)--(4,2)^^(0,1)--(4,1)^^(0,3)--(2,3)^^(3,4)--(3,2))); label("A",(4,4),NE); label("A",(4+r,4),NE); label("B",(0,4),NW); label("B",(r,4),NW); label("C",(0,0),SW); label("C",(r,0),SW); label("D",(4,0),SE); label("D",(4+r,0),SE); label("E",(2,4),N); label("E",(2+r,4),N); label("F",(2,0),S); label("F",(2+r,0),S); [/asy]

A triangle has side lengths 10, 10, and 12. A rectangle has width 4 and area equal to the area of the triangle. What is the perimeter of this rectangle? $ \textbf{(A)}\ 16\qquad\textbf{(B)}\ 24\qquad\textbf{(C)}\ 28\qquad\textbf{(D)}\ 32\qquad\textbf{(E)}\ 36$

Let $ABCD$ be a rectangle with $AB = a$ and $BC = b$. Suppose $r_1$ is the radius of the circle passing through $A$ and $B$ touching $CD$; and similarly $r_2$ is the radius of the circle passing through $B$ and $C$ and touching $AD$. Show that \[ r_1 + r_2 \geq \frac{5}{8} ( a + b) . \]

Let $ABCD$ be a rectangle with $BC=3AB$. Show that if $P,Q$ are the points on side $BC$ with $BP = PQ = QC$, then \[\angle DBC+\angle DPC = \angle DQC.\]

In the coordinate space, each of the eight vertices of a rectangular box has integer coordinates. If the volume of the solid is $2011$, prove that the sides of the rectangular box are parallel to the coordinate axes.

$C$, $C'$ are concentric circles with radii $R$, $R'$. A rectangle has two adjacent vertices on $C$ and the other two vertices on $C'$. Find its sides if its area is as large as possible.

A rectangle is inscribed in a circle of area $32\pi$ and the area of the rectangle is $34$. Find its perimeter. [i]2017 CCA Math Bonanza Individual Round #2[/i]

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

Can we find $N$ such that all $m\times n$ rectangles with $m,n>N$ can be tiled with $4\times6$ and $5\times7$ rectangles?

A rectangular grid whose side lengths are integers greater than $1$ is given. Smaller rectangles with area equal to an odd integer and length of each side equal to an integer greater than $1$ are cut out one by one. Finally one single unit is left. Find the least possible area of the initial grid before the cuttings. Ps. Collected [url=https://artofproblemsolving.com/community/c949611_2019_nigerian_senior_mo_round_3]here[/url]

Let $L$ be the length of the altitude to the hypotenuse of a right triangle with legs $5$ and $12$. Find the least integer greater than $L$.

Jeck and Lisa are playing a game on table dimensions $m \times n$ , where $m , n >2$. Lisa starts so that she puts knight figurine on arbitrary square of table.After that Jeck and Lisa put new figurine on table by the following rules: [b]1.[/b] Jeck puts queen figurine on any empty square of a table which is two squares vertically and one square horizontally distant, or one square vertically and two squares horizontally distant from last knight figurine which Lisa put on the table [b]2.[/b] Lisa puts knight figurine on any empty square of a table which is in the same row, column or diagonal as last queen figurine Jeck put on the table. Player which cannot put his figurine loses. For which pairs of $(m,n)$ Lisa has winning strategy? [i] Proposed by Stijn Cambie[/i]

Triangle $ABC$ has an incenter $I$ l its incircle touches the side $BC$ at $T$. The line through $T$ parallel to $IA$ meets the incircle again at $S$ and the tangent to the incircle at $S$ meets $AB , AC$ at points $C' , B'$ respectively. Prove that triangle $AB'C'$ is similar to triangle $ABC$.

There is $3 \times 4 \times 5$ - box with its faces divided into $1 \times 1$ - squares. Is it possible to place numbers in these squares so that the sum of numbers in every stripe of squares (one square wide) circling the box, equals $120$?

A rectangle has side lengths $6$ and $8$. There are relatively prime positive integers $m$ and $n$ so that $\tfrac{m}{n}$ is the probability that a point randomly selected from the inside of the rectangle is closer to a side of the rectangle than to either diagonal of the rectangle. Find $m + n$.