Square $ABCD$ has side length $13$, and points $E$ and $F$ are exterior to the square such that $BE=DF=5$ and $AE=CF=12$. Find $EF^{2}$. [asy] size(200); defaultpen(fontsize(10)); real x=22.61986495; pair A=(0,26), B=(26,26), C=(26,0), D=origin, E=A+24*dir(x), F=C+24*dir(180+x); draw(B--C--F--D--C^^D--A--E--B--A, linewidth(0.7)); dot(A^^B^^C^^D^^E^^F); pair point=(13,13); 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));[/asy]

In the adjoining figure, two circles of radii 6 and 8 are drawn with their centers 12 units apart. At $P$, one of the points of intersection, a line is drawn in such a way that the chords $QP$ and $PR$ have equal length. Find the square of the length of $QP$. [asy]unitsize(2.5mm); defaultpen(linewidth(.8pt)+fontsize(12pt)); dotfactor=3; pair O1=(0,0), O2=(12,0); path C1=Circle(O1,8), C2=Circle(O2,6); pair P=intersectionpoints(C1,C2)[0]; path C3=Circle(P,sqrt(130)); pair Q=intersectionpoints(C3,C1)[0]; pair R=intersectionpoints(C3,C2)[1]; draw(C1); draw(C2); //draw(O2--O1); //dot(O1); //dot(O2); draw(Q--R); label("$Q$",Q,N); label("$P$",P,dir(80)); label("$R$",R,E); //label("12",waypoint(O1--O2,0.4),S);[/asy]

Decompose the space of homogeneous polynomials of degree $5$ in $(x, y, z)$ into irreducible subspaces invariant with respect to the rotation group $SO(3)$.

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 sequence $ (a_1,b_1)$, $ (a_2,b_2)$, $ (a_3,b_3)$, $ \ldots$ of points in the coordinate plane satisfies \[ (a_{n \plus{} 1}, b_{n \plus{} 1}) \equal{} (\sqrt {3}a_n \minus{} b_n, \sqrt {3}b_n \plus{} a_n)\hspace{3ex}\text{for}\hspace{3ex} n \equal{} 1,2,3,\ldots.\] Suppose that $ (a_{100},b_{100}) \equal{} (2,4)$. What is $ a_1 \plus{} b_1$? $ \textbf{(A)}\\minus{} \frac {1}{2^{97}} \qquad \textbf{(B)}\\minus{} \frac {1}{2^{99}} \qquad \textbf{(C)}\ 0 \qquad \textbf{(D)}\ \frac {1}{2^{98}} \qquad \textbf{(E)}\ \frac {1}{2^{96}}$

Let $AB$ and $CD$ be two diameters of the circle $C$. For an arbitrary point $P$ on $C$, let $R$ and $S$ be the feet of the perpendiculars from $P$ to $AB$ and $CD$, respectively. Show that the length of $RS$ is independent of the choice of $P$.

An $8\times 8$ chessboard is to be tiled (i.e., completely covered without overlapping) with pieces of the following shapes: [asy] unitsize(.6cm); draw(unitsquare,linewidth(1)); draw(shift(1,0)*unitsquare,linewidth(1)); draw(shift(2,0)*unitsquare,linewidth(1)); label("\footnotesize $1\times 3$ rectangle",(1.5,0),S); draw(shift(8,1)*unitsquare,linewidth(1)); draw(shift(9,1)*unitsquare,linewidth(1)); draw(shift(10,1)*unitsquare,linewidth(1)); draw(shift(9,0)*unitsquare,linewidth(1)); label("\footnotesize T-shaped tetromino",(9.5,0),S); [/asy] The $1\times 3$ rectangle covers exactly three squares of the chessboard, and the T-shaped tetromino covers exactly four squares of the chessboard. [list](a) What is the maximum number of pieces that can be used? (b) How many ways are there to tile the chessboard using this maximum number of pieces?[/list]

Let $(a,\ b)$ be a point on the curve $y=\frac{x}{1+x}\ (x\geq 0).$ Denote $U$ the volume of the figure enclosed by the curve , the $x$ axis and the line $x=a$, revolved around the the $x$ axis and denote $V$ the volume of the figure enclosed by the curve , the $y$ axis and th line $y=b$, revolved around the $y$ axis. What's the relation of $U$ and $V?$ 1978 Chuo university entrance exam/Science and Technology

Three hoops are arranged concentrically as in the diagram. Each hoop is threaded with $ 20$ beads, $ 10$ of which are black and $ 10$ are white. On each hoop the positions of the beads are labelled $ 1$ through $ 20$ as shown. We say there is a match at position $ i$ if all three beads at position $ i$ have the same color. We are free to slide beads around a hoop, not breaking the hoop. Show that it is always possible to move them into a configuration involving no less than $ 5$ matches.

Let $n$ be a positive integer. A 4-by-$n$ rectangle is divided into $4n$ unit squares in the usual way. Each unit square is colored black or white. Suppose that every white unit square shares an edge with at least one black unit square. Prove that there are at least $n$ black unit squares.

Let's call $1 \times 2$ rectangle, which can be a rotated, a domino. Prove that there exists polygon, who can be covered by dominoes in exactly $2021$ different ways.

The plot of the $y=f(x)$ function, being rotated by the (right) angle around the $(0,0)$ point is not changed. a) Prove that the equation $f(x)=x$ has the unique solution. b) Give an example of such a function.

Suppose a square of sidelengh $l$ is inside an unit square and does not contain its centre. Show that $l\le 1/2.$ [i]Marius Cavachi[/i]

Let $ \Delta ABC$ be a triangle, with $ m(\angle A)=90^{\circ}$ and $ m(\angle B)=30^{\circ}.$ If $M$ is the middle of $[AB],$ $N$ is the middle of $[BC],$ and $P\in[BC],\ Q\in[MN],$ such that \[\frac{PB}{PC}=4\cdot\frac{QM}{QN}+3,\] prove that $ \Delta APQ$ is an equilateral triangle. [b]Author: MARIN BANCOȘ[/b] [b]Regional Mathematical Contest GRIGORE MOISIL, Romania, Baia Mare, 24.03.2012, 7th grade[/b]

An equilateral triangle has inside it a point with distances 5,12,13 from the vertices . Find its side.

From a $n\times (n-1)$ rectangle divided into unit squares, we cut the [i]corner[/i], which consists of the first row and the first column. (that is, the corner has $2n-2$ unit squares). For the following, when we say [i]corner[/i] we reffer to the above definition, along with rotations and symmetry. Consider an infinite lattice of unit squares. We will color the squares with $k$ colors, such that for any corner, the squares in that corner are coloured differently (that means that there are no squares coloured with the same colour). Find out the minimum of $k$. [i]Proposed by S. Berlov[/i]

If circular arcs $ AC$ and $ BC$ have centers at $ B$ and $ A$, respectively, then there exists a circle tangent to both $ \stackrel{\frown}{AC}$ and $ \stackrel{\frown}{BC}$, and to $ \overline{AB}$. If the length of $ \stackrel{\frown}{BC}$ is $ 12$, then the circumference of the circle is [asy]unitsize(4cm); defaultpen(fontsize(8pt)+linewidth(.8pt)); dotfactor=3; pair O=(0,.375); pair A=(-.5,0); pair B=(.5,0); pair C=shift(-.5,0)*dir(60); draw(Arc(A,1,0,60)); draw(Arc(B,1,120,180)); draw(A--B); draw(Circle(O,.375)); dot(A); dot(B); dot(C); label("$A$",A,SW); label("$B$",B,SE); label("$C$",C,N);[/asy]$ \textbf{(A)}\ 24 \qquad \textbf{(B)}\ 25 \qquad \textbf{(C)}\ 26 \qquad \textbf{(D)}\ 27 \qquad \textbf{(E)}\ 28$

For positive integer $n$, define $S_n$ to be the minimum value of the sum \[ \sum_{k=1}^n \sqrt{(2k-1)^2+a_k^2}, \] where $a_1,a_2,\ldots,a_n$ are positive real numbers whose sum is 17. There is a unique positive integer $n$ for which $S_n$ is also an integer. Find this $n$.

A plane contains points $ A$ and $ B$ with $ AB \equal{} 1$. Let $ S$ be the union of all disks of radius $ 1$ in the plane that cover $ \overline{AB}$. What is the area of $ S$? $ \textbf{(A)}\ 2\pi \plus{} \sqrt3 \qquad \textbf{(B)}\ \frac {8\pi}{3} \qquad \textbf{(C)}\ 3\pi \minus{} \frac {\sqrt3}{2} \qquad \textbf{(D)}\ \frac {10\pi}{3} \minus{} \sqrt3 \qquad \textbf{(E)}\ 4\pi \minus{} 2\sqrt3$

Let $P_0$, $P_1$, $P_2$ be three points on the circumference of a circle with radius $1$, where $P_1P_2 = t < 2$. For each $i \ge 3$, define $P_i$ to be the centre of the circumcircle of $\triangle P_{i-1} P_{i-2} P_{i-3}$. (1) Prove that the points $P_1, P_5, P_9, P_{13},\cdots$ are collinear. (2) Let $x$ be the distance from $P_1$ to $P_{1001}$, and let $y$ be the distance from $P_{1001}$ to $P_{2001}$. Determine all values of $t$ for which $\sqrt[500]{ \frac xy}$ is an integer.

Chitoge is painting a cube; she can paint each face either black or white, but she wants no vertex of the cube to be touching three faces of the same color. In how many ways can Chitoge paint the cube? Two paintings of a cube are considered to be the same if you can rotate one cube so that it looks like the other cube.

Given a triangle $OAB$ with the vetices $O(0,\ 0,\ 0),\ A(1,\ 0,\ 0),\ B(1,\ 1,\ 0)$ in the $xyz$ space. Let $V$ be the cone obtained by rotating the triangle around the $x$-axis. Find the volume of the solid obtained by rotating the cone $V$ around the $y$-axis.

The integers from $1$ to $9$ can be arranged into a $3\times3$ array (as shown on the right) so that the sum of the numbers in every row, column, and diago­nal is a multiple of $9$. (a.) Prove that the number in the center of the array must be a multiple of $3$. (b.) Give an example of such an array with $6$ in the center. [asy] defaultpen(linewidth(0.7)+fontsize(10));size(100); int i,j; for(i=0; i<4; i=i+1) { draw((0,2i)--(6,2i)); draw((2i,0)--(2i,6)); } string[] letters={"G", "H", "I", "D", "E", "F", "A", "B", "C"}; for(i=0; i<3; i=i+1) { for(j=0; j<3; j=j+1) { label(letters[3i+j], (2j+1, 2i+1)); }}[/asy]

Given a convex polygon M invariant under a $90^\circ$ rotation, show that there exist two circles, the ratio of whose radii is $\sqrt2$, one containing M and the other contained in M. [i]A. Khrabrov[/i]

A rectangle that is inscribed in a larger rectangle (with one vertex on each side) is called [i]unstuck[/i] if it is possible to rotate (however slightly) the smaller rectangle about its center within the confines of the larger. Of all the rectangles that can be inscribed unstuck in a 6 by 8 rectangle, the smallest perimeter has the form $\sqrt{N}$, for a positive integer $N$. Find $N$.