On a $ 10 \times 10$ chessboard, some $ 4n$ unit squares are chosen to form a region $ \mathcal{R}.$ This region $ \mathcal{R}$ can be tiled by $ n$ $ 2 \times 2$ squares. This region $ \mathcal{R}$ can also be tiled by a combination of $ n$ pieces of the following types of shapes ([i]see below[/i], with rotations allowed). Determine the value of $ n.$

Find the volume $V$ of the solid formed by a rotation of the region enclosed by the curve $y=2^{x}-1$ and two lines $x=0,\ y=1$ around the $y$ axis.

A square plate has side length $L$ and negligible thickness. It is laid down horizontally on a table and is then rotating about the axis $\overline{MN}$ where $M$ and $N$ are the midpoints of two adjacent sides of the square. The moment of inertia of the plate about this axis is $kmL^2$, where $m$ is the mass of the plate and $k$ is a real constant. Find $k$. [color=red]Diagram will be added to this post very soon. If you want to look at it temporarily, see the PDF.[/color] [i]Problem proposed by Ahaan Rungta[/i]

Let $z$ be a complex number with $|z| = 2014$. Let $P$ be the polygon in the complex plane whose vertices are $z$ and every $w$ such that $\tfrac{1}{z+w} = \tfrac{1}{z} + \tfrac{1}{w}$. Then the area enclosed by $P$ can be written in the form $n\sqrt{3},$ where $n$ is an integer. Find the remainder when $n$ is divided by $1000$.

Let $M$ be a set of points in a plane with at least two elements. Prove that if $M$ has two axes of symmetry $g_1$ and $g_2$ intersecting at an angle $\alpha = q\pi$, where $q$ is irrational, then $M$ must be infinite.

Let $M$ and $N$ be two regular polygonic area.Define $K(M,N)$ as the midpoints of segments $[AB]$ such that $A$ belong to $M$ and $B$ belong to $N$. Find all situations of $M$ and $N$ such that $K(M,N)$ is a regualr polygonic area too.

Let $O$ and $A$ be two points in the plane with $OA = 30$, and let $\Gamma$ be a circle with center $O$ and radius $r$. Suppose that there exist two points $B$ and $C$ on $\Gamma$ with $\angle ABC = 90^{\circ}$ and $AB = BC$. Compute the minimum possible value of $\lfloor r \rfloor.$

The figure below shows a right triangle $ \triangle ABC$. [asy]unitsize(15); pair A = (0, 4); pair B = (0, 0); pair C = (4, 0); draw(A -- B -- C -- cycle); pair D = (2, 0); real p = 7 - 3sqrt(3); real q = 4sqrt(3) - 6; pair E = p + (4 - p)*I; pair F = q*I; draw(D -- E -- F -- cycle); label("$A$", A, N); label("$B$", B, S); label("$C$", C, S); label("$D$", D, S); label("$E$", E, NE); label("$F$", F, W);[/asy] The legs $ \overline{AB}$ and $ \overline{BC}$ each have length $ 4$. An equilateral triangle $ \triangle DEF$ is inscribed in $ \triangle ABC$ as shown. Point $ D$ is the midpoint of $ \overline{BC}$. What is the area of $ \triangle DEF$?

The distances from a point $ P$ inside an equilateral triangle to the vertices of the triangle are $ 3,4$, and $ 5$. Find the area of the triangle.

Squares $BAXX^{'}$ and $CAYY^{'}$ are drawn in the exterior of a triangle $ABC$ with $AB = AC$. Let $D$ be the midpoint of $BC$, and $E$ and $F$ be the feet of the perpendiculars from an arbitrary point $K$ on the segment $BC$ to $BY$ and $CX$, respectively. $(a)$ Prove that $DE = DF$ . $(b)$ Find the locus of the midpoint of $EF$ .

In the figure below, $\triangle ABC$ is an equilateral triangle. [asy] import graph; unitsize(60); axes("$x$", "$y$", (0, 0), (1.5, 1.5), EndArrow); real w = sqrt(3) - 1; pair A = (1, 1); pair B = (0, w); pair C = (w, 0); draw(A -- B -- C -- cycle); dot(Label("$A(1, 1)$", A, NE), A); dot(Label("$B$", B, W), B); dot(Label("$C$", C, S), C); [/asy] Point $A$ has coordinates $(1, 1)$, point $B$ is on the positive $y$-axis, and point $C$ is on the positive $x$-axis. What is the area of $\triangle ABC$?

In the figure, triangle $ADE$ is produced from triangle $ABC$ by a rotation by $90^o$ about the point $A$. If angle $D$ is $60^o$ and angle $E$ is $40^o$, how large is then angle $u$? [img]https://1.bp.blogspot.com/-6Fq2WUcP-IA/Xzb9G7-H8jI/AAAAAAAAMWY/hfMEAQIsfTYVTdpd1Hfx15QPxHmfDLEkgCLcBGAsYHQ/s0/2009%2BMohr%2Bp1.png[/img]

5. $A$ and $B$ play alternating turns on a $2012 \times 2013$ board with enough pieces of the following types: Type $1$: Piece like Type $2$ but with one square at the right of the bottom square. Type $2$: Piece of $2$ consecutive squares, one over another. Type $3$: Piece of $1$ square. At his turn, $A$ must put a piece of the type $1$ on available squares of the board. $B$, at his turn, must put exactly one piece of each type on available squares of the board. The player that cannot do more movements loses. If $A$ starts playing, decide who has a winning strategy. Note: The pieces can be rotated but cannot overlap; they cannot be out of the board. The pieces of the types $1$, $2$ and $3$ can be put on exactly $3$, $2$ and $1$ squares of the board respectively.

On the tetrahedron $ ABCD $ make the notation $ M,N,P,Q, $ for the midpoints of $ AB,CD,AC, $ respectively, $ BD. $ Additionally, we know that $ MN $ is the common perpendicular of $ AB,CD, $ and $ PQ $ is the common perpendicular of $ AC,BD. $ Show that $ AB=CD, BC=DA, AC=BD. $

Ten chairs are evenly spaced around a round table and numbered clockwise from $ 1$ through $ 10$. Five married couples are to sit in the chairs with men and women alternating, and no one is to sit either next to or directly across from his or her spouse. How many seating arrangements are possible? $ \textbf{(A)}\ 240\qquad \textbf{(B)}\ 360\qquad \textbf{(C)}\ 480\qquad \textbf{(D)}\ 540\qquad \textbf{(E)}\ 720$

Let $n$ be a natural number. Suppose $A$ and $B$ are two sets, each containing $n$ points in the plane, such that no three points of a set are collinear. Let $T(A)$ be the number of broken lines, each containing $n-1$ segments, and such that it doesn't intersect itself and its vertices are points of $A$. Define $T(B)$ similarly. If the points of $B$ are vertices of a convex $n$-gon (are in [i]convex position[/i]), but the points of $A$ are not, prove that $T(B)<T(A)$. [i]Proposed by Ali Khezeli[/i]

The vertices of a regular nonagon (9-sided polygon) are to be labeled with the digits $1$ through $9$ in such a way that the sum of the numbers on every three consecutive vertices is a multiple of $3$. Two acceptable arrangements are considered to be indistinguishable if one can be obtained from the other by rotating the nonagon in the plane. Find the number of distinguishable acceptable arrangements.

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$

Determine if there is a way to tile a $5 \times 6$ unit square board by dominos such that one can not use a needle to peer through the tiling? Determine if there is a way to tile a $5 \times 6$ unit square board by dominos such that one can use a needle to through the tiling? What if it is a $6 \times 6$ board?

Let $G$ be the centroid of $\triangle ABC.$ A rotation $120^\circ$ clockwise about $G$ takes $B$ and $C$ to $B_1$ and $C_1$ respectively. A rotation $120^\circ$ counterclockwise about $G$ takes $B$ and $C$ to $B_2$ and $C_2$ respectively. Prove $\triangle AB_1C_2$ and $\triangle AB_2C_1$ are equilateral. [i]Proposed by Evan Chang (squareman), USA [/i] [img]https://cdn.artofproblemsolving.com/attachments/3/b/46b4f09edcf17755df2dea3546881475db6eff.png[/img]

Consider the points $A(0,12)$, $B(10,9)$, $C(8,0)$, and $D(-4,7)$. There is a unique square $S$ such that each of the four points is on a different side of $S$. Let $K$ be the area of $S$. Find the remainder when $10K$ is divided by $1000$.

On a circle there are 2009 nonnegative integers not greater than 100. If two numbers sit next to each other, we can increase both of them by 1. We can do this at most $ k$ times. What is the minimum $ k$ so that we can make all the numbers on the circle equal?

Find the volume of the solid generated by a rotation of the region enclosed by the curve $y=x^3-x$ and the line $y=x$ about the line $y=x$ as the axis of rotation.

In a group of $n$ people, each one knows exactly three others. They are seated around a table. We say that the seating is $perfect$ if everyone knows the two sitting by their sides. Show that, if there is a perfect seating $S$ for the group, then there is always another perfect seating which cannot be obtained from $S$ by rotation or reflection.

Let $M$ be a centre of gravity (the intersection point of the medians) of a triangle $ABC$. Under rotation by $120$ degrees about the point $M$, the point $B$ is taken to the point $P$; under rotation by $240$ degrees about $M$, the point $C$ is taken to the point $Q$. Prove that either $APQ$ is an equilateral triangle, or the points $A, P, Q$ coincide. (Bykovsky, Khabarovsksk)