There are $2$ runners on the perimeter of a regular hexagon, initially located at adjacent vertices. Every second, each of the runners independently moves either one vertex to the left, with probability $\frac{1}{2}$, or one vertex to the right, also with probability $\frac{1}{2}$. Find the probability that after a $2013$ second run (in which runners switch vertices $2013$ times each), the runners end up at adjacent vertices once again.

Consider the sequence $x_n>0$ defined with the following recurrence relation: \[x_1 = 0\] and for $n>1$ \[(n+1)^2x_{n+1}^2 + (2^n+4)(n+1)x_{n+1}+ 2^{n+1}+2^{2n-2} = 9n^2x_n^2+36nx_n+32.\] Show that if $n$ is a prime number larger or equal to $5$, then $x_n$ is an integer.

Minivan chooses a prime number. Then every second, he adds either the digit $1$ or the digit $3$ to the right end of his number (after the unit digit), such that the new number is also a prime. Can he continue indefinitely? [i](Proposed by Wong Jer Ren)[/i]

Find all pairs $(m, n)$ of positive integers $m$ and $n$ for which one has $$\sqrt{ m^2 - 4} < 2\sqrt{n} - m < \sqrt{ m^2 - 2}$$

Two six-sided dice are fair in the sense that each face is equally likely to turn up. However, one of the dice has the $ 4$ replaced by $ 3$ and the other die has the $ 3$ replaced by $ 4$. When these dice are rolled, what is the probability that the sum is an odd number? $ \textbf{(A)}\ \frac{1}{3}\qquad \textbf{(B)}\ \frac{4}{9}\qquad \textbf{(C)}\ \frac{1}{2}\qquad \textbf{(D)}\ \frac{5}{9}\qquad \textbf{(E)}\ \frac{11}{18}$

Let $s(k)$ be the number of ways to express $k$ as the sum of distinct $2012^{th}$ powers, where order does not matter. Show that for every real number $c$ there exists an integer $n$ such that $s(n)>cn$. [i]Alex Zhu.[/i]

What conditions should real numbers $ a $, $ b $, $ c $, $ d $, $ e $, $ f $ meet in order for a polynomial of second degree $$ax^2 + 2bxy + cy^2 + 2dx + 2ey + f$$ was the product of two first degree polynomials with real coefficients ?

Amélia and Beatriz play battleship on a $2n\times2n$ board, using very peculiar rules. Amélia begins by choosing $n$ lines and $n$ columns of the board, placing her $n^2$ submarines on the cells that lie on their intersections. Next, Beatriz chooses a set of cells that will explode. Which is the least number of cells that Beatriz has to choose in order to assure that at least a submarine will explode?

Let $n \geq 3$ be a positive integer. In an election debate, we have $n$ seats arranged in a circle and these seats are numbered from $1$ to $n$, clockwise. In each of these chairs sits a politician, who can be a liar or an honest one. Lying politicians always tell lies, and honest politicians always tell the truth. At one heated moment in the debate, they accused each other of being liars, with the politician in chair $1$ saying that the politician immediately to his left is a liar, the politician in chair $2$ saying that all the $2$ politicians immediately to his left are liars, the politician in the char $3$ saying that all the $3$ politicians immediately to his left are liars, and so on. Note that the politician in chair $n$ accuses all $n$ politicians (including himself) of being liars. For what values of $n$ is this situation possible to happen?

Let $\triangle ABC$ be inscribed in circle $O$ with $\angle ABC = 36^\circ$. $D$ and $E$ are on the circle such that $\overline{AD}$ and $\overline{CE}$ are diameters of circle $O$. List all possible positive values of $\angle DBE$ in degrees in order from least to greatest. [i]Proposed by Ambrose Yang[/i]

Compute the number of positive integers $n \le 1890$ such that n leaves an odd remainder when divided by all of $2, 3, 5$, and $7$.

$a_1a_2a_3$ and $a_3a_2a_1$ are two three-digit decimal numbers, with $a_1$ and $a_3$ different non-zero digits. Squares of these numbers are five-digit numbers $b_1b_2b_3b_4b_5$ and $b_5b_4b_3b_2b_1$ respectively. Find all such three-digit numbers.

Given an octagon such that all its interior angles are equal, and all its sides have integer lengths. Prove that any pair of opposite sides have equal lengths.

Let $n$ be a positive integer divisible by $4$. We consider the permutations $(a_1, a_2,...,a_n)$ of $(1,2,..., n)$ having the following property: for each j we have $a_i + j = n + 1$ where $i = a_j$ . Prove that there are exactly $\frac{ (\frac12 n)!}{(\frac14 n)!}$ such permutations.

Positive real numbers $a$ and $b$ have the property that \[ \sqrt{\log{a}} + \sqrt{\log{b}} + \log \sqrt{a} + \log \sqrt{b} = 100 \] and all four terms on the left are positive integers, where $\text{log}$ denotes the base 10 logarithm. What is $ab$? $\textbf{(A) } 10^{52} \qquad \textbf{(B) } 10^{100} \qquad \textbf{(C) } 10^{144} \qquad \textbf{(D) } 10^{164} \qquad \textbf{(E) } 10^{200} $

Let $n$ be a positive integer, and define $f(n)=1!+2!+\ldots+n!$. Find polynomials $P$ and $Q$ such that $$f(n+2)=P(n)f(n+1)+Q(n)f(n)$$for all $n\ge1$.

If $\sin 2x \sin 3x = \cos 2x \cos 3x$, then one value for $x$ is A. $18^\circ$ B. $30^\circ$ C. $36^\circ$ D. $45^\circ$ E. $60^\circ$

Prove or disprove that there exists an integer which is doubled when the initial digit is transferred to the end.

Determine all functions $f:\mathbb{R}\to\mathbb{R}$ satisfying \[f(x+yf(x))=f(xf(y))-x+f(y+f(x))\]

Let $n$ be a positive integer, $n \geq 2$, and consider the polynomial equation \[x^n - x^{n-2} - x + 2 = 0.\] For each $n,$ determine all complex numbers $x$ that satisfy the equation and have modulus $|x| = 1.$

Given \(n \in \mathbb{N}\), let \(\sigma (n)\) denote the sum of the divisors of \(n\) and \(\phi (n)\) denote the number of integers \(n \geq m\) for which \(\gcd(m,n) = 1\). Show that for all \(n \in \mathbb{N}\), \[\large \frac{1}{\sigma (n)} + \frac{1}{\phi (n)} \geq \frac{2}{n}\] and determine when equality holds.

Given a right-angled triangle $ABC$ and two perpendicular lines $x$ and $y$ passing through the vertex $A$ of its right angle. For an arbitrary point $X$ on $x$ define $y_B$ and $y_C$ as the reflections of $y$ about $XB$ and $ XC $ respectively. Let $Y$ be the common point of $y_b$ and $y_c$. Find the locus of $Y$ (when $y_b$ and $y_c$ do not coincide).

Fix a positive integer $n.{}$ Consider an $n{}$-point set $S{}$ in the plane. An [i]eligible[/i] set is a non-empty set of the form $S\cap D,{}$ where $D$ is a closed disk in the plane. In terms of $n,$ determine the smallest possible number of eligible subsets $S{}$ may contain. [i]Proposed by Cristi Săvescu[/i]

The number $125$ can be written as a sum of some pairwise coprime integers larger than $1$. Determine the largest number of terms that the sum may have.

We will call a rectangular table filled with natural numbers [i]“good”[/i], if for each two rows, there exist a column for which its two cells that are also in these two rows, contain numbers of different parity. Prove that for $\forall$ $n>2$ we can erase a column from a [i]good[/i] $n$ x $n$ table so that the remaining $n$ x $(n-1)$ table is also [i]good[/i].