When a student multiplied the number $66$ by the repeating decimal, $$1. \underline{a} \underline{b} \underline{a} \underline{b} … = 1.\overline{ab},$$ where $a$ and $b$ are digits, he did not notice the notation and just multiplied $66$ times $1. \underline{a} \underline{b}.$ Later he found that his answer is $0.5$ less than the correct answer. What is the $2$- digit integer $\underline{a} \underline{b}$? $\textbf{(A)}\ 15 \qquad\textbf{(B)}\ 30 \qquad\textbf{(C)}\ 45 \qquad\textbf{(D)}\ 60 \qquad\textbf{(E)}\ 75$

A figure on a computer screen shows $n$ points on a sphere, no four coplanar. Some pairs of points are joined by segments. Each segment is colored red or blue. For each point there is a key that switches the colors of all segments with that point as endpoint. For every three points there is a sequence of key presses that makes the three segments between them red. Show that it is possible to make all the segments on the screen red. Find the smallest number of key presses that can turn all the segments red, starting from the worst case.

Suppose $ABCD$ is a cyclic quadrilateral inscribed in a circle of radius one unit. If $AB \cdot BC \cdot CD \cdot DA \geq 4$, prove that $ABCD$ is a square.

Integers $a$, $b$, and $c$ satisfy $ab + c = 100$, $bc + a = 87$, and $ca + b = 60$. What is $ab + bc + ca$? $ \textbf{(A) }212 \qquad \textbf{(B) }247 \qquad \textbf{(C) }258 \qquad \textbf{(D) }276 \qquad \textbf{(E) }284 \qquad $

Suppose there are several juice boxes, one of which is poisoned. You have $n$ guinea pigs to test the boxes. The testing happens in the following way: [list] [*] At each round, you can have the guinea pigs taste any number of juice boxes. [*] Conversely, a juice box can be tasted by any number of guinea pigs. [*] After the round ends, any guinea pigs who tasted the poisoned juice die. [/list] Suppose you have to find the poisoned juice box in at most $k$ rounds. What is the maximum number of juice boxes such that it is possible?

Solve the equation,$$ \sin (\pi \log x) + \cos (\pi \log x) = 1$$

Let $a,b,c$ be the roots of the cubic $x^3 + 3x^2 + 5x + 7$. Given that $P$ is a cubic polynomial such that $P(a)=b+c$, $P(b) = c+a$, $P(c) = a+b$, and $P(a+b+c) = -16$, find $P(0)$. [i]Author: Alex Zhu[/i]

Given a point $X$ and $n$ vectors $\overrightarrow{x_i}$ with sum zero in the plane. For each permutation of the vectors we form a set of $n$ points, by starting at $X$ and adding the vectors in order. For example, with the original ordering we get $X_1$ such that $XX_1 = \overrightarrow{x_1}, X_2$ such that $X_1X_2 = \overrightarrow{x_2}$ and so on. Show that for some permutation we can find two points $Y, Z$ with angle $\angle YXZ = 60^o $, so that all the points lie inside or on the triangle $XYZ$.

The six offices of the city of Salavaara are to be connected to each other by a communication network which utilizes modern picotechnology. Each of the offices is to be connected to all the other ones by direct cable connections. Three operators compete to build the connections, and there is a separate competition for every connection. When the network is finished one notices that the worst has happened: the systems of the three operators are incompatible. So the city must reject connections built by two of the operators, and these are to be chosen so that the damage is minimized. What is the minimal number of offices which still can be connected to each other, possibly through intermediate offices, in the worst possible case.

Andrew has $10$ balls in a bag, each a different color. He randomly picks a ball from the bag $4$ times, with replacement. The expected number of distinct colors among the balls he picks is $\tfrac{p}{q}$, where $\gcd(p, q) = 1$ and $p, q > 0$. What is $p + q$?

On the circumcircle of the acute triangle $ABC$, $D$ is the midpoint of $ \stackrel{\frown}{BC}$. Let $X$ be a point on $ \stackrel{\frown}{BD}$, $E$ the midpoint of $ \stackrel{\frown}{AX}$, and let $S$ lie on $ \stackrel{\frown}{AC}$. The lines $SD$ and $BC$ have intersection $R$, and the lines $SE$ and $AX$ have intersection $T$. If $RT \parallel DE$, prove that the incenter of the triangle $ABC$ is on the line $RT.$

Suppose $a$ is a real number such that $3a + 6$ is the greatest integer less than or equal to $a$ and $4a + 9$ is the least integer greater than or equal to $a$. Compute $a$.

Let $P (x)$ be a polynomial of degree $2n$, such that $P (k) =\frac{k}{k + 1}$ for $k = 0,...,2n$. Determine $P (2n + 1)$.

Define a complexity of a set $a_1,a_2,\dots,$ consisting of 0 and 1 to be the smallest positive integer $k$ such that for some positive integers $\epsilon_1,\epsilon_2,\dots, \epsilon_k$ each number of the sequence $a_n$, $n>k$, has the same parity as $\epsilon_1 a_{n-1}+\epsilon_2 a_{n-2}+\dots+\epsilon_k a_{n-k}$. Sequence $a_1,a_2,\dots,$ has a complexity of $1000$. What is the complexity of sequence $1-a_1,1-a_2,\dots,$. [I]Proposed by A. Kirichenko[/i]

Given a circle $\gamma$ and a point $P$ inside it, find the maximum and minimum value of the sum of the lengths of two perpendicular chords of $\gamma$ passing through $P$.