Determine the locus of points, for whom the ratio of the distances to two given points has a constant value.

For what values of the velocity $c$ does the equation $u_t = u -u^2 + u_{xx}$ have a solution in the form of a traveling wave $u = \varphi(x-ct)$, $\varphi(-\infty) = 1$, $\varphi(\infty) = 0$, $0 \le u \le 1$?

In quadrilateral $ABCD$ with diagonals $\overline{AC}$ and $\overline{BD}$ intersecting at $O$, $\overline{BO}=4$, $\overline{AO}=8$, $\overline{OC}=3$, and $\overline{AB}=6$. The length of $\overline{AD}$ is: $\textbf{(A)}\ 9\qquad \textbf{(B)}\ 10\qquad \textbf{(C)}\ 6\sqrt{3}\qquad \textbf{(D)}\ 8\sqrt{2}\qquad \textbf{(E)}\ \sqrt{166}$

Let $P_0P_5Q_5Q_0$ be a rectangular chocolate bar, one half dark chocolate and one half white chocolate, as shown in the diagram below. We randomly select $4$ points on the segment $P_0P_5$, and immediately after selecting those points, we label those $4$ selected points $P_1, P_2, P_3, P_4$ from left to right. Similarly, we randomly select $4$ points on the segment $Q_0Q_5$, and immediately after selecting those points, we label those $4$ points $Q_1, Q_2, Q_3, Q_4$ from left to right. The segments $P_1Q_1, P_2Q_2, P_3Q_3, P_4Q_4$ divide the rectangular chocolate bar into $5$ smaller trapezoidal pieces of chocolate. The probability that exactly $3$ pieces of chocolate contain both dark and white chocolate can be written as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [Diagram in the individuals file for this exam on the Chmmc website]

Show that in any set of eleven integers there are six whose sum is divisible by $6$.

Let $ P$ be a convex $ n$ polygon each of which sides and diagnoals is colored with one of $ n$ distinct colors. For which $ n$ does: there exists a coloring method such that for any three of $ n$ colors, we can always find one triangle whose vertices is of $ P$' and whose sides is colored by the three colors respectively.

Ralph went to the store and bought 12 pairs of socks for a total of \$24. Some of the socks he bought cost \$1 a pair, some of the socks he bought cost \$3 a pair, and some of the socks he bought cost \$4 a pair. If he bought at least one pair of each type, how many pairs of \$1 socks did Ralph buy? $ \textbf{(A) } 4 \qquad \textbf{(B) } 5 \qquad \textbf{(C) } 6 \qquad \textbf{(D) } 7 \qquad \textbf{(E) } 8 $

Prove that for all $ n\ge 2 $ natural numbers there exist $ a_n\in\mathbb{Q} $ such that $$ X^{2n}+a_nX^n+1\Huge\vdots X^2+\frac{1}{2}X+1, $$ and that there isn´t any $ a_n\in\mathbb{R}\setminus\mathbb{Q} $ with this property.

Find all positive values of $a$, for which there is a number $b$ such that the parabola $y=ax^2-b$ intersects the unit circle at four distinct points. Also prove that for every such a there exists $b$ such that the parabola $y=ax^2-b$ intersects the unit circle at four distinct points whose $x$-coordinates form an arithmetic progression.

What are the signs of $\triangle{H}$ and $\triangle{S}$ for a reaction that is spontaneous only at low temperatures? $ \textbf{(A)}\ \triangle{H} \text{ is positive}, \triangle{S} \text{ is positive} \qquad\textbf{(B)}\ \triangle{H}\text{ is positive}, \triangle{S} \text{ is negative} \qquad$ $\textbf{(C)}\ \triangle{H} \text{ is negative}, \triangle{S} \text{ is negative} \qquad\textbf{(D)}\ \triangle{H} \text{ is negative}, \triangle{S} \text{ is positive} \qquad $

For every $n\in\mathbb{N}$, define the [i]power sum[/i] of $n$ as follows. For every prime divisor $p$ of $n$, consider the largest positive integer $k$ for which $p^k\le n$, and sum up all the $p^k$'s. (For instance, the power sum of $100$ is $2^6+5^2=89$.) Prove that the [i]power sum[/i] of $n$ is larger than $n$ for infinitely many positive integers $n$.

Let $1=d_1<d_2<....<d_k=n$ be all different divisors of positive integer n written in ascending order. Determine all n such that: \[d_6^{2} +d_7^{2} - 1=n\]

Let $G$ be a simple $k$ edge-connected graph on $n$ vertices and let $u$ and $v$ be different vertices of $G$. Prove that there are $k$ edge-disjoint paths from $u$ to $v$ each having at most $\frac{20n}{k}$ edges.

Consider a $ n\times n $ square grid which is divided into $ n^2 $ unit squares(think of a chess-board). The set of all unit squares intersecting the main diagonal of the square or lying under it is called an $n$-staircase. Find the number of ways in which an $n$-stair case can be partitioned into several rectangles, with sides along the grid lines, having mutually distinct areas.

Prove that the sequence $(a_n)$, where $$a_n=\sum_{k=1}^n\left\{\frac{\left\lfloor2^{k-\frac12}\right\rfloor}2\right\}2^{1-k},$$converges, and determine its limit as $n\to\infty$.

Let $0\le a\le b\le c$ be real numbers. Prove that \[(a+3b)(b+4c)(c+2a)\ge 60abc \]

On the sides $ AB $ and $ AC $ of the triangle $ ABC $ consider the points $ D, $ respectively, $ E, $ such that $$ \overrightarrow{DA} +\overrightarrow{DB} +\overrightarrow{EA} +\overrightarrow{EC} =\overrightarrow{O} . $$ If $ T $ is the intersection of $ DC $ and $ BE, $ determine the real number $ \alpha $ so that: $$ \overrightarrow{TB} +\overrightarrow{TC} =\alpha\cdot\overrightarrow{TA} . $$

Let $\mathbb{Z}_{>0}$ denote the set of positive integers. Consider a function $f: \mathbb{Z}_{>0} \to \mathbb{Z}_{>0}$. For any $m, n \in \mathbb{Z}_{>0}$ we write $f^n(m) = \underbrace{f(f(\ldots f}_{n}(m)\ldots))$. Suppose that $f$ has the following two properties: (i) if $m, n \in \mathbb{Z}_{>0}$, then $\frac{f^n(m) - m}{n} \in \mathbb{Z}_{>0}$; (ii) The set $\mathbb{Z}_{>0} \setminus \{f(n) \mid n\in \mathbb{Z}_{>0}\}$ is finite. Prove that the sequence $f(1) - 1, f(2) - 2, f(3) - 3, \ldots$ is periodic. [i]Proposed by Ang Jie Jun, Singapore[/i]

Suppose that $ D,E,F$ are points on sides $ BC,CA,AB$ of a triangle $ ABC$ respectively such that $ BD\equal{}CE\equal{}AF$ and $ \angle BAD\equal{}\angle CBE\equal{}\angle ACF$.Prove that the triangle $ ABC$ is equilateral.

From a point in space, $n$ rays are issuing, whereas the angle among any two of these rays is at least $30^{\circ}$. Prove that $n < 59$.

Prove that for any interval $[a,b]$ of real numbers and any positive integer $n$ there exists a positive integer $k$ and a partition of the given interval \[a = x (0) < x (1) < x (2) < \cdots < x (k-1) < x (k) = b\] such that \[\int_{x(0)}^{x(1)}f(x)dx+\int_{x(2)}^{x(3)}f(x)dx+\cdots=\int_{x(1)}^{x(2)}f(x)dx+\int_{x(3)}^{x(4)}f(x)dx+\cdots\] for all polynomials $f$ with real coefficients and degree less than $n$.

Let $f\left(x\right)$ be a non-constant polynomial with integer coefficients, and let $u$ be an arbitrary positive integer. Prove that there is an integer $n$ such that $f\left(n\right)$ has at least $u$ distinct prime factors and $f\left(n\right) \neq 0$.

What is the least integer $n>2003$ such that $5^n + n^5$ is a multiple of $11$? $ \textbf{(A)}\ 2010 \qquad\textbf{(B)}\ 2011 \qquad\textbf{(C)}\ 2012 \qquad\textbf{(D)}\ 2014 \qquad\textbf{(E)}\ \text{None of the preceding} $

$N$ different positive integers are arranged around a circle , in such a way that the sum of every $5$ consecutive numbers in the circle is a multiple of $13$. Let $A $ be the smallest possible sum of the $n$ numbers. Calculate the value of $A$ for $\bullet$ $n = 99$, $\bullet$ $n = 100$.

At least how many elements does the set which contains all of the midpoints of segments connecting $2003$ different points in a plane have? $ \textbf{(A)}\ 2006 \qquad\textbf{(B)}\ 4001 \qquad\textbf{(C)}\ 4003 \qquad\textbf{(D)}\ 4006 \qquad\textbf{(E)}\ \text{None of the preceeding} $