The diagram shows a rectangle that has been dissected into nine non-overlapping squares. Given that the width and the height of the rectangle are relatively prime positive integers, find the perimeter of the rectangle. [asy] defaultpen(linewidth(0.7)); draw((0,0)--(69,0)--(69,61)--(0,61)--(0,0));draw((36,0)--(36,36)--(0,36)); draw((36,33)--(69,33));draw((41,33)--(41,61));draw((25,36)--(25,61)); draw((34,36)--(34,45)--(25,45)); draw((36,36)--(36,38)--(34,38)); draw((36,38)--(41,38)); draw((34,45)--(41,45));[/asy]

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

Around the convex quadrilateral $ABCD$, three rectangles are circumscribed . It is known that two of these rectangles are squares. Is it true that the third one is necessarily a square? (A rectangle is circumscribed around the quadrilateral $ABCD$ if there is one vertex $ABCD$ on each side of the rectangle).

Consider a cuboid$ ABCDA'B'C'D'$ (where $ABCD$ is a rectangle and $AA' \parallel BB' \parallel CC' \parallel DD'$) with $AA' = d$, $\angle ABD' = \alpha, \angle A'D'B = \beta$. Express the lengths x = $AB$, $y = BC$ in terms of $d$ and (acute) angles $\alpha, \beta$. Discuss condition of solvability.

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 rectangular building consists of $30$ square rooms situated like the cells of a $2 \times 15$ board. In each room there are three doors, each of which leads to another room (not necessarily different). How many ways are there to distribute the doors between the rooms so that it is possible to get from any room to any other one without leaving the building?

How many $1 \times 10\sqrt 2$ rectangles can be cut from a $50\times 90$ rectangle using cuts parallel to its edges?

$ABCD$ is a rectangular sheet of paper that has been folded so that corner $B$ is matched with point $B'$ on edge $AD$. The crease is $EF$, where $E$ is on $AB$ and $F$is on $CD$. The dimensions $AE=8$, $BE=17$, and $CF=3$ are given. The perimeter of rectangle $ABCD$ is $m/n$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. [asy] size(200); defaultpen(linewidth(0.7)+fontsize(10)); pair A=origin, B=(25,0), C=(25,70/3), D=(0,70/3), E=(8,0), F=(22,70/3), Bp=reflect(E,F)*B, Cp=reflect(E,F)*C; draw(F--D--A--E); draw(E--B--C--F, linetype("4 4")); filldraw(E--F--Cp--Bp--cycle, white, black); pair point=( 12.5, 35/3 ); label("$A$", A, dir(point--A)); label("$B$", B, dir(point--B)); label("$C$", C, dir(point--C)); label("$D$", D, dir(point--D)); label("$E$", E, dir(point--E)); label("$F$", F, dir(point--F)); label("$B^\prime$", Bp, dir(point--Bp)); label("$C^\prime$", Cp, dir(point--Cp));[/asy]

Prove that the bisectors of the angles of a rectangle, extended to their mutual intersection, form a square.

A rectangle $ABCD$ is given whose sides have lengths $3$ and $2n$, where $n$ is a natural number. Denote by $U(n)$ the number of ways in which one can cut the rectangle into rectangles of side lengths $1$ and $2$. $(a)$ Prove that \[U(n + 1)+U(n -1) = 4U(n);\] $(b)$ Prove that \[U(n) =\frac{1}{2\sqrt{3}}[(\sqrt{3} + 1)(2 +\sqrt{3})^n + (\sqrt{3} - 1)(2 -\sqrt{3})^n].\]

We attempt to cover the plane with an infinite sequence of rectangles, overlapping allowed. (a) Is the task always possible if the area of the $n$th rectangle is $n^2$ for each $n$? (b) Is the task always possible if each rectangle is a square, and for any number $N$, there exist squares with total area greater than $N$?

Let $ABCD$ be a rectangle in which $AB + BC + CD = 20$ and $AE = 9$ where $E$ is the midpoint of the side $BC$. Find the area of the rectangle.

A regular tetrahedron has side $L$. What is the smallest $x$ such that the tetrahedron can be passed through a loop of twine of length $x$?

In a matrix $2n \times 2n$, $n \in N$, are $4n^2$ real numbers with a sum equal zero. The absolute value of each of these numbers is not greater than $1$. Prove that the absolute value of a sum of all the numbers from one column or a row doesn't exceed $n$.

For each lattice point on the Cartesian Coordinate Plane, one puts a positive integer at the lattice such that [b]for any given rectangle with sides parallel to coordinate axes, the sum of the number inside the rectangle is not a prime. [/b] Find the minimal possible value of the maximum of all numbers.