[b]U[/b]ndecillion years ago in a galaxy far, far away, there were four space stations in the three-dimensional space, each pair spaced 1 light year away from each other. Admiral Ackbar wanted to establish a base somewhere in space such that the sum of squares of the distances from the base to each of the stations does not exceed 15 square light years. (The sizes of the space stations and the base are negligible.) Determine the volume, in cubic light years, of the set of all possible locations for the Admiral’s base.

I have $8$ unit cubes of different colors, which I want to glue together into a $2\times 2\times 2$ cube. How many distinct $2\times 2\times 2$ cubes can I make? Rotations of the same cube are not considered distinct, but reflections are.

Given three lines $ a $, $ b $, $ c $ pairwise skew. Is it possible to construct a parallelepiped whose edges lie on the lines $ a $, $ b $, $ c $?

Is there a six-link broken line in space that passes through all the vertices of a given cube?

Each corner cube is removed from this $3\text{ cm}\times 3\text{ cm}\times 3\text{ cm}$ cube. The surface area of the remaining figure is [asy]draw((2.7,3.99)--(0,3)--(0,0)); draw((3.7,3.99)--(1,3)--(1,0)); draw((4.7,3.99)--(2,3)--(2,0)); draw((5.7,3.99)--(3,3)--(3,0)); draw((0,0)--(3,0)--(5.7,0.99)); draw((0,1)--(3,1)--(5.7,1.99)); draw((0,2)--(3,2)--(5.7,2.99)); draw((0,3)--(3,3)--(5.7,3.99)); draw((0,3)--(3,3)--(3,0)); draw((0.9,3.33)--(3.9,3.33)--(3.9,0.33)); draw((1.8,3.66)--(4.8,3.66)--(4.8,0.66)); draw((2.7,3.99)--(5.7,3.99)--(5.7,0.99)); [/asy] $\textbf{(A)}\ 19\text{ sq.cm} \qquad \textbf{(B)}\ 24\text{ sq.cm} \qquad \textbf{(C)}\ 30\text{ sq.cm} \qquad \textbf{(D)}\ 54\text{ sq.cm} \qquad \textbf{(E)}\ 72\text{ sq.cm}$

Let $P$ be a point inside a regular tetrahedron ABCD with edge length $1$. Show that $$d(P,AB)+d(P,AC)+d(P,AD)+d(P,BC)+d(P,BD)+d(P,CD) \ge \frac{3}{2} \sqrt2$$ , with equality only when $P$ is the centroid of $ABCD$. Here $d(P,XY)$ denotes the distance from point $P$ to line $XY$.

Faces of a cube $9\times 9\times 9$ are partitioned onto unit squares. The surface of a cube is pasted over by $243$ strips $2\times 1$ without overlapping. Prove that the number of bent strips is odd. [i]A. Poliansky[/i]

A regular octahedron has side length $ 1$. A plane parallel to two of its opposite faces cuts the octahedron into the two congruent solids. The polygon formed by the intersection of the plane and the octahedron has area $ \frac {a\sqrt {b}}{c}$, where $ a$, $ b$, and $ c$ are positive integers, $ a$ and $ c$ are relatively prime, and $ b$ is not divisible by the square of any prime. What is $ a \plus{} b \plus{} c$? $ \textbf{(A)}\ 10\qquad \textbf{(B)}\ 11\qquad \textbf{(C)}\ 12\qquad \textbf{(D)}\ 13\qquad \textbf{(E)}\ 14$

Into how many regions do $n$ great circles, no three of which meet at a point, divide a sphere?

A super ball rolling on the floor enters a half circular track (radius $R$). The ball rolls without slipping around the track and leaves (velocity $v$) traveling horizontally in the opposite direction. Afterwards, it bounces on the floor. How far (horizontally) from the end of the track will the ball bounce for the second time? The ball’s surface has a theoretically infinite coefficient of static friction. It is a perfect sphere of uniform density. All collisions with the ground are perfectly elastic and theoretically instantaneous. Variations could involve the initial velocity being given before the ball enters the track or state that the normal force between the ball and the track right before leaving is zero (centripetal acceleration). [i]Problem proposed by Brian Yue[/i]

Given a tetrahedron $ABCD$, in which $AB=CD= 13 , AC=BD=14$ and $AD=BC=15$. Show that the centers of the inscribed sphere and sphere around it coincide, and find the radii of these spheres.

Determine the remainder when $(x^4-1)(x^2-1)$ is divided by $1+x+x^2$.

Consider a tetrahedron$ A_1A_2A_3A_4$. A point $N$ is said to be a Servais point if its projections on the six edges of the tetrahedron lie in a plane $\alpha(N)$ (called Servais plane). Prove that if all the six points $Nij$ symmetric to a point $M$ with respect to the midpoints $Bij$ of the edges $A_iA_j$ are Servais points, then $M$ is contained in all Servais planes $\alpha(Nij )$

Two real numbers are selected independently at random from the interval [-20, 10]. What is the probability that the product of those numbers is greater than zero? $ \textbf{(A)}\ \frac{1}{9} \qquad \textbf{(B)}\ \frac{1}{3} \qquad \textbf{(C)}\ \frac{4}{9} \qquad \textbf{(D)}\ \frac{5}{9} \qquad \textbf{(E)}\ \frac{2}{3} $

The base of an inclined prism is a triangle $ABC$. The perpendicular projection of $B_1$, one of the top vertices, is the midpoint of $BC$. The dihedral angle between the lateral faces through $BC$ and $AB$ is $\alpha$, and the lateral edges of the prism make an angle $\beta$ with the base. If $r_1, r_2, r_3$ are exradii of a perpendicular section of the prism, assuming that in $ABC, \cos^2 A + \cos^2 B + \cos^2 C = 1, \angle A < \angle B < \angle C,$ and $BC = a$, calculate $r_1r_2 + r_1r_3 + r_2r_3.$

How many positive integers $ b$ have the property that $ \log_b729$ is a positive integer? $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 3 \qquad \textbf{(E)}\ 4$

Eight spheres of radius 1, one per octant, are each tangent to the coordinate planes. What is the radius of the smallest sphere, centered at the origin, that contains these eight spheres? $ \textbf{(A)}\ \sqrt 2\qquad \textbf{(B)}\ \sqrt 3\qquad \textbf{(C)}\ 1 \plus{} \sqrt 2\qquad \textbf{(D)}\ 1 \plus{} \sqrt 3\qquad \textbf{(E)}\ 3$

Five points $A, B, C, D$, and $E$ in three-dimensional Euclidean space have the property that $AB = BC = CD = DE = EA = 1$ and $\angle ABC = \angle BCD =\angle CDE = \angle DEA = 90^o$ . Find all possible $\cos(\angle EAB)$.

A cuboid of volume $V$ contains a convex polyhedron $M$. The orthogonal projection of $M$ onto each face of the cuboid covers the entire face. What is the smallest possible volume of polyhedron $M$?

Let $S_1$ and $S_2$ be two spheres with distinct radii that touch externally. The spheres lie inside a cone $C$, and each sphere touches the cone in a full circle. Inside the cone there are $n$ additional solid spheres arranged in a ring in such a way that each solid sphere touches the cone $C$, both of the spheres $S_1$ and $S_2$ externally, as well as the two neighboring solid spheres. What are the possible values of $n$? [i]Proposed by Iceland.[/i]

The diagram below shows four regular hexagons each with side length $1$ meter attached to the sides of a square. This figure is drawn onto a thin sheet of metal and cut out. The hexagons are then bent upward along the sides of the square so that $A_1$ meets $A_2$, $B_1$ meets $B_2$, $C_1$ meets $C_2$, and $D_1$ meets $D_2$. If the resulting dish is filled with water, the water will rise to the height of the corner where the $A_1$ and $A_2$ meet. there are relatively prime positive integers $m$ and $n$ so that the number of cubic meters of water the dish will hold is $\sqrt{\frac{m}{n}}$. Find $m+n$. [asy] /* File unicodetex not found. */ /* Geogebra to Asymptote conversion, documentation at artofproblemsolving.com/Wiki, go to User:Azjps/geogebra */ import graph; size(7cm); real labelscalefactor = 0.5; /* changes label-to-point distance */ pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ pen dotstyle = black; /* point style */ real xmin = -4.3, xmax = 14.52, ymin = -8.3, ymax = 6.3; /* image dimensions */ draw((0,1)--(0,0)--(1,0)--(1,1)--cycle); draw((1,1)--(1,0)--(1.87,-0.5)--(2.73,0)--(2.73,1)--(1.87,1.5)--cycle); draw((0,1)--(1,1)--(1.5,1.87)--(1,2.73)--(0,2.73)--(-0.5,1.87)--cycle); draw((0,0)--(1,0)--(1.5,-0.87)--(1,-1.73)--(0,-1.73)--(-0.5,-0.87)--cycle); draw((0,1)--(0,0)--(-0.87,-0.5)--(-1.73,0)--(-1.73,1)--(-0.87,1.5)--cycle); /* draw figures */ draw((0,1)--(0,0)); draw((0,0)--(1,0)); draw((1,0)--(1,1)); draw((1,1)--(0,1)); draw((1,1)--(1,0)); draw((1,0)--(1.87,-0.5)); draw((1.87,-0.5)--(2.73,0)); draw((2.73,0)--(2.73,1)); draw((2.73,1)--(1.87,1.5)); draw((1.87,1.5)--(1,1)); draw((0,1)--(1,1)); draw((1,1)--(1.5,1.87)); draw((1.5,1.87)--(1,2.73)); draw((1,2.73)--(0,2.73)); draw((0,2.73)--(-0.5,1.87)); draw((-0.5,1.87)--(0,1)); /* dots and labels */ dot((1.87,-0.5),dotstyle); label("$C_1$", (1.72,-0.1), NE * labelscalefactor); dot((1.87,1.5),dotstyle); label("$B_2$", (1.76,1.04), NE * labelscalefactor); dot((1.5,1.87),dotstyle); label("$B_1$", (0.96,1.8), NE * labelscalefactor); dot((-0.5,1.87),dotstyle); label("$A_2$", (-0.26,1.78), NE * labelscalefactor); dot((-0.87,1.5),dotstyle); label("$A_1$", (-0.96,1.08), NE * labelscalefactor); dot((-0.87,-0.5),dotstyle); label("$D_2$", (-1.02,-0.18), NE * labelscalefactor); dot((-0.5,-0.87),dotstyle); label("$D_1$", (-0.22,-0.96), NE * labelscalefactor); dot((1.5,-0.87),dotstyle); label("$C_2$", (0.9,-0.94), NE * labelscalefactor); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */ [/asy]

Find the greatest positive integer $n$ for which $n$ is divisible by all positive integers whose cube is not greater than $n.$

Consider cubes of edge length 5 composed of 125 cubes of edge length 1 where each of the 125 cubes is either coloured black or white. A cube of edge length 5 is called "big", a cube od edge length is called "small". A posititve integer $ n$ is called "representable" if there is a big cube with exactly $ n$ small cubes where each row of five small cubes has an even number of black cubes whose centres lie on a line with distances $ 1,2,3,4$ (zero counts as even number). (a) What is the smallest and biggest representable number? (b) Construct 45 representable numbers.

An ant walks on the interior surface of a cube, he moves on a straight line. If ant reaches to an edge the he moves on a straight line on cube's net. Also if he reaches to a vertex he will return his path. a) Prove that for each beginning point ant can has infinitely many choices for his direction that its path becomes periodic. b) Prove that if if the ant starts from point $A$ and its path is periodic, then for each point $B$ if ant starts with this direction, then his path becomes periodic.

Shaft section of a circular cone with vertex $P$ is an isosceles right triangle. $A$ is a point on the circle of the bottom surface, while $B$ is a point inside the circle, $O$ is the center of the circle. If $AB\perp OB$ at $B$, $OH\perp PB$ at $H$, $PA=4$, $C$ is the midpoint of $PA$, then when the volume of triangular pyramid $O-HPC$ takes its maximum value, the length of $OB$ is $\text{(A)}\frac{\sqrt5}{3}\qquad\text{(B)}\frac{2\sqrt5}{3}\qquad\text{(C)}\frac{\sqrt6}{3}\qquad\text{(D)}\frac{2\sqrt6}{3}\qquad$