If $\log_{2x}216 = x$, where $x$ is real, then $x$ is: $ \textbf{(A)}\ \text{A non-square, non-cube integer} \qquad$ $\textbf{(B)}\ \text{A non-square, non-cube, non-integral rational number} \qquad$ $\textbf{(C)}\ \text{An irrational number} \qquad$ $\textbf{(D)}\ \text{A perfect square}\qquad$ $\textbf{(E)}\ \text{A perfect cube} $

We consider a point $P$ in a plane $p$ and a point $Q \not\in p$. Determine all the points $R$ from $p$ for which \[ \frac{QP+PR}{QR} \] is maximum.

Which of the cones listed below can be formed from a $ 252^\circ$ sector of a circle of radius $ 10$ by aligning the two straight sides? [asy]import graph;unitsize(1.5cm);defaultpen(fontsize(8pt));draw(Arc((0,0),1,-72,180),linewidth(.8pt));draw(dir(288)--(0,0)--(-1,0),linewidth(.8pt));label("$10$",(-0.5,0),S);draw(Arc((0,0),0.1,-72,180));label("$252^{\circ}$",(0.05,0.05),NE);[/asy] [asy] import three; picture mainframe; defaultpen(fontsize(11pt)); picture conePic(picture pic, real r, real h, real sh) { size(pic, 3cm); triple eye = (11, 0, 5); currentprojection = perspective(eye); real R = 1, y = 2; triple center = (0, 0, 0); triple radPt = (0, R, 0); triple negRadPt = (0, -R, 0); triple heightPt = (0, 0, y); draw(pic, arc(center, radPt, negRadPt, heightPt, CW)); draw(pic, arc(center, radPt, negRadPt, heightPt, CCW), linetype("8 8")); draw(pic, center--radPt, linetype("8 8")); draw(pic, center--heightPt, linetype("8 8")); draw(pic, negRadPt--heightPt--radPt); label(pic, (string) r, center--radPt, dir(270)); if (h != 0) { label(pic, (string) h, heightPt--center, dir(0)); } if (sh != 0) { label(pic, (string) sh, heightPt--radPt, dir(0)); } return pic; } picture pic1; pic1 = conePic(pic1, 6, 0, 10); picture pic2; pic2 = conePic(pic2, 6, 10, 0); picture pic3; pic3 = conePic(pic3, 7, 0, 10); picture pic4; pic4 = conePic(pic4, 7, 10, 0); picture pic5; pic5 = conePic(pic5, 8, 0, 10); picture aux1; picture aux2; picture aux3; add(aux1, pic1.fit(), (0,0), W); label(aux1, "$\textbf{(A)}$", (0,0), 22W, linewidth(4)); label(aux1, "$\textbf{(B)}$", (0,0), 3E); add(aux1, pic2.fit(), (0,0), 35E); add(aux2, aux1.fit(), (0,0), W); label(aux2, "$\textbf{(C)}$", (0,0), 3E); add(aux2, pic3.fit(), (0,0), 35E); add(aux3, aux2.fit(), (0,0), W); label(aux3, "$\textbf{(D)}$", (0,0), 3E); add(aux3, pic4.fit(), (0,0), 35E); add(mainframe, aux3.fit(), (0,0), W); label(mainframe, "$\textbf{(E)}$", (0,0), 3E); add(mainframe, pic5.fit(), (0,0), 35E); add(mainframe.fit(), (0,0), N); [/asy]

$AB$ and $CD$ are two fixed parallel chords of the circle $S$. $M$ is a variable point on the circle. $Q$ is the intersection of the lines $MD$ and $AB$. $X$ is the circumcenter of the triangle $MCQ$. Find the locus of $X$. What happens to $X$ as $M$ tends to (1) $D$, (2) $C$? Find a point $E$ outside the plane of $S$ such that the circumcenter of the tetrahedron $MCQE$ has the same locus as $X$.

A collection of 8 cubes consists of one cube with edge-length $k$ for each integer $k,\thinspace 1 \le k \le 8.$ A tower is to be built using all 8 cubes according to the rules: $\bullet$ Any cube may be the bottom cube in the tower. $\bullet$ The cube immediately on top of a cube with edge-length $k$ must have edge-length at most $k+2.$ Let $T$ be the number of different towers than can be constructed. What is the remainder when $T$ is divided by 1000?

A tetrahedron has five edges of length $3$ and circumradius $2$. What is the length of the sixth edge?

Let $E$ be a finite set of points in space such that $E$ is not contained in a plane and no three points of $E$ are collinear. Show that $E$ contains the vertices of a tetrahedron $T = ABCD$ such that $T \cap E = \{A,B,C,D\}$ (including interior points of $T$ ) and such that the projection of $A$ onto the plane $BCD$ is inside a triangle that is similar to the triangle $BCD$ and whose sides have midpoints $B,C,D.$

Six quadratic mirrors are put together to form a cube $ABCDEFGH$ with a mirrored interior. At each of the eight vertices, there is a tiny hole through which a laser beam can enter and leave the cube. A laser beam enters the cube at vertex $A$ in a direction not parallel to any of the cube's sides. If the beam hits a side, it is reflected; if it hits an edge, the light is absorbed, and if it hits a vertex, it leaves the cube. For each positive integer $n$, determine the set of vertices where the laser beam can leave the cube after exactly $n$ reflections.

Consider the cube $ABCDA'B'C'D'$. The bisectors of the angles $\angle A' C'A$ and $\angle A' AC'$ intersect $AA'$ and $A'C$ in the points $P$, respectively $S$. The point $M$ is the foot of the perpendicular from $A'$ on $CP$ , and $N$ is the foot of the perpendicular from $A'$ to $AS$. Point $O$ is the center of the face $ABB'A'$ a) Prove that the planes $(MNO)$ and $(AC'B)$ are parallel. b) Calculate the distance between these planes, knowing that $AB = 1$.

Six cubes, each an inch on an edge, are fastened together, as shown. Find the total surface area in square inches. Include the top, bottom and sides. [asy]/* AMC8 2002 #22 Problem */ draw((0,0)--(0,1)--(1,1)--(1,0)--cycle); draw((0,1)--(0.5,1.5)--(1.5,1.5)--(1,1)); draw((1,0)--(1.5,0.5)--(1.5,1.5)); draw((0.5,1.5)--(1,2)--(1.5,2)); draw((1.5,1.5)--(1.5,3.5)--(2,4)--(3,4)--(2.5,3.5)--(2.5,0.5)--(1.5,.5)); draw((1.5,3.5)--(2.5,3.5)); draw((1.5,1.5)--(3.5,1.5)--(3.5,2.5)--(1.5,2.5)); draw((3,4)--(3,3)--(2.5,2.5)); draw((3,3)--(4,3)--(4,2)--(3.5,1.5)); draw((4,3)--(3.5,2.5)); draw((2.5,.5)--(3,1)--(3,1.5));[/asy] $ \textbf{(A)}\ 18\qquad\textbf{(B)}\ 24\qquad\textbf{(C)}\ 26\qquad\textbf{(D)}\ 30\qquad\textbf{(E)}\ 36$

a) Prove that we can assign one of the numbers $1$ or $-1$ to the vertices of a cube such that the product of the numbers assigned to the vertices of any face is equal to $-1$. b) Prove that for a hexagonal prism such a mapping is not possible.

For what polynomials $P(n)$ with integer coefficients can a positive integer be assigned to every lattice point in $\mathbb{R}^3$ so that for every integer $n \ge 1$, the sum of the $n^3$ integers assigned to any $n \times n \times n$ grid of lattice points is divisible by $P(n)$? [i]Proposed by Andre Arslan[/i]

Six line segments of lengths $17, 18, 19, 20, 21$ and $23$ form the side edges of a triangular pyramid (also called a tetrahedron). Can there exist a sphere tangent to all six lines?

* What is the radius of the largest possible circle inscribed into a cube with side $a$?

Assume that the bisecting plane of the dihedral angle at edge $AB$ of the tetrahedron $ABCD$ meets the edge $CD$ at point $E$. Denote by $S_1, S_2, S_3$, respectively the areas of the triangles $ABC, ABE$, and $ABD$. Prove that no tetrahedron exists for which $S_1, S_2, S_3$ (in this order) form an arithmetic or geometric progression.