In rectangular coordinate system, the equation $\frac{|x+y|}{2a}+\frac{|x-y|}{2b}=1$ ($a,b$ are different positive numbers) refers to $\text{(A)}$ a triangle $\text{(B)}$ a square $\text{(C)}$ rectangle, not square $\text{(D)}$ rhombus, not square

Of the following statements, the one that is incorrect is: $ \textbf{(A)}\ \text{Doubling the base of a given rectangle doubles the area.}$ $ \textbf{(B)}\ \text{Doubling the altitude of a triangle doubles the area.}$ $ \textbf{(C)}\ \text{Doubling the radius of a given circle doubles the area.}$ $ \textbf{(D)}\ \text{Doubling the divisor of a fraction and dividing its numerator by 2 changes the quotient.}$ $ \textbf{(E)}\ \text{Doubling a given quantity may make it less than it originally was.}$

If the length and width of a rectangle are each increased by $ 10 \%$, then the perimeter of the rectangle is increased by \[ \textbf{(A)}\ 1 \% \qquad \textbf{(B)}\ 10 \% \qquad \textbf{(C)}\ 20 \% \qquad \textbf{(D)}\ 21 \% \qquad \textbf{(E)}\ 40 \% \]

Every point of the rectangle $R=[0,4] \times [0,40]$ is coloured using one of four colours. Show that there exist four points in $R$ with the same colour that form a rectangle having integer side lengths.

[asy] real t=pi/12;real u=8*t; real cu=cos(u);real su=sin(u); draw(unitcircle); draw((cos(-t),sin(-t))--(cos(13*t),sin(13*t))); draw((cu,su)--(cu,-su)); label("A",(cos(13*t),sin(13*t)),W); label("B",(cos(-t),sin(-t)),E); label("C",(cu,su),N); label("D",(cu,-su),S); label("E",(cu,sin(-t)),NE); label("2",((cu-1)/2,sin(-t)),N); label("6",((cu+1)/2,sin(-t)),N); label("3",(cu,(sin(-t)-su)/2),E); //Credit to Zimbalono for the diagram[/asy] Chords $AB$ and $CD$ in the circle above intersect at $E$ and are perpendicular to each other. If segments $AE$, $EB$, and $ED$ have measures $2$, $3$, and $6$ respectively, then the length of the diameter of the circle is $\textbf{(A) }4\sqrt{5}\qquad\textbf{(B) }\sqrt{65}\qquad\textbf{(C) }2\sqrt{17}\qquad\textbf{(D) }3\sqrt{7}\qquad \textbf{(E) }6\sqrt{2}$

Three acute triangles are inscribed in the same circle with their vertices being nine distinct points. Show that one can choose a vertex from each triangle so that the three chosen points determine a triangle each of whose angles is at most $90^\circ$.

Find the largest positive integer $n$ with the following property: there are rectangles $A_1, ... , A_n$ and $B_1,... , B_n,$ on the plane , each with sides parallel to the axis of the coordinate system, such that the rectangles $A_i$ and $B_i$ are disjoint for all $i \in \{1,..., n\}$, but the rectangles $A_i$ and $B_j$ have a common point for all $i, j \in \{1,..., n\}$, $i \ne j$. [i]Note: By points belonging to a rectangle we mean all points lying either in its interior, or on any of its sides, including its vertices [/i]

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]

Tanya and Serezha take turns putting chips in empty squares of a chessboard. Tanya starts with a chip in an arbitrary square. At every next move, Serezha must put a chip in the column where Tanya put her last chip, while Tanya must put a chip in the row where Serezha put his last chip. The player who cannot make a move loses. Which of the players has a winning strategy? [i]Proposed by A. Golovanov[/i]

The circles $S_{1}$ and $S_{2}$ intersect at $M$ and $N$.Show that if vertices $A$ and $C$ of a rectangle $ABCD$ lie on $S_{1}$ while vertices $B$ and $D$ lie on $S_{2}$,then the intersection of the diagonals of the rectangle lies on the line $MN$.

Holding a rectangular sheet of paper $ABCD$, Prair folds triangle $ABD$ over diagonal $BD$, so that the new location of point $A$ is $A'$. She notices that $A'C =\frac13 BD$. If the area of $ABCD$ is $27\sqrt2$, find $BD$.

A round table has radius $ 4$. Six rectangular place mats are placed on the table. Each place mat has width $ 1$ and length $ x$ as shown. They are positioned so that each mat has two corners on the edge of the table, these two corners being end points of the same side of length $ x$. Further, the mats are positioned so that the inner corners each touch an inner corner of an adjacent mat. What is $ x$? [asy]unitsize(4mm); defaultpen(linewidth(.8)+fontsize(8)); draw(Circle((0,0),4)); path mat=(-2.687,-1.5513)--(-2.687,1.5513)--(-3.687,1.5513)--(-3.687,-1.5513)--cycle; draw(mat); draw(rotate(60)*mat); draw(rotate(120)*mat); draw(rotate(180)*mat); draw(rotate(240)*mat); draw(rotate(300)*mat); label("$x$",(-2.687,0),E); label("$1$",(-3.187,1.5513),S);[/asy]$ \textbf{(A)}\ 2\sqrt {5} \minus{} \sqrt {3} \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ \frac {3\sqrt {7} \minus{} \sqrt {3}}{2} \qquad \textbf{(D)}\ 2\sqrt {3} \qquad \textbf{(E)}\ \frac {5 \plus{} 2\sqrt {3}}{2}$

A convex quadrilateral is determined by the points of intersection of the curves $x^4+y^4=100$ and $xy=4$; determine its area.

Let $ m,n$ be two natural nonzero numbers and sets $ A \equal{} \{ 1,2,...,n\}, B \equal{} \{1,2,...,m\}$. We say that subset $ S$ of Cartesian product $ A \times B$ has property $ (j)$ if $ (a \minus{} x)(b \minus{} y)\le 0$ for each pairs $ (a,b),(x,y) \in S$. Prove that every set $ S$ with propery $ (j)$ has at most $ m \plus{} n \minus{} 1$ elements. [color=#FF0000]The statement was edited, in order to reflect the actual problem asked. The sign of the inequality was inadvertently reversed into $ (a \minus{} x)(b \minus{} y)\ge 0$, and that accounts for the following two posts.[/color]

Let $n$ be a positive integer. Find the smallest positive integer $k$ such that for any set $S$ of $n$ points in the interior of the unit square, there exists a set of $k$ rectangles such that the following hold: [list=disc] [*]The sides of each rectangle are parallel to the sides of the unit square. [*]Each point in $S$ is [i]not[/i] in the interior of any rectangle. [*]Each point in the interior of the unit square but [i]not[/i] in $S$ is in the interior of at least one of the $k$ rectangles [/list] (The interior of a polygon does not contain its boundary.) [i]Holden Mui[/i]

A rectangle, with sides parallel to the $x-$axis and $y-$axis, has opposite vertices located at $(15, 3)$ and$(16, 5).$ A line is drawn through points $A(0, 0)$ and $B(3, 1).$ Another line is drawn through points $C(0, 10)$ and $D(2, 9).$ How many points on the rectangle lie on at least one of the two lines? [asy] size(9cm); draw((0,-.5)--(0,11),EndArrow(size=.15cm)); draw((1,0)--(1,11),mediumgray); draw((2,0)--(2,11),mediumgray); draw((3,0)--(3,11),mediumgray); draw((4,0)--(4,11),mediumgray); draw((5,0)--(5,11),mediumgray); draw((6,0)--(6,11),mediumgray); draw((7,0)--(7,11),mediumgray); draw((8,0)--(8,11),mediumgray); draw((9,0)--(9,11),mediumgray); draw((10,0)--(10,11),mediumgray); draw((11,0)--(11,11),mediumgray); draw((12,0)--(12,11),mediumgray); draw((13,0)--(13,11),mediumgray); draw((14,0)--(14,11),mediumgray); draw((15,0)--(15,11),mediumgray); draw((16,0)--(16,11),mediumgray); draw((-.5,0)--(17,0),EndArrow(size=.15cm)); draw((0,1)--(17,1),mediumgray); draw((0,2)--(17,2),mediumgray); draw((0,3)--(17,3),mediumgray); draw((0,4)--(17,4),mediumgray); draw((0,5)--(17,5),mediumgray); draw((0,6)--(17,6),mediumgray); draw((0,7)--(17,7),mediumgray); draw((0,8)--(17,8),mediumgray); draw((0,9)--(17,9),mediumgray); draw((0,10)--(17,10),mediumgray); draw((-.13,1)--(.13,1)); draw((-.13,2)--(.13,2)); draw((-.13,3)--(.13,3)); draw((-.13,4)--(.13,4)); draw((-.13,5)--(.13,5)); draw((-.13,6)--(.13,6)); draw((-.13,7)--(.13,7)); draw((-.13,8)--(.13,8)); draw((-.13,9)--(.13,9)); draw((-.13,10)--(.13,10)); draw((1,-.13)--(1,.13)); draw((2,-.13)--(2,.13)); draw((3,-.13)--(3,.13)); draw((4,-.13)--(4,.13)); draw((5,-.13)--(5,.13)); draw((6,-.13)--(6,.13)); draw((7,-.13)--(7,.13)); draw((8,-.13)--(8,.13)); draw((9,-.13)--(9,.13)); draw((10,-.13)--(10,.13)); draw((11,-.13)--(11,.13)); draw((12,-.13)--(12,.13)); draw((13,-.13)--(13,.13)); draw((14,-.13)--(14,.13)); draw((15,-.13)--(15,.13)); draw((16,-.13)--(16,.13)); label(scale(.7)*"$1$", (1,-.13), S); label(scale(.7)*"$2$", (2,-.13), S); label(scale(.7)*"$3$", (3,-.13), S); label(scale(.7)*"$4$", (4,-.13), S); label(scale(.7)*"$5$", (5,-.13), S); label(scale(.7)*"$6$", (6,-.13), S); label(scale(.7)*"$7$", (7,-.13), S); label(scale(.7)*"$8$", (8,-.13), S); label(scale(.7)*"$9$", (9,-.13), S); label(scale(.7)*"$10$", (10,-.13), S); label(scale(.7)*"$11$", (11,-.13), S); label(scale(.7)*"$12$", (12,-.13), S); label(scale(.7)*"$13$", (13,-.13), S); label(scale(.7)*"$14$", (14,-.13), S); label(scale(.7)*"$15$", (15,-.13), S); label(scale(.7)*"$16$", (16,-.13), S); label(scale(.7)*"$1$", (-.13,1), W); label(scale(.7)*"$2$", (-.13,2), W); label(scale(.7)*"$3$", (-.13,3), W); label(scale(.7)*"$4$", (-.13,4), W); label(scale(.7)*"$5$", (-.13,5), W); label(scale(.7)*"$6$", (-.13,6), W); label(scale(.7)*"$7$", (-.13,7), W); label(scale(.7)*"$8$", (-.13,8), W); label(scale(.7)*"$9$", (-.13,9), W); label(scale(.7)*"$10$", (-.13,10), W); dot((0,0)); label(scale(.65)*"$A$", (0,0), NE); dot((3,1)); label(scale(.65)*"$B$", (3,1), NE); dot((0,10)); label(scale(.65)*"$C$", (0,10), NE); dot((2,9)); label(scale(.65)*"$D$", (2,9), NE); draw((15,3)--(16,3)--(16,5)--(15,5)--cycle,linewidth(1.125)); dot((15,3)); dot((16,3)); dot((16,5)); dot((15,5)); [/asy] $\textbf{(A) } 0\qquad\textbf{(B) } 1\qquad\textbf{(C) } 2\qquad\textbf{(D) } 3\qquad\textbf{(E) } 4$

Does there exist a rectangle which can be dissected into $15$ congruent polygons which are not rectangles? Can a square be dissected into $15$ congruent polygons which are not rectangles?

Let $ ABC$ be an acute-angled triangle such that there exist points $ D,E,F$ on side $ BC,CA,AB$, respectively such that the inradii of triangle $ AEF,BDF,CDE$ are all equal to $ r_0$. If the inradii of triangle $ DEF$ and $ ABC$ are $ r$ and $ R$, respectively, prove that \[ r\plus{}r_0\equal{}R.\] [i]Soewono, Bandung[/i]

If $ABCD$ is a cyclic quadrilateral, then prove that the incenters of the triangles $ABC$, $BCD$, $CDA$, $DAB$ are the vertices of a rectangle.

A rectangular sheet of paper (white on one side and gray on the other) was folded three times, as shown in the figure: Rectangle $1$, which was white after the first fold, has $20$ cm more perimeter than rectangle $2$, which was white after the second fold, and this in turn has $16$ cm more perimeter than rectangle $3$, which was white after the third fold. Determine the area of the sheet. [img]https://cdn.artofproblemsolving.com/attachments/d/f/8e363b40654ad0d8e100eac38319ee3784a7a7.png[/img]

6. The baker has baked a rectangular pancake. He then cut it into $n^{2}$ rectangles by making $n-1$ horizontal and $n-1$ vertical cuts. Being rounded to the closest integer, the areas of resulting rectangles equal to all positive integers from 1 to $n^{2}$ in some order. For which maximal $n$ could this happen? (Half-integers are rounded upwards.) Georgy Karavaev

Let $ ABCD $ be a rectangle of area $ S $, and $ P $ be a point inside it. We denote by $ a, b, c, d $ the distances from $ P $ to the vertices $ A, B, C, D $ respectively. Prove that $ a ^ 2 + b ^ 2 + c ^ 2 + d ^ 2\ge 2S $. When there is equality?

Given $2009 \times 4018$ rectangular board. Frame is a rectangle $n \times n$ or $n \times(n + 2)$ for $ ( n \geq 3 )$ without all cells which don’t have any common points with boundary of rectangle. Rectangles $1\times1,1\times 2,1\times 3$ and $ 2\times 4$ are also frames. Two players by turn paint all cells of some frame that has no painted cells yet. Player that can't make such move loses. Who has a winning strategy?

Let $l$ denote the length of the smallest diagonal of all rectangles inscribed in a triangle $T$ . (By inscribed, we mean that all four vertices of the rectangle lie on the boundary of $T$ .) Determine the maximum value of $\frac{l^2}{S(T)}$ taken over all triangles ($S(T )$ denotes the area of triangle $T$ ).

Let $ABC$ be a triangle. Construct rectangles $BA_1A_2C$, $CB_1B_2A$, and $AC_1C_2B$ outside $ABC$ such that $\angle BCA_1=\angle CAB_1=\angle ABC_1$. Let $A_1B_2$ and $A_2C_1$ intersect at $A'$ and define $B',C'$ similarly. Prove that line $AA'$ bisects $B'C'$. [i]Linus Tang[/i]