I couldn't solve this problem and the only solution I was able to find was very unnatural (it was an official solution, I think) and I couldn't be satisfied with it, so I ask you if you can find some different solutions. The problem is really great one! If $M$ is the centroid of a triangle $ABC$, prove that the following inequality holds: \[\sin\angle CAM+\sin\angle CBM\leq\frac{2}{\sqrt3}.\] The equality occurs in a very strange case, I don't remember it.

In convex hexagon $ABCDEF$, all six sides are congruent, $\angle A$ and $\angle D$ are right angles, and $\angle B$, $\angle C$, $\angle E$, and $\angle F$ are congruent. The area of the hexagonal region is $2116(\sqrt{2}+1)$. Find $AB$.

We say that a covering of a $m\times n$ rectangle with dominos has a wall if there exists a horizontal or vertical line that splits the rectangle into two smaller rectangles and doesn't cut any of the dominos. prove that if these three conditions are satisfied: [b]a)[/b] $mn$ is an even number [b]b)[/b] $m\ge 5$ and $n\ge 5$ [b]c)[/b] $(m,n)\neq(6,6)$ then we can cover the rectangle with dominos in such a way that we have no walls. (20 points)

Given a positive integer $n$, determine the largest real number $\mu$ satisfying the following condition: for every set $C$ of $4n$ points in the interior of the unit square $U$, there exists a rectangle $T$ contained in $U$ such that $\bullet$ the sides of $T$ are parallel to the sides of $U$; $\bullet$ the interior of $T$ contains exactly one point of $C$; $\bullet$ the area of $T$ is at least $\mu$.

Consider a $9 \times 9$ array of white squares. Find the largest $n \in\mathbb N$ with the property: No matter how one chooses $n$ out of 81 white squares and color in black, there always remains a $1 \times 4$ array of white squares (either vertical or horizontal).

A ladder is formed by removing some consecutive unit squares of a $10\times 10$ chessboard such that for each $k-$th row ($k\in \{1,2,\dots, 10\}$), the leftmost $k-1$ unit squares are removed. How many rectangles formed by composition of unit squares does the ladder have? $ \textbf{(A)}\ 625 \qquad\textbf{(B)}\ 715 \qquad\textbf{(C)}\ 1024 \qquad\textbf{(D)}\ 1512 \qquad\textbf{(E)}\ \text{None of the preceding} $

In the following figure, the largest square is divided into two squares and three rectangles, as shown: The area of each smaller square is equal to $a$ and the area of each small rectangle is equal to $b$. If $a+b=24$ and the root square of $a$ is a natural number, find all possible values for the area of the largest square. [img]https://cdn.artofproblemsolving.com/attachments/f/a/0b424d9c293889b24d9f31b1531bed5081081f.png[/img]

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]

For each positive integer $m$, we define $L_m$ as the figure that is obtained by overlapping two $1 \times m$ and $m \times 1$ rectangles in such a way that they coincide at the $1 \times 1$ square at their ends, as shown in the figure. [asy] pair h = (1, 0), v = (0, 1), o = (0, 0); for(int i = 1; i < 5; ++i) { o = (i*i/2 + i, 0); draw(o -- o + i*v -- o + i*v + h -- o + h + v -- o + i*h + v -- o + i*h -- cycle); string s = "$L_" + (string)(i) + "$"; label(s, o + ((i / 2), -1)); for(int j = 1; j < i; ++j) { draw(o + j*v -- o + j*v + h); draw(o + j*h -- o + j*h + v); } } label("...", (18, 0.5)); [/asy] Using some figures $L_{m_1}, L_{m_2}, \dots, L_{m_k}$, we cover an $n \times n$ board completely, in such a way that the edges of the figure coincide with lines in the board. Among all possible coverings of the board, find the minimal possible value of $m_1 + m_2 + \dots + m_k$. Note: In covering the board, the figures may be rotated or reflected, and they may overlap or not be completely contained within the board.

In a Cartesian coordinate plane, call a rectangle $standard$ if all of its sides are parallel to the $x$- and $y$- axes, and call a set of points $nice$ if no two of them have the same $x$- or $y$- coordinate. First, Bert chooses a nice set $B$ of $2016$ points in the coordinate plane. To mess with Bert, Ernie then chooses a set $E$ of $n$ points in the coordinate plane such that $B\cup E$ is a nice set with $2016+n$ points. Bert returns and then miraculously notices that there does not exist a standard rectangle that contains at least two points in $B$ and no points in $E$ in its interior. For a given nice set $B$ that Bert chooses, define $f(B)$ as the smallest positive integer $n$ such that Ernie can find a nice set $E$ of size $n$ with the aforementioned properties. Help Bert determine the minimum and maximum possible values of $f(B)$. [i]Yannick Yao[/i]

Consider a convex quadrilateral $ABCD$. Denote $M, \ N$ the points of tangency of the circle inscribed in $\triangle ABD$ with $AB, \ AD$, respectively and $P, \ Q$ the points of tangency of the circle inscribed in $\triangle CBD$ with the sides $CD, \ CB$, respectively. Assume that the circles inscribed in $\triangle ABD, \ \triangle CBD$ are tangent. Prove that: a) $ABCD$ is circumscriptible. b) $MNPQ$ is cyclic. c) The circles inscribed in $\triangle ABC, \ \triangle ADC$ are tangent.

Let $a_1,a_2,a_3,\cdots$ be a non-decreasing sequence of positive integers. For $m\ge1$, define $b_m=\min\{n: a_n \ge m\}$, that is, $b_m$ is the minimum value of $n$ such that $a_n\ge m$. If $a_{19}=85$, determine the maximum value of \[a_1+a_2+\cdots+a_{19}+b_1+b_2+\cdots+b_{85}.\]

A rectangle in xy Cartesian System is called latticed if all it's vertices have integer coordinates. a) Find a latticed rectangle of area $2013$, whose sides are not parallel to the axes. b) Show that if a latticed rectangle has area $2011$, then their sides are parallel to the axes.

Let $\{R_i\}_{1\leq i\leq n}$ be a family of disjoint closed rectangular surfaces with total area 4 such that their projections of the $Ox$ axis is an interval. Prove that there exist a triangle with vertices in $\displaystyle \bigcup_{i=1}^n R_i$ which has an area of at least 1. [Thanks Grobber for the correction]

Consider an 8x8 board divided in 64 unit squares. We call [i]diagonal[/i] in this board a set of 8 squares with the property that on each of the rows and the columns of the board there is exactly one square of the [i]diagonal[/i]. Some of the squares of this board are coloured such that in every [i]diagonal[/i] there are exactly two coloured squares. Prove that there exist two rows or two columns whose squares are all coloured.

Andy, Bess, Charley and Dick play on a $1000 \times 1000$ board. They make moves in turn: Andy first, then Bess, then Charley and finally Dick, after that Andy moves again and so on. At each move a player must paint several unpainted squares forming $2 \times 1, 1 \times 2, 1 \times 3$, or $3 \times 1$ rectangle. The player that cannot move loses. Prove that some three players can cooperate to make the fourth player lose.

Six regular hexagons surround a regular hexagon of side length $1$ as shown. What is the area of $\triangle ABC$? [asy] for(int i = 0; i < 6; ++i){ for(int j = 0; j < 6; ++j){ draw(sqrt(3)*dir(60*i+30)+dir(60*j)--sqrt(3)*dir(60*i+30)+dir(60*j+60)); } } draw(2*dir(60)--2*dir(180)--2*dir(300)--cycle); label("A",2*dir(180),dir(180)); label("B",2*dir(60),dir(60)); label("C",2*dir(300),dir(300)); [/asy] $ \textbf {(A) } 2\sqrt{3} \qquad \textbf {(B) } 3\sqrt{3} \qquad \textbf {(C) } 1+3\sqrt{2} \qquad \textbf {(D) } 2+2\sqrt{3} \qquad \textbf {(E) } 3+2\sqrt{3} $

A figure consisting of five equal-sized squares is placed as shown in a rectangle of size $7\times 8$ units. Find the side length of the squares. [img]https://cdn.artofproblemsolving.com/attachments/e/e/cbc2b7b0693949790c1958fb1449bdd15393d8.png[/img]

A rectangle of size $ m \times n$ has been filled completely by trominoes (a tromino is an L-shape consisting of 3 unit squares). There are four ways to place a tromino 1st way: let the "corner" of the L be on top left 2nd way: let the "corner" of the L be on top right 3rd way: let the "corner" of the L be on bottom left 4th way: let the "corner" of the L be on bottom right Prove that the difference between the number of trominoes placed in the 1st and the 4th way is divisible by $ 3$.

Let $a$ and $b$ be positive real numbers. Consider a regular hexagon of side $a$, and build externally on its sides six rectangles of sides $a$ and $b$. The new twelve vertices lie on a circle. Now repeat the same construction, but this time exchanging the roles of $a$ and $b$; namely; we start with a regular hexagon of side $b$ and we build externally on its sides six rectangles of sides $a$ and $b$. The new twelve vertices lie on another circle. Show that the two circles have the same radius.

The $ 8\times 18$ rectangle $ ABCD$ is cut into two congruent hexagons, as shown, in such a way that the two hexagons can be repositioned without overlap to form a square. What is $ y$? [asy] unitsize(2mm); defaultpen(fontsize(10pt)+linewidth(.8pt)); dotfactor=4; draw((0,4)--(18,4)--(18,-4)--(0,-4)--cycle); draw((6,4)--(6,0)--(12,0)--(12,-4)); label("$D$",(0,4),NW); label("$C$",(18,4),NE); label("$B$",(18,-4),SE); label("$A$",(0,-4),SW); label("$y$",(9,1)); [/asy]$ \textbf{(A) } 6\qquad \textbf{(B) } 7\qquad \textbf{(C) } 8\qquad \textbf{(D) } 9\qquad \textbf{(E) } 10$

Ali Barber, the carpet merchant, has a rectangular piece of carpet whose dimensions are unknown. Unfortunately, his tape measure is broken and he has no other measuring instruments. However, he finds that if he lays it flat on the floor of either of his storerooms, then each corner of the carpet touches a different wall of that room. He knows that the sides of the carpet are integral numbers of feet and that his two storerooms have the same (unknown) length, but widths of 38 feet and 50 feet respectively. What are the carpet dimensions?

In rectangle $ABCD$, point $E$ is chosen on $AB$ and $F$ is the foot of $E$ onto side $CD$ such that the circumcircle of $\vartriangle ABF$ intersects line segments $AD$ and $BC$ at points $G$ and $H$ respectively. Let $S$ be the intersection of $EF$ and $GH$, and $T$ the intersection of lines $EC$ and $DS$. If $\angle SF T = 15^o$ , compute the measure of $\angle CSD$.

Two players play a game involving an $n \times n$ grid of chocolate. Each turn, a player may either eat a piece of chocolate (of any size), or split an existing piece of chocolate into two rectangles along a grid-line. The player who moves last loses. For how many positive integers $n$ less than $1000$ does the second player win? (Splitting a piece of chocolate refers to taking an $a \times b$ piece, and breaking it into an $(a-c) \times b$ and a $c \times b$ piece, or an $a \times (b-d)$ and an $a \times d$ piece.) [i]Proposed by Lewis Chen[/i]

The vertices of hexagon $ABCDEF$ lie on a circle. Sides $AB = CD = EF = 6$, and sides $BC = DE = F A = 10$. The area of the hexagon is $m\sqrt3$. Find $m$.