In $ xyz$ space, consider two points $ P(1,\ 0,\ 1),\ Q(\minus{}1,\ 1,\ 0).$ Let $ S$ be the surface generated by rotation the line segment $ PQ$ about $ x$ axis. Answer the following questions. (1) Find the volume of the solid bounded by the surface $ S$ and two planes $ x\equal{}1$ and $ x\equal{}\minus{}1$. (2) Find the cross-section of the solid in (1) by the plane $ y\equal{}0$ to sketch the figure on the palne $ y\equal{}0$. (3) Evaluate the definite integral $ \int_0^1 \sqrt{t^2\plus{}1}\ dt$ by substitution $ t\equal{}\frac{e^s\minus{}e^{\minus{}s}}{2}$. Then use this to find the area of (2).

A game is played by $n$ girls ($n \geq 2$), everybody having a ball. Each of the $\binom{n}{2}$ pairs of players, is an arbitrary order, exchange the balls they have at the moment. The game is called nice [b]nice[/b] if at the end nobody has her own ball and it is called [b]tiresome[/b] if at the end everybody has her initial ball. Determine the values of $n$ for which there exists a nice game and those for which there exists a tiresome game.

A uniform disk ($ I = \dfrac {1}{2} MR^2 $) of mass 8.0 kg can rotate without friction on a fixed axis. A string is wrapped around its circumference and is attached to a 6.0 kg mass. The string does not slip. What is the tension in the cord while the mass is falling? [asy] size(250); pen p=linewidth(3), dg=gray(0.25), llg=gray(0.90), lg=gray(0.75),g=grey; void f(path P, pen p, pen q) { filldraw(P,p,q); } path P=CR((0,0),1); D((1,0)--(1,-2.5),p+lg); f(P,g,p); P=scale(0.4)*P; f(P,lg,p); path Q=arc((0,0),0.3,-40,130)--arc((-1,-1),0.5,130,320)--cycle; f(Q,llg,dg+p); P=scale(0.45)*P; f(P,llg,dg+p); P=shift((0.15,0.15))*((-1,-1)--(-1,-2)--(-1.1,-2)--(-1.1,-1.1)--(-2,-1.1)--(-2,-1)--cycle); f(P,llg,lg+p); P=shift((1.55,1.55))*scale(3)*P; f(P,llg,g+p); unfill((-1.23,-1.23)--(-1.23,-5)--(-5,-1.23)--cycle); clip((-3.8,-3.8)--(-3.8,3.8)--(3.8,3.8)--(3.8,-3.8)--cycle); P=(0.2,-2.5)--(1.8,-2.5)--(1.8,-4.1)--(0.2,-4.1)--cycle; f(P,llg,lg+p); MP("m",(1,-3.3),(0,0),fontsize(16)); MP("M",(0,-1),fontsize(16));[/asy] $ \textbf {(A) } \text {20.0 N} \qquad \textbf {(B) } \text {24.0 N} \qquad \textbf {(C) } \text {34.3 N} \qquad \textbf {(D) } \text {60.0 N} \qquad \textbf {(E) } \text {80.0 N} $

Triangle $ABC$ has right angle at $B$, and contains a point $P$ for which $PA = 10$, $PB = 6$, and $\angle APB = \angle BPC = \angle CPA$. Find $PC$. [asy] pair A=(0,5), B=origin, C=(12,0), D=rotate(-60)*C, F=rotate(60)*A, P=intersectionpoint(A--D, C--F); draw(A--P--B--A--C--B^^C--P); dot(A^^B^^C^^P); pair point=P; label("$A$", A, dir(point--A)); label("$B$", B, dir(point--B)); label("$C$", C, dir(point--C)); label("$P$", P, NE);[/asy]

Is it possible to find a set of $100$ (or $200$) points on the boundary of a cube such that this set remains fixed under all rotations which leave the cube fixed ?

Let AOB and COD be angles which can be identified by a rotation of the plane (such that rays OA and OC are identified). A circle is inscribed in each of these angles; these circles intersect at points E and F. Show that angles AOE and DOF are equal.

Square $ABCD$ in the coordinate plane has vertices at the points $A(1,1), B(-1,1), C(-1,-1),$ and $D(1,-1).$ Consider the following four transformations: [list=] [*]$L,$ a rotation of $90^{\circ}$ counterclockwise around the origin; [*]$R,$ a rotation of $90^{\circ}$ clockwise around the origin; [*]$H,$ a reflection across the $x$-axis; and [*]$V,$ a reflection across the $y$-axis. [/list] Each of these transformations maps the squares onto itself, but the positions of the labeled vertices will change. For example, applying $R$ and then $V$ would send the vertex $A$ at $(1,1)$ to $(-1,-1)$ and would send the vertex $B$ at $(-1,1)$ to itself. How many sequences of $20$ transformations chosen from $\{L, R, H, V\}$ will send all of the labeled vertices back to their original positions? (For example, $R, R, V, H$ is one sequence of $4$ transformations that will send the vertices back to their original positions.) $\textbf{(A)}\ 2^{37} \qquad\textbf{(B)}\ 3\cdot 2^{36} \qquad\textbf{(C)}\ 2^{38} \qquad\textbf{(D)}\ 3\cdot 2^{37} \qquad\textbf{(E)}\ 2^{39}$

Let a unit square $\mathcal D$ be given in the plane. For any point $X$ in the plane denote $\mathcal D_X$ the image of $\mathcal D$ in rotation with respect to origin $X$ by $+90^\circ.$ Find the locus of all $X$ such that the area of union $\mathcal D\cup\mathcal D_X$ is at most 1.5.

Five persons wearing badges with numbers $1, 2, 3, 4, 5$ are seated on $5$ chairs around a circular table. In how many ways can they be seated so that no two persons whose badges have consecutive numbers are seated next to each other? (Two arrangements obtained by rotation around the table are considered different)

How many ways are there to color the $8$ regions of a three-set Venn Diagram with $3$ colors such that each color is used at least once? Two colorings are considered the same if one can be reached from the other by rotation and/or reflection.

Let a positive integer $n$.Consider square table $3*3$.One use $n$ colors to color all cell of table such that each cell is colored by exactly one color. Two colored table is same if we can receive them from other by a rotation through center of $3*3$ table How many way to color this square table satifies above conditions.

Assume that $ A_1, A_2, \ldots, A_8$ are eight points taken arbitrarily on a plane. For a directed line $ l$ taken arbitrarily on the plane, assume that projections of $ A_1, A_2, \ldots, A_8$ on the line are $ P_1, P_2, \ldots, P_8$ respectively. If the eight projections are pairwise disjoint, they can be arranged as $ P_{i_1}, P_{i_2}, \ldots, P_{i_8}$ according to the direction of line $ l.$ Thus we get one permutation for $ 1, 2, \ldots, 8,$ namely, $ i_1, i_2, \ldots, i_8.$ In the figure, this permutation is $ 2, 1, 8, 3, 7, 4, 6, 5.$ Assume that after these eight points are projected to every directed line on the plane, we get the number of different permutations as $ N_8 \equal{} N(A_1, A_2, \ldots, A_8).$ Find the maximal value of $ N_8.$

Let $T$ be the triangle in the coordinate plane with vertices $\left(0,0\right)$, $\left(4,0\right)$, and $\left(0,3\right)$. Consider the following five isometries (rigid transformations) of the plane: rotations of $90^{\circ}$, $180^{\circ}$, and $270^{\circ}$ counterclockwise around the origin, reflection across the $x$-axis, and reflection across the $y$-axis. How many of the $125$ sequences of three of these transformations (not necessarily distinct) will return $T$ to its original position? (For example, a $180^{\circ}$ rotation, followed by a reflection across the $x$-axis, followed by a reflection across the $y$-axis will return $T$ to its original position, but a $90^{\circ}$ rotation, followed by a reflection across the $x$-axis, followed by another reflection across the $x$-axis will not return $T$ to its original position.) $\textbf{(A) } 12\qquad\textbf{(B) } 15\qquad\textbf{(C) }17 \qquad\textbf{(D) }20 \qquad\textbf{(E) }25$

Triangle $ABC$ has sides $AB = 25$, $BC = 30$, and $CA=20$. Let $P,Q$ be the points on segments $AB,AC$, respectively, such that $AP=5$ and $AQ=4$. Suppose lines $BQ$ and $CP$ intersect at $R$ and the circumcircles of $\triangle{BPR}$ and $\triangle{CQR}$ intersect at a second point $S\ne R$. If the length of segment $SA$ can be expressed in the form $\frac{m}{\sqrt{n}}$ for positive integers $m,n$, where $n$ is not divisible by the square of any prime, find $m+n$. [i]Victor Wang[/i]

Three concentric circles have radii $3$, $4$, and $5$. An equilateral triangle with one vertex on each circle has side length $s$. The largest possible area of the triangle can be written as $a+\frac{b}{c}\sqrt{d}$, where $a,b,c$ and $d$ are positive integers, $b$ and $c$ are relatively prime, and $d$ is not divisible by the square of any prime. Find $a+b+c+d$.

Consider the following statement: for any permutation $\pi_1\not=\mathbb{I}$ of $\{1,2,...,n\}$ there is a permutation $\pi_2$ such that any permutation on these numbers can be obtained by a finite compostion of $\pi_1$ and $\pi_2$. (a) Prove the statement for $n=3$ and $n=5$. (b) Disprove the statement for $n=4$.

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

$C$ is the unit circle in some plane. $R$ is a square with side $a$. $C$ is fixed and $R$ moves(without rotation) on the plane, in such a way that its center stays inside $C$(including boundaries). Find the maximum value of the area drawn by the trace of $R$.

$ABCD$ has $AB = CD$, but $AB$ not parallel to $CD$, and $AD$ parallel to $BC$. The triangle is $ABC$ is rotated about $C$ to $A'B'C$. Show that the midpoints of $BC, B'C$ and $A'D$ are collinear.

$\Delta ABC$ and its mirror reflection $\Delta A^{\prime}B^{\prime}C^{\prime}$ is arbitrarily placed on the plane. Prove the midpoints of $AA^{\prime},BB^{\prime},CC^{\prime}$ are collinear.

Suppose that $n$ people $A_1$, $A_2$, $\ldots$, $A_n$, ($n \geq 3$) are seated in a circle and that $A_i$ has $a_i$ objects such that \[ a_1 + a_2 + \cdots + a_n = nN \] where $N$ is a positive integer. In order that each person has the same number of objects, each person $A_i$ is to give or to receive a certain number of objects to or from its two neighbours $A_{i-1}$ and $A_{i+1}$. (Here $A_{n+1}$ means $A_1$ and $A_n$ means $A_0$.) How should this redistribution be performed so that the total number of objects transferred is minimum?

Functions $ f$ and $ g$ are quadratic, $ g(x) \equal{} \minus{} f(100 \minus{} x)$, and the graph of $ g$ contains the vertex of the graph of $ f$. The four $ x$-intercepts on the two graphs have $ x$-coordinates $ x_1$, $ x_2$, $ x_3$, and $ x_4$, in increasing order, and $ x_3 \minus{} x_2 \equal{} 150$. The value of $ x_4 \minus{} x_1$ is $ m \plus{} n\sqrt p$, where $ m$, $ n$, and $ p$ are positive integers, and $ p$ is not divisible by the square of any prime. What is $ m \plus{} n \plus{} p$? $ \textbf{(A)}\ 602\qquad \textbf{(B)}\ 652\qquad \textbf{(C)}\ 702\qquad \textbf{(D)}\ 752\qquad \textbf{(E)}\ 802$

Determine all values of $n$ for which there is a set $S$ with $n$ points, with no 3 collinear, with the following property: it is possible to paint all points of $S$ in such a way that all angles determined by three points in $S$, all of the same color or of three different colors, aren't obtuse. The number of colors available is unlimited.

Two different points $A,S$ are given in the plane. Furthermore, positive numbers $d,\omega$ are given, $\omega<180^\circ.$ Let $X$ be a point and $X'$ its image under the rotation by the angle $\omega$ (in counter-clockwise direction) with respect to the origin $S.$ Construct all points $X$ such that $XX'=d$ and $A$ is a point of the segment $XX'.$ Discuss conditions of solvability (in terms of $d,\omega,SA$).

Six chairs are evenly spaced around a circular table. One person is seated in each chair. Each person gets up and sits down in a chair that is not the same chair and is not adjacent to the chair he or she originally occupied, so that again one person is seated in each chair. In how many ways can this be done? $ \textbf{(A) }14\qquad\textbf{(B) }16\qquad\textbf{(C) }18\qquad\textbf{(D) }20\qquad\textbf{(E) }24 $