Consider the set $A$ containing all positive integers whose decimal expansion contains no $0$, and whose sum $S(N)$ of the digits divides $N$. (a) Prove that there exist infinitely many elements in $A$ whose decimal expansion contains each digit the same number of times as each other digit. (b) Explain that for each positive integer $k$ there exist an element in $A$ having exactly $k$ digits.

Nathaniel and Obediah play a game in which they take turns rolling a fair six-sided die and keep a running tally of the sum of the results of all rolls made. A player wins if, after he rolls, the number on the running tally is a multiple of 7. Play continues until either player wins, or else indenitely. If Nathaniel goes first, determine the probability that he ends up winning.

The equation \[ x^{10}+(13x-1)^{10}=0 \] has 10 complex roots $r_1, \overline{r_1}, r_2, \overline{r_2}, r_3, \overline{r_3}, r_4, \overline{r_4}, r_5, \overline{r_5},$ where the bar denotes complex conjugation. Find the value of \[ \frac 1{r_1\overline{r_1}}+\frac 1{r_2\overline{r_2}}+\frac 1{r_3\overline{r_3}}+\frac 1{r_4\overline{r_4}}+\frac 1{r_5\overline{r_5}}. \]

Let $S(b)$ be the number of nonuples of positive integers $(a_1, a_2, \ldots , a_9)$ satisfying $3b-1=a_1+a_2+\ldots+a_9$ and $b^2+1=a_1^2+\ldots+a_9^2$. Prove that for all $\epsilon>0$, there exists $C_{\epsilon}>0$ such that $S(b)\leq C_{\epsilon}b^{3+\epsilon}$.

Let $ n \geq 2$ be a positive integer and $ \lambda$ a positive real number. Initially there are $ n$ fleas on a horizontal line, not all at the same point. We define a move as choosing two fleas at some points $ A$ and $ B$, with $ A$ to the left of $ B$, and letting the flea from $ A$ jump over the flea from $ B$ to the point $ C$ so that $ \frac {BC}{AB} \equal{} \lambda$. Determine all values of $ \lambda$ such that, for any point $ M$ on the line and for any initial position of the $ n$ fleas, there exists a sequence of moves that will take them all to the position right of $ M$.

If the statement "All shirts in this store are on sale." is false, then which of the following statements must be true? I. All shirts in this store are at non-sale prices. II. There is some shirt in this store not on sale. III. No shirt in this store is on sale. IV. Not all shirts in this store are on sale. $ \textbf{(A)}\ \text{II only} \qquad \textbf{(B)}\ \text{IV only} \qquad \textbf{(C)}\ \text{I and III only} \qquad$ $ \textbf{(D)}\ \text{II and IV only} \qquad \textbf{(E)}\ \text{I, II and IV only}$

Marc has an $n\times n$ board, where $n\ge 3$ is an integer, and an unlimited supply of green and red apples. Marc wants to place some apples on the board, so that the following conditions hold. [list] [*] Every cell of the board has exactly one apple, be it red or green. [*] All rows and columns of the board have at least one red apple. [*] No two rows or columns have the same apple color sequence. Note that rows are read from left to right, and columns are read from top to bottom. Also note that we [b]do not[/b] allow a row and a column to have the same color sequence. [/list] Find, in terms of $n$, the minimal number of red apples that Marc needs in order to fill the board in this way.

Given an equilateral triangle, cut it into four polygonal shapes so that, reassembled appropriately, these figures form a square.

Prove that if $x,y,z >1$ and $\frac 1x +\frac 1y +\frac 1z = 2$, then \[\sqrt{x+y+z} \geq \sqrt{x-1}+\sqrt{y-1}+\sqrt{z-1}.\]

Circles $\omega_1$ and $\omega_2$ have radii $r_1<r_2$ respectively and intersect at distinct points $X$ and $Y$. The common external tangents intersect at point $Z$. The common tangent closer to $X$ touches $\omega_1$ and $\omega_2$ at $P$ and $Q$ respectively. Line $ZX$ intersects $\omega_1$ and $\omega_2$ again at points $R$ and $S$ and lines $RP$ and $SQ$ intersect again at point $T$. If $XT=8$, $XZ=15$, and $XY=12$, then what is $\tfrac{r_1}{r_2}$?

Find the unique integer $\overline{CA7DB}$ with nonzero digits so that $\overline{ABCD} \cdot 3 = \overline{CA7DB}.$

Two triangles $ ABC$and $ A'B'C'$ are positioned in the space such that the length of every side of $ \triangle ABC$ is not less than $ a$, and the length of every side of $ \triangle A'B'C'$ is not less than $ a'$. Prove that one can select a vertex of $ \triangle ABC$ and a vertex of $ \triangle A'B'C'$ so that the distance between the two selected vertices is not less than $ \sqrt {\frac {a^2 \plus{} a'^2}{3}}$.

Point $L$ inside triangle $ABC$ is such that $CL = AB$ and $ \angle BAC + \angle BLC = 180^{\circ}$. Point $K$ on the side $AC$ is such that $KL \parallel BC$. Prove that $AB = BK$

A circle is tangential to sides $AB$ and $AD$ of convex quadrilateral $ABCD$ at $G$ and $H$ respectively, and cuts diagonal $AC$ at $E$ and $F$. What are the necessary and sufficient conditions such that there exists another circle which passes through $E$ and $F$, and is tangential to $DA$ and $DC$ extended?

The base of a regular quadrilateral pyramid $\pi$ is a square with side length $2a$ and its lateral edge has length a$\sqrt{17}$. Let $M$ be a point inside the pyramid. Consider the five pyramids which are similar to $\pi$ , whose top vertex is at $M$ and whose bases lie in the planes of the faces of $\pi$ . Show that the sum of the surface areas of these five pyramids is greater or equal to one fifth the surface of $\pi$ , and find for which $M$ equality holds.

The sequences $(a_{n})$, $(b_{n})$ are defined by $a_{1} = \alpha$, $b_{1} = \beta$, $a_{n+1} = \alpha a_{n} - \beta b_{n}$, $b_{n+1} = \beta a_{n} + \alpha b_{n}$ for all $n > 0.$ How many pairs $(\alpha, \beta)$ of real numbers are there such that $a_{1997} = b_{1}$ and $b_{1997} = a_{1}$?