A unit square $ABCD$ with centre $O$ is rotated about $O$ by an angle $\alpha$. Compute the common area of the two squares.

A sequence of vertices $v_1,v_2,\ldots,v_k$ in a graph, where $v_i=v_j$ only if $i=j$ and $k$ can be any positive integer, is called a $\textit{cycle}$ if $v_1$ is attached by an edge to $v_2$, $v_2$ to $v_3$, and so on to $v_k$ connected to $v_1$. Rotations and reflections are distinct: $A,B,C$ is distinct from $A,C,B$ and $B,C,A$. Supposed a simple graph $G$ has $2013$ vertices and $3013$ edges. What is the minimal number of cycles possible in $G$?

Let $ (x,y)$ be a pair of real numbers satisfying \[ 56x \plus{} 33y \equal{} \frac{\minus{}y}{x^2\plus{}y^2}, \qquad \text{and} \qquad 33x\minus{}56y \equal{} \frac{x}{x^2\plus{}y^2}. \]Determine the value of $ |x| \plus{} |y|$.

A spherical shell of mass $M$ and radius $R$ is completely filled with a frictionless fluid, also of mass M. It is released from rest, and then it rolls without slipping down an incline that makes an angle $\theta$ with the horizontal. What will be the acceleration of the shell down the incline just after it is released? Assume the acceleration of free fall is $g$. The moment of inertia of a thin shell of radius $r$ and mass $m$ about the center of mass is $I = \frac{2}{3}mr^2$; the momentof inertia of a solid sphere of radius r and mass m about the center of mass is $I = \frac{2}{5}mr^2$. $\textbf{(A) } g \sin \theta \\ \textbf{(B) } \frac{3}{4} g \sin \theta\\ \textbf{(C) } \frac{1}{2} g \sin \theta\\ \textbf{(D) } \frac{3}{8} g \sin \theta\\ \textbf{(E) } \frac{3}{5} g \sin \theta$

A $2$-by-$2018$ grid is completely covered by non-overlapping L-tiles (see diagram below) and $1$-by-$1$ squares. If the L-tiles can be rotated and flipped, there are a total of $M$ such tilings. [asy] size(1cm); draw((0,0)--(2,0)--(2,1)--(1,1)--(1,2)--(0,2)--cycle); draw((0,1)--(1,1)--(1,0)); [/asy] What is $\ln M?$ Give your answer as an integer or decimal. If your answer is $A$ and the correct answer is $C$, then your score will be $\max\{\lfloor7.5-\tfrac{|A-C|^{1.5}}{20}\rfloor,0\}.$

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]

Hexagon $ABCDEF$ is divided into four rhombuses, $\mathcal{P, Q, R, S,}$ and $\mathcal{T,}$ as shown. Rhombuses $\mathcal{P, Q, R,}$ and $\mathcal{S}$ are congruent, and each has area $\sqrt{2006}$. Let $K$ be the area of rhombus $\mathcal{T}$. Given that $K$ is a positive integer, find the number of possible values for $K$. [asy] size(150);defaultpen(linewidth(0.7)+fontsize(10)); draw(rotate(45)*polygon(4)); pair F=(1+sqrt(2))*dir(180), C=(1+sqrt(2))*dir(0), A=F+sqrt(2)*dir(45), E=F+sqrt(2)*dir(-45), B=C+sqrt(2)*dir(180-45), D=C+sqrt(2)*dir(45-180); draw(F--(-1,0)^^C--(1,0)^^A--B--C--D--E--F--cycle); pair point=origin; 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("$\mathcal{P}$", intersectionpoint( A--(-1,0), F--(0,1) )); label("$\mathcal{S}$", intersectionpoint( E--(-1,0), F--(0,-1) )); label("$\mathcal{R}$", intersectionpoint( D--(1,0), C--(0,-1) )); label("$\mathcal{Q}$", intersectionpoint( B--(1,0), C--(0,1) )); label("$\mathcal{T}$", point); dot(A^^B^^C^^D^^E^^F);[/asy]

Three points are chosen randomly and independently on a circle. What is the probability that all three pairwise distances between the points are less than the radius of the circle? $ \textbf{(A)}\ \frac{1}{36} \qquad \textbf{(B)}\ \frac{1}{24} \qquad \textbf{(C)}\ \frac{1}{18} \qquad \textbf{(D)}\ \frac{1}{12} \qquad \textbf{(E)}\ \frac{1}{9}$

Consider an $n$-by-$n$ board of unit squares for some odd positive integer $n$. We say that a collection $C$ of identical dominoes is a [i]maximal grid-aligned configuration[/i] on the board if $C$ consists of $(n^2-1)/2$ dominoes where each domino covers exactly two neighboring squares and the dominoes don't overlap: $C$ then covers all but one square on the board. We are allowed to slide (but not rotate) a domino on the board to cover the uncovered square, resulting in a new maximal grid-aligned configuration with another square uncovered. Let $k(C)$ be the number of distinct maximal grid-aligned configurations obtainable from $C$ by repeatedly sliding dominoes. Find the maximum value of $k(C)$ as a function of $n$. [i]Proposed by Holden Mui[/i]

How many different ways are there to paint the sides of a tetrahedron with exactly $4$ colors? Each side gets its own color, and two colorings are the same if one can be rotated to get the other.

Given a point $P_0$ in the plane of the triangle $A_1A_2A_3$. Define $A_s=A_{s-3}$ for all $s\ge4$. Construct a set of points $P_1,P_2,P_3,\ldots$ such that $P_{k+1}$ is the image of $P_k$ under a rotation center $A_{k+1}$ through an angle $120^o$ clockwise for $k=0,1,2,\ldots$. Prove that if $P_{1986}=P_0$, then the triangle $A_1A_2A_3$ is equilateral.

A regular $17$-gon with vertices $V_1, V_2, . . . , V_{17}$ and sides of length $3$ has a point $ P$ on $V_1V_2$ such that $V_1P = 1$. A chord that stretches from $V_1$ to $V_2$ containing $ P$ is rotated within the interior of the heptadecagon around $V_2$ such that the chord now stretches from $V_2$ to $V_3$. The chord then hinges around $V_3$, then $V_4$, and so on, continuing until $ P$ is back at its original position. Find the total length traced by $ P$.

Given is an ellipse $ e$ in the plane. Find the locus of all points $ P$ in space such that the cone of apex $ P$ and directrix $ e$ is a right circular cone.

Taotao wants to buy a bracelet. The bracelets have 7 different beads on them, arranged in a circle. Two bracelets are the same if one can be rotated or flipped to get the other. If she can choose the colors and placement of the beads, and the beads come in orange, white, and black, how many possible bracelets can she buy?

Two strips of width 1 overlap at an angle of $\alpha$ as shown. The area of the overlap (shown shaded) is [asy] pair a = (0,0),b= (6,0),c=(0,1),d=(6,1); transform t = rotate(-45,(3,.5)); pair e = t*a,f=t*b,g=t*c,h=t*d; pair i = intersectionpoint(a--b,e--f),j=intersectionpoint(a--b,g--h),k=intersectionpoint(c--d,e--f),l=intersectionpoint(c--d,g--h); draw(a--b^^c--d^^e--f^^g--h); filldraw(i--j--l--k--cycle,blue); label("$\alpha$",i+(-.5,.2)); //commented out labeling because it doesn't look right. //path lbl1 = (a+(.5,.2))--(c+(.5,-.2)); //draw(lbl1); //label("$1$",lbl1);[/asy] $\text{(A)} \ \sin \alpha \qquad \text{(B)} \ \frac{1}{\sin \alpha} \qquad \text{(C)} \ \frac{1}{1 - \cos \alpha} \qquad \text{(D)} \ \frac{1}{\sin^2 \alpha} \qquad \text{(E)} \ \frac{1}{(1 - \cos \alpha)^2}$

Is it true that any two rectangles of equal area can be placed in the plane such that any horizontal line intersecting at least one of them will also intersect the other, and the segments of intersection will be equal?

Let $a, b, c$ be nonzero real numbers for which there exist $\alpha, \beta, \gamma \in\{-1, 1\}$ with $\alpha a + \beta b + \gamma c = 0$. What is the smallest possible value of \[\left( \frac{a^3+b^3+c^3}{abc}\right)^2 ?\]

The points $(0,0),$ $(a,11)$, and $(b,37)$ are the vertices of an equilateral triangle. Find the value of $ab$.

When real numbers $x,\ y$ moves in the constraint with $x^2+xy+y^2=6.$ Find the range of $x^2y+xy^2-x^2-2xy-y^2+x+y.$ 30 points

If the rotational inertia of a sphere about an axis through the center of the sphere is $I$, what is the rotational inertia of another sphere that has the same density, but has twice the radius? $ \textbf{(A)}\ 2I \qquad\textbf{(B)}\ 4I \qquad\textbf{(C)}\ 8I\qquad\textbf{(D)}\ 16I\qquad\textbf{(E)}\ 32I $

Let $k$ be a positive integer. Two players $A$ and $B$ play a game on an infinite grid of regular hexagons. Initially all the grid cells are empty. Then the players alternately take turns with $A$ moving first. In his move, $A$ may choose two adjacent hexagons in the grid which are empty and place a counter in both of them. In his move, $B$ may choose any counter on the board and remove it. If at any time there are $k$ consecutive grid cells in a line all of which contain a counter, $A$ wins. Find the minimum value of $k$ for which $A$ cannot win in a finite number of moves, or prove that no such minimum value exists.

Consider two curves $y=\sin x,\ y=\sin 2x$ in $0\leq x\leq 2\pi$. (1) Let $(\alpha ,\ \beta)\ (0<\alpha <\pi)$ be the intersection point of the curves. If $\sin x-\sin 2x$ has a local minimum at $x=x_1$ and a local maximum at $x=x_2$, then find the values of $\cos x_1,\ \cos x_1\cos x_2$. (2) Find the area enclosed by the curves, then find the volume of the part generated by a rotation of the part of $\alpha \leq x\leq \pi$ for the figure about the line $y=-1$. [i]2011 Kyorin　University entrance exam/Medicine [/i]

Let $N$ be a positive integer. A collection of $4N^2$ unit tiles with two segments drawn on them as shown is assembled into a $2N\times2N$ board. Tiles can be rotated. [asy]size(1.5cm);draw((0,0)--(1,0)--(1,1)--(0,1)--cycle);draw((0,0.5)--(0.5,0),red);draw((0.5,1)--(1,0.5),red);[/asy] The segments on the tiles define paths on the board. Determine the least possible number and the largest possible number of such paths. [i]For example, there are $9$ paths on the $4\times4$ board shown below.[/i] [asy]size(4cm);draw((0,0)--(4,0)--(4,4)--(0,4)--cycle);draw((0,1)--(4,1));draw((0,2)--(4,2));draw((0,3)--(4,3));draw((1,0)--(1,4));draw((2,0)--(2,4));draw((3,0)--(3,4));draw((0,3.5)--(0.5,4),red);draw((0,2.5)--(1.5,4),red);draw((3.5,0)--(4,0.5),red);draw((2.5,0)--(4,1.5),red);draw((0.5,0)--(0,0.5),red);draw((2.5,4)--(3,3.5)--(3.5,4),red);draw((4,3.5)--(3.5,3)--(4,2.5),red);draw((0,1.5)--(1,2.5)--(1.5,2)--(0.5,1)--(1.5,0),red);draw((1.5,3)--(2,3.5)--(3.5,2)--(2,0.5)--(1.5,1)--(2.5,2)--cycle,red);[/asy]

For a given positive integer $n >2$, let $C_{1},C_{2},C_{3}$ be the boundaries of three convex $n-$ gons in the plane , such that $C_{1}\cap C_{2}, C_{2}\cap C_{3},C_{1}\cap C_{3}$ are finite. Find the maximum number of points of the sets $C_{1}\cap C_{2}\cap C_{3}$.

Lengths of two sides of a rectangle are $\sqrt2,1$. The rectangle rotates a round around one of its diagonal. Find the volume of the revolved body.