Three numbers, $a_1$, $a_2$, $a_3$, are drawn randomly and without replacement from the set $\{1, 2, 3, \dots, 1000\}$. Three other numbers, $b_1$, $b_2$, $b_3$, are then drawn randomly and without replacement from the remaining set of 997 numbers. Let $p$ be the probability that, after a suitable rotation, a brick of dimensions $a_1 \times a_2 \times a_3$ can be enclosed in a box of dimensions $b_1 \times b_2 \times b_3$, with the sides of the brick parallel to the sides of the box. If $p$ is written as a fraction in lowest terms, what is the sum of the numerator and denominator?

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}$.

Players $ A,B$ alternately move a knight on a $ 1994\times 1994$ chessboard. Player $ A$ makes only horizontal moves, i.e. such that the knight is moved to a neighboring row, while $ B$ makes only vertical moves. Initally player $ A$ places the knight to an arbitrary square and makes the first move. The knight cannot be moved to a square that was already visited during the game. A player who cannot make a move loses. Prove that player $ A$ has a winning strategy.

On a plane, given a square $D$ with side length 1 and a line which intersects with $D$. For the solid obtained by a rotation of $D$ about the line as the axis, answer the following questions: (1) Suppose that the line $l$ on a plane the same with $D$ isn't parallel to any edges. Prove that the line by which the volume of the solid is maximized has only intersection point with $D$. Note that the line as axis of rotation is parallel to $l$. (2) Find the possible maximum volume for which all solid formed by the rotation axis as line intersecting with $D$. [i]2011 Tokyo Institute of Technology entrance exam, Problem 4[/i]

Consider the following transformation of the Cartesian plane: choose a lattice point and rotate the plane $90^\circ$ counterclockwise about that lattice point. Is it possible, through a sequence of such transformations, to take the triangle with vertices $(0,0)$, $(1,0)$ and $(0,1)$ to the triangle with vertices $(0,0)$, $(1,0)$ and $(1,1)$?

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

Let $A,B$ be adjacent vertices of a regular $n$-gon ($n\ge5$) with center $O$. A triangle $XYZ$, which is congruent to and initially coincides with $OAB$, moves in the plane in such a way that $Y$ and $Z$ each trace out the whole boundary of the polygon, with $X$ remaining inside the polygon. Find the locus of $X$.

Triangle $AOB$ is rotated in plane around point $O$ for $90^{\circ}$ and it maps in triangle $A_1OB_1$ ($A$ maps to $A_1$, $B$ maps to $B_1$). Prove that median of triangle $OAB_1$ of side $AB_1$ is orthogonal to $A_1B$

By composing a symmetry of axis $r$ with a right angle rotation around from a point $P$ that does not belong to the line, another movement $M$ results. Is $M$ an axis symmetry? Is there any line invariant through $M$?

Six ants simultaneously stand on the six vertices of a regular octahedron, with each ant at a different vertex. Simultaneously and independently, each ant moves from its vertex to one of the four adjacent vertices, each with equal probability. What is the probability that no two ants arrive at the same vertex? $ \textbf{(A)}\ \frac {5}{256} \qquad \textbf{(B)}\ \frac {21}{1024} \qquad \textbf{(C)}\ \frac {11}{512} \qquad \textbf{(D)}\ \frac {23}{1024} \qquad \textbf{(E)}\ \frac {3}{128}$

Riders on a Ferris wheel travel in a circle in a vertical plane. A particular wheel has radius $ 20$ feet and revolves at the constant rate of one revolution per minute. How many seconds does it take a rider to travel from the bottom of the wheel to a point $ 10$ vertical feet above the bottom? $ \textbf{(A)}\ 5 \qquad \textbf{(B)}\ 6 \qquad \textbf{(C)}\ 7.5 \qquad \textbf{(D)}\ 10 \qquad \textbf{(E)}\ 15$

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?

Two perpendicular lines pass through the orthocenter of an acute-angled triangle. The sidelines of the triangle cut on each of these lines two segments: one lying inside the triangle and another one lying outside it. Prove that the product of two internal segments is equal to the product of two external segments. [i]Nikolai Beluhov and Emil Kolev[/i]

Two circles $O_1$ and $O_2$ intersect each other at $M$ and $N$. The common tangent to two circles nearer to $M$ touch $O_1$ and $O_2$ at $A$ and $B$ respectively. Let $C$ and $D$ be the reflection of $A$ and $B$ respectively with respect to $M$. The circumcircle of the triangle $DCM$ intersect circles $O_1$ and $O_2$ respectively at points $E$ and $F$ (both distinct from $M$). Show that the circumcircles of triangles $MEF$ and $NEF$ have same radius length.

Given a regular $ 2n$-gon, show that each of its sides and diagonals can be assigned in such a way that the sum of the obtained vectors equals zero.

Sam colors each tile in a 4 by 4 grid white or black. A coloring is called [i]rotationally symmetric[/i] if the grid can be rotated 90, 180, or 270 degrees to achieve the same pattern. Two colorings are called [i]rotationally distinct[/i] if neither can be rotated to match the other. How many rotationally distinct ways are there for Sam to color the grid such that the colorings are [i]not[/i] rotationally symmetric? [i]Proposed by Gabriel Wu[/i]

Let $f(x)=\lim_{n\to\infty} (\cos ^ n x+\sin ^ n x)^{\frac{1}{n}}$ for $0\leq x\leq \frac{\pi}{2}.$ (1) Find $f(x).$ (2) Find the volume of the solid generated by a rotation of the figure bounded by the curve $y=f(x)$ and the line $y=1$ around the $y$-axis.

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.

Eight all different sushis are placed evenly on the edge of a round table, whose surface can rotate around the center. Eight people also evenly sit around the table, each with one sushi in front. Each person has one favorite sushi among these eight, and they are all distinct. They find that no matter how they rotate the table, there are never more than three people who have their favorite sushis in front of them simultaneously. By this requirement, how many different possible arrangements of the eight sushis are there? Two arrangements that differ by a rotation are considered the same.

Three wooden equilateral triangles of side length $18$ inches are placed on axles as shown in the diagram to the right. Each axle is $30$ inches from the other two axles. A $144$-inch leather band is wrapped around the wooden triangles, and a dot at the top corner is painted as shown. The three triangles are then rotated at the same speed and the band rotates without slipping or stretching. Compute the length of the path that the dot travels before it returns to its initial position at the top corner. [asy] size(150); defaultpen(linewidth(0.8)+fontsize(10)); pair A=origin,B=(48,0),C=rotate(60,A)*B; path equi=(0,0)--(18,0)--(9,9*sqrt(3))--cycle,circ=circle(centroid(A,B,C)*18/48,1/3); picture a; fill(a,equi,grey); fill(a,circ,white); add(a); add(shift(15,15*sqrt(3))*a); add(shift(30,0)*a); draw(A--B--C--cycle,linewidth(1)); path top = circle(C,2/3); unfill(top); draw(top); real r=-5/2; draw((9,r+1)--(9,r-1)^^(9,r)--(39,r)^^(39,r-1)--(39,r+1)); label("$30$",(24,r),S); [/asy]

Consider a point $O$ in the plane. Find all sets $S$ of at least two points in the plane such that if $A\in S$ ad $A\neq O$, then the circle with diameter $OA$ is in $S$. [i]Nikolai Nikolov, Slavomir Dinev[/i]

Each grid point of a cartesian plane is colored with one of three colors, whereby all three colors are used. Show that one can always find a right-angled triangle, whose three vertices have pairwise different colors.

Let $E$ be a point outside the square $ABCD$ such that $m(\widehat{BEC})=90^{\circ}$, $F\in [CE]$, $[AF]\perp [CE]$, $|AB|=25$, and $|BE|=7$. What is $|AF|$? $ \textbf{(A)}\ 29 \qquad\textbf{(B)}\ 30 \qquad\textbf{(C)}\ 31 \qquad\textbf{(D)}\ 32 \qquad\textbf{(E)}\ 33 $

The number $0$ or $1$ is to be assigned to each of the $n$ vertices of a regular polygon. In how many different ways can this be done (if we consider two assignments that can be obtained one from the other through rotation in the plane of the polygon to be identical)?

Isosceles $ \triangle ABC$ has a right angle at $ C$. Point $ P$ is inside $ \triangle ABC$, such that $ PA \equal{} 11, PB \equal{} 7,$ and $ PC \equal{} 6$. Legs $ \overline{AC}$ and $ \overline{BC}$ have length $ s \equal{} \sqrt {a \plus{} b\sqrt {2}}$, where $ a$ and $ b$ are positive integers. What is $ a \plus{} b$? [asy]pointpen = black; pathpen = linewidth(0.7); pen f = fontsize(10); size(5cm); pair B = (0,sqrt(85+42*sqrt(2))); pair A = (B.y,0); pair C = (0,0); pair P = IP(arc(B,7,180,360),arc(C,6,0,90)); D(A--B--C--cycle); D(P--A); D(P--B); D(P--C); MP("A",D(A),plain.E,f); MP("B",D(B),plain.N,f); MP("C",D(C),plain.SW,f); MP("P",D(P),plain.NE,f);[/asy] $ \textbf{(A) } 85 \qquad \textbf{(B) } 91 \qquad \textbf{(C) } 108 \qquad \textbf{(D) } 121 \qquad \textbf{(E) } 127$