The following figure shows a [i]walk[/i] of length 6: [asy] unitsize(20); for (int x = -5; x <= 5; ++x) for (int y = 0; y <= 5; ++y) dot((x, y)); label("$O$", (0, 0), S); draw((0, 0) -- (1, 0) -- (1, 1) -- (0, 1) -- (-1, 1) -- (-1, 2) -- (-1, 3)); [/asy] This walk has three interesting properties: [list] [*] It starts at the origin, labelled $O$. [*] Each step is 1 unit north, east, or west. There are no south steps. [*] The walk never comes back to a point it has been to.[/list] Let's call a walk with these three properties a [i]northern walk[/i]. There are 3 northern walks of length 1 and 7 northern walks of length 2. How many northern walks of length 6 are there?

Each point of the 3-dimensional space is coloured with exactly one of the colours red, green and blue. Let $R$, $G$ and $B$, respectively, be the sets of the lengths of those segments in space whose both endpoints have the same colour (which means that both are red, both are green and both are blue, respectively). Prove that at least one of these three sets includes all non-negative reals.

A set $S$ is constructed as follows. To begin, $S=\{0,10\}$. Repeatedly, as long as possible, if $x$ is an integer root of some polynomial $a_nx^n+a_{n-1}x^{n-1}+\cdots+a_1x+a_0$ for some $n\geq 1$, all of whose coefficients $a_i$ are elements of $S$, then $x$ is put into $S$. When no more elements can be added to $S$, how many elements does $S$ have? $\textbf{(A) } 4 \qquad \textbf{(B) } 5 \qquad \textbf{(C) } 7 \qquad \textbf{(D) } 9 \qquad \textbf{(E) } 11$

Let $\vartriangle ABC$ be a triangle in which $\angle ACB = 40^o$ and $\angle BAC = 60^o$ . Let $D$ be a point inside the segment $BC$ such that $CD =\frac{AB}{2}$ and let $M$ be the midpoint of the segment $AC$. How much is the angle $\angle CMD$ in degrees?

Given an acute triangle $ PBC$ with $ PB\neq PC.$ Points $ A,D$ lie on $ PB,PC,$ respectively. $ AC$ intersects $ BD$ at point $ O.$ Let $ E,F$ be the feet of perpendiculars from $ O$ to $ AB,CD,$ respectively. Denote by $ M,N$ the midpoints of $ BC,AD.$ $ (1)$: If four points $ A,B,C,D$ lie on one circle, then $ EM\cdot FN \equal{} EN\cdot FM.$ $ (2)$: Determine whether the converse of $ (1)$ is true or not, justify your answer.

Let $ABDC$ be a cyclic quadrilateral inscribed in a circle $\Omega$. $AD$ meets $BC$ at $P$, and $\Omega$ meets lines passing $A$ and parallel to $DB$, $DC$ at $E$, $F$, respectively. $X$ is a point on $\Omega$ such that $PA=PX$. Prove that the lines $BE$, $CF$, and $DX$ are concurrent.

Alice and the Cheshire Cat play a game. At each step, Alice either (1) gives the cat a penny, which causes the cat to change the number of (magic) beans that Alice has from $ n$ to $ 5n$ or (2) gives the cat a nickel, which causes the cat to give Alice another bean. Alice wins (and the cat disappears) as soon as the number of beans Alice has is greater than $ 2008$ and has last two digits $ 42$. What is the minimum number of cents Alice can spend to win the game, assuming she starts with 0 beans?

If ${\cos^5 x}-{\sin^5 x}<7({\sin^3 x}-{\cos ^3 x}) $ (for $x\in [ 0,2\pi) $), then find the range of $x$.

Suppose $a,b,c$ are the side lengths of a triangle $ABC$. Show that $$x=\sqrt{a(b+c-a)}, y=\sqrt{b(c+a-b)}, z=\sqrt{c(a+b-c)}$$ are the side lengths of an acute-angled triangle $XYZ$, with the same area as $ABC$, but with a smaller perimeter, unless $ABC$ is equilateral.

A positive integer $N$ is called [i]northern[/i] if for each digit $d > 0$, there exists a divisor of $N$ whose last digit is $d$. How many [i]northern [/i] numbers less than $2016$ are there with the fewest number of divisors as possible?

The points $C$ and $D$ lie on a halfline from the midpoint $M$ of a segment $AB$, so that $|AC| = |BD|$. Prove that the angles $u = \angle ACM$ and $v = \angle BDM$ are equal. [img]https://1.bp.blogspot.com/-tQEJ1VBCa8U/XzT7IhwlZHI/AAAAAAAAMVI/xpRdlj5Rl64VUt_tCRsQ1UxIsv_SGrMlACLcBGAsYHQ/s0/2014%2BMohr%2Bp3.png[/img]

Does there exist a sequence $a_1,a_2,a_3,\ldots $ of positive integers such that the sum of every $n$ consecutive elements is divisible by $n^2$ for every positive integer $n$?

If $ x$, $ y$, and $ z$ are positive with $ xy \equal{} 24$, $ xz \equal{} 48$, and $ yz \equal{} 72$, then $ x \plus{} y \plus{} z$ is $ \textbf{(A) }18\qquad\textbf{(B) }19\qquad\textbf{(C) }20\qquad\textbf{(D) }22\qquad\textbf{(E) }24$

At the Berkeley Math Tournament, teams are composed of $6$ students, each of whom pick two distinct subject tests out of $5$ choices. How many different distributions across subjects are possible for a team?

On an algebra quiz, $10\%$ of the students scored $70$ points, $35\%$ scored $80$ points, $30\%$ scored $90$ points, and the rest scored $100$ points. What is the difference between the mean and median score of the students' scores on this quiz? ${ \textbf{(A)}\ 1\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 3\qquad\textbf{(D)}}\ 4\qquad\textbf{(E)}\ 5$

Let $n$ and $k$ be positive integers, with $n\geq k+1$. There are $n$ countries on a planet, with some pairs of countries establishing diplomatic relations between them, such that each country has diplomatic relations with at least $k$ other countries. An evil villain wants to divide the countries, so he executes the following plan: (1) First, he selects two countries $A$ and $B$, and let them lead two allies, $\mathcal{A}$ and $\mathcal{B}$, respectively (so that $A\in \mathcal{A}$ and $B\in\mathcal{B}$). (2) Each other country individually decides wether it wants to join ally $\mathcal{A}$ or $\mathcal{B}$. (3) After all countries made their decisions, for any two countries with $X\in\mathcal{A}$ and $Y\in\mathcal{B}$, eliminate any diplomatic relations between them. Prove that, regardless of the initial diplomatic relations among the countries, the villain can always select two countries $A$ and $B$ so that, no matter how the countries choose their allies, there are at least $k$ diplomatic relations eliminated. [i]Proposed by YaWNeeT.[/i]