A ring is the area between two circles with the same center, and width of a ring is the difference between the radii of two circles. [img]http://i18.tinypic.com/6cdmvi8.png[/img] a) Can we put uncountable disjoint rings of width 1(not necessarily same) in the space such that each two of them can not be separated. [img]http://i19.tinypic.com/4qgx30j.png[/img] b) What's the answer if 1 is replaced with 0?

Let $ ABC$ be an equilateral triangle with side length 2, and let $ \Gamma$ be a circle with radius $ \frac {1}{2}$ centered at the center of the equilateral triangle. Determine the length of the shortest path that starts somewhere on $ \Gamma$, visits all three sides of $ ABC$, and ends somewhere on $ \Gamma$ (not necessarily at the starting point). Express your answer in the form of $ \sqrt p \minus{} q$, where $ p$ and $ q$ are rational numbers written as reduced fractions.

Find all polynomials $P$ with real coefficients such that $\forall{x\in\mathbb{R}}$ we have: \[ P(2P(x))=2P(P(x))+2(P(x))^2. \]

Determine all prime numbers of the form $1 + 2^p + 3^p +...+ p^p$ where $p$ is a prime number.

Let $n$ and $k$ be positive integers and $G$ be a complete graph on $n$ vertices. Each edge of $G$ is colored one of $k$ colors such that every triangle consists of either three edges of the same color or three edges of three different colors. Furthermore, there exist two different-colored edges. Prove that $n\le(k-1)^2$. [i]Linus Tang[/i]

Find all real numbers $x$ for which the following equality holds : $$\sqrt{\frac{x-7}{1989}}+\sqrt{\frac{x-6}{1990}}+\sqrt{\frac{x-5}{1991}}=\sqrt{\frac{x-1989}{7}}+\sqrt{\frac{x-1990}{6}}+\sqrt{\frac{x-1991}{5}}$$

Characterize those configurations of $ n$ coplanar straight lines for which the sum of angles between all pairs of lines is maximum. [i]L.Fejes-Toth, A. Heppes[/i]

.Let $CH$ be an altitude of right-angled triangle $ABC$ ($\angle C = 90^o$), $HA_1$, $HB_1$ be the bisectors of angles $CHB$, $AHC$ respectively, and $E, F$ be the midpoints of $HB_1$ and $HA_1$ respectively. Prove that the lines $AE$ and $BF$ meet on the bisector of angle $ACB$.

There are lamps in every field of $n\times n$ table. At start all the lamps are off. A move consists of chosing $m$ consecutive fields in a row or a column and changing the status of that $m$ lamps. Prove that you can reach a state in which all the lamps are on only if $m$ divides $n.$

$6.$ How many two digit positive integers $N$ have the property that the sum of $N$ and the number obtained by reversing the order of the digits of $N$ is a perfect square $?$

Let $ABC$ be an equilateral triangle and $M$ be a point inside the triangle. We denote by $A'$, $B'$, $C'$ the projections of the point $M$ on the sides $BC$, $CA$ and $AB$ respectively. Prove that the lines $AA'$, $BB'$ and $CC'$ are concurrent if and only if $M$ belongs to an altitude of the triangle.

Let \(ABC\) be a triangle. Let \(B'\) denote the reflection of \(b\) in the internal angle bisector \(l\) of \(\angle A\).Show that the circumcentre of the triangle \(CB'I\) lies on the line \(l\) where \(I\) is the incentre of \(ABC\).

A shoe brand proposes: Buy a pair of shoes without paying. It's about this: you go to the factory and pay $20,000 \$ $ for a pair of shoes, get the shoes and ten stamps, with a unit cost of each stamp $2000 \$ $. By selling these stamps you will get your money back. The ones who buy these stamps go to the factory, delivers them and for $18,000 \$ $ they receive their pair of shoes and the ten stamps, thus continuing the cycle. $\bullet$ How much does the factory receive for each pair of shoes? $\bullet$ Can this operation be repeated a hundred times, assuming that no one repeats itself? [hide=original wording]Una marca de zapatos propone: Compre un par de zapatos sin pagar. Se trata de lo siguiente: usted va a la fabrica y paga \$ 20000 por un par de zapatos; recibe los zapatos y diez estampillas, con un costo unitario de ]\$ 2000. Al vender estas estampillas recuperara su dinero. Quienes compren estas estampillas van a la fabrica, la entregan y por \$ 18000 reciben su par de zapatos y las diez estampillas, continuando as el ciclo. - Cuanto recibe la fabrica por cada par de zapatos? - Se puede repetir esta operacion cien veces, suponiendo que nadie se repite?[/hide]

A function $f: \mathbb{R}^{2} \rightarrow \mathbb{R}$ is said to be [i]continuous in each variable separately [/i] if, for each fixed value $y_0$ of $y$, the function $f(x, y_0)$ is contnuous in the usual sense as a function in $x,$ and similarly $f(x_0 , y)$ is continuous as a function of $y$ for each fixed $x_0$. Let $f: \mathbb{R}^{2} \rightarrow \mathbb{R}$ be continuous in each variable separately. Show that there exists a sequence of continuous functions $g_n: \mathbb{R}^{2} \rightarrow \mathbb{R}$ such that $$f(x,y) =\lim_{n\to \infty}g_{n}(x,y)$$ for all $(x,y)\in \mathbb{R}^{2}.$

Let $a_n$ be the last digit of the sum of the digits of $20052005...2005$, where the $2005$ block occurs $n$ times. Find $a_1 +a_2 + \dots +a_{2005}$.

An up-right path from lattice points $P$ and $Q$ on the $xy$-plane is a path in which every move is either one unit right or one unit up. The probability that a randomly chosen up-right path from $(0,0)$ to $(10,3)$ does not intersect the graph of $y=x^2+0.5$ can be written as $\tfrac mn$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. [i]Proposed by [b]HrishiP[/b][/i]

There are $n$ MOPpers $p_1,...,p_n$ designing a carpool system to attend their morning class. Each $p_i$'s car fits $\chi (p_i)$ people ($\chi : \{p_1,...,p_n\} \to \{1,2,...,n\}$). A $c$-fair carpool system is an assignment of one or more drivers on each of several days, such that each MOPper drives $c$ times, and all cars are full on each day. (More precisely, it is a sequence of sets $(S_1, ...,S_m)$ such that $|\{k: p_i\in S_k\}|=c$ and $\sum_{x\in S_j} \chi(x) = n$ for all $i,j$. ) Suppose it turns out that a $2$-fair carpool system is possible but not a $1$-fair carpool system. Must $n$ be even? [i]Proposed by Nathan Ramesh and Palmer Mebane

Find all polynomials $P(x)$ satisfying $P(x+1)-2P(x)+P(x-1)= x$ for all $x$

Each two-digit is number is coloured in one of $k$ colours. What is the minimum value of $k$ such that, regardless of the colouring, there are three numbers $a$, $b$ and $c$ with different colours with $a$ and $b$ having the same units digit (second digit) and $b$ and $c$ having the same tens digit (first digit)?

Five points $A$, $B$, $C$, $D$ and $E$ lie on a circle $\tau$ clockwise in that order such that $AB \parallel CE$ and $\angle ABC > 90^{\circ}$. Let $k$ be a circle tangent to $AD$, $CE$ and $\tau$ such that $k$ and $\tau$ touch on the arc $\widehat{DE}$ not containing $A$, $B$ and $C$. Let $F \neq A$ be the intersection of $\tau$ and the tangent line to $k$ passing through $A$ different from $AD$. Prove that there exists a circle tangent to $BD$, $BF$, $CE$ and $\tau$.

Nine distinct digits appear in the decimal expansion of $2^{29}$. Which digit is missing?

If $a$ and $b$ satisfy the equations $a +\frac1b=4$ and $\frac1a+b=\frac{16}{15}$, determine the product of all possible values of $ab$.

Find all real numbers $k$ for which the inequality $(1+t)^k (1-t)^{1-k} \leq 1$ is true for every real number $t \in (-1, 1)$.

(a) Sketch qualitativly the region with maximum area such that it lies in the first quadrant and is bound by $y=x^2-x^3$ and $y=kx$ where $k$ is a constent. The region must not have any other lines closing it. Note: $kx$ lies above $x^2-x^3$ (b) Find an expression for the volume of the solid obtained by spinning this region about the $y$ axis.

In a $\triangle XYZ$, points $A,B$ lie on segment $ZX, C,D$ lie on segment $XY , E, F$ lie on segment $YZ$. $A, B, C, D$ lie on a circle, and $\frac{AZ \cdot EY \cdot ZB \cdot Y F}{EZ \cdot CY \cdot ZF \cdot Y D}= 1$ . Let $L = ZX \cap DE$, $M = XY \cap AF$, $N = Y Z \cap BC$. Prove that $L,M,N$ are collinear.