Dan has a fair $6$-sided die with faces labeled $1,2,3,4,+,$ and $-.$ In order to complete the equation \[ \underline{\qquad} \ \underline{\qquad} \ \underline{\qquad}=\underline{\qquad}, \] Dan repeatedly rolls his die and fills in a blank with the character he obtained, starting with the leftmost blank and progressing rightward. The probability that, when all blanks are filled, Dan forms a true equation, is $\frac{p}{q},$ where $p$ and $q$ are relatively prime integers. Find $p+q.$

Find all positive integers $k$ for which there is an irrational $\alpha>1$ and a positive integer $N$ such that $\left\lfloor\alpha^{n}\right\rfloor$ is of the form $m^2-k$ com $m \in \mathbb{Z}$ for every integer $n>N$.

The incircle of a triangle $ABC$ is centered at $I$ and touches $AC,AB$ and $BC$ at points $K,L,M$, respectively. The median $BB_1$ of $\triangle ABC$ intersects $MN$ at $D$. Prove that the points $I,D,K$ are collinear.

The number of postive integers less than $1000$ divisible by neither $5$ nor $7$ is: $\text{(A)}\ 688 \qquad \text{(B)}\ 686\qquad \text{(C)}\ 684 \qquad \text{(D)}\ 658\qquad \text{(E)}\ 630$

Let $a,b$ be integers with $0<a<b$. A set $\{x,y,z\}$ of non-negative integers is [i]olympic[/i] if $x<y<z$ and if $\{z-y,y-x\}=\{a,b\}$. Show that the set of all non-negative integers is the union of pairwise disjoint olympic sets.

What is the value of \[\frac{2^{2014}+2^{2012}}{2^{2014}-2^{2012}}?\] $ \textbf{(A)}\ -1\qquad\textbf{(B)}\ 1\qquad\textbf{(C)}\ \frac{5}{3}\qquad\textbf{(D)}\ 2013\qquad\textbf{(E)}\ 2^{4024} $

The game of circulate is played with a deck of $kn$ cards each with a number in $1,2,\ldots,n$ such that there are $k$ cards with each number. First, $n$ piles numbered $1,2,\ldots,n$ of $k$ cards each are dealt out face down. The player then flips over a card from pile $1$, places that card face up at the bottom of the pile, then next flips over a card from the pile whose number matches the number on the card just flipped. The player repeats this until he reaches a pile in which every card has already been flipped and wins if at that point every card has been flipped. Hamster has grown tired of losing every time, so he decides to cheat. He looks at the piles beforehand and rearranges the $k$ cards in each pile as he pleases. When can Hamster perform this procedure such that he will win the game? [i]Brian Hamrick.[/i]

Consider a non-zero real number $a$ such that $\{a\} + \left\{\frac{1}{a}\right\}=1$, where $\{x\}$ denotes the fractional part of $x$. Prove that for any positive integer $n$, $\{a^n\} + \left\{\frac{1}{a^n}\right\}= 1$.

$\triangle ABC$ is a triangle and $D,E,F$ are points on $BC$, $CA$, $AB$ respectively. It is given that $BF=BD$, $CD=CE$ and $\angle BAC=48^{\circ}$. Find the angle $\angle EDF$ $ \textbf{(A) }64^{\circ}\qquad\textbf{(B) }66^{\circ}\qquad\textbf{(C) }68^{\circ}\qquad\textbf{(D) }70^{\circ}\qquad\textbf{(E) }72^{\circ} $

$F$* is the multiplicative group of the field $F$. $F$* is of finitely generated. Is it true that $F$* is cyclic? Additional question: (wasn’t at the olympiad) $K$* is the multiplicative group of the field $K$. $L \subseteq $$K$* is a finitely generated subgroup. Is it true that $L$ is cyclic?

An acute isosceles triangle, $ABC$ is inscribed in a circle. Through $B$ and $C$, tangents to the circle are drawn, meeting at point $D$. If $\angle ABC=\angle ACB=2\angle D$ and $x$ is the radian measure of $\angle A$, then $x=$ [asy] defaultpen(linewidth(0.7)+fontsize(10)); real x=180/7; pair D=origin, B=dir(3x), C=dir(4x), A=intersectionpoint(C--C+dir(2x), B--B+dir(5x)), O=circumcenter(A,B,C); markscalefactor=0.015; draw(B--C--D--B--A--C^^Circle(O, abs(O-C))^^anglemark(C,A,B)); dot(A^^B^^C^^D); pair point=O; label("$A$", A, dir(point--A)); label("$B$", B, dir(point--B)); label("$C$", C, dir(point--C)); label("$D$", D, dir(point--D)); label("$x$", A+0.1*dir(270), S);[/asy] $\text{(A)} \ \frac37\pi \qquad \text{(B)} \ \frac49\pi \qquad \text{(C)} \ \frac5{11}\pi \qquad \text{(D)} \ \frac6{13}\pi \qquad \text{(E)} \ \frac7{15}\pi$

The number of digits in the number $N=2^{12}\times 5^8$ is $\textbf{(A) }9\qquad\textbf{(B) }10\qquad\textbf{(C) }11\qquad\textbf{(D) }12\qquad \textbf{(E) }20$

Supppose five points in a plane are situated so that no two of the straight lines joining them are parallel, perpendicular, or coincident. From each point perpendiculars are drawn to all the lines joining the other four points. Determine the maxium number of intersections that these perpendiculars can have.

Consider a rectangular sheet of paper $ABCD$ such that the lengths of $AB$ and $AD$ are respectively $7$ and $3$ centimetres. Suppose that $B'$ and $D'$ are two points on $AB$ and $AD$ respectively such that if the paper is folded along $B'D'$ then $A$ falls on $A'$ on the side $DC$. Determine the maximum possible area of the triangle $AB'D'$.

There are $n$ people at a party. Prove that there are two people such that, of the remaining $n-2$ people, there are at least $\left\lfloor\frac{n}{2}\right\rfloor-1$ of them, each of whom either knows both or else knows neither of the two. Assume that knowing is a symmetric relation, and that $\lfloor x\rfloor$ denotes the greatest integer less than or equal to $x$.

Let $ABCD$ be a square with diagonals $AC$ and $BD$, and $P$ a point in one of the sides of the square. Show that the sum of the distances from P to the diagonals is constant.

Given a string of at least one character in which each character is either A or B, Kathryn is allowed to make these moves: [list] [*] she can choose an appearance of A, erase it, and replace it with BB, or [*] she can choose an appearance of B, erase it, and replace it with AA. [/list] Kathryn starts with the string A. Let $a_n$ be the number of strings of length $n$ that Kathryn can reach using a sequence of zero or more moves. (For example, $a_1=1$, as the only string of length 1 that Kathryn can reach is A.) Then $\sum_{n=1}^{\infty} \frac{a_n}{5^n} = \frac{m}{n}$, where $m$ and $n$ are positive integers with $\gcd(m,n)=1$. Compute $100m+n$. [i]Proposed by Luke Robitaille[/i]

Let $O$ be an inner point of an acute-angled triangle $ABC$. Let $A_1, B_1$ and $C_1$ be the projections of $O$ on the sides $BC, AC$ and $AB$ respectively . Let $P$ be the intersection of the perpendiculars on $B_1C_1$ and $A_1C_1$ from points$ A$ and $B$ respectilvey. Let $H$ be the projection of $P$ on $AB$. Show that points $A_1, B_1, C_1$ and $H$ lie on a circle.

A model used to estimate the time it will take to hike to the top of the mountain on a trail is of the form $T = aL + bG,$ where $a$ and $b$ are constants, $T$ is the time in minutes, $L$ is the length of the trail in miles, and $G$ is the altitude gain in feet. The model estimates that it will take $69$ minutes to hike to the top if a trail is $1.5$ miles long and ascends $800$ feet, as well as if a trail is $1.2$ miles long and ascends $1100$ feet. How many minutes does the model estimate it will take to hike to the top if the trail is $4.2$ miles long and ascends $4000$ feet? $\textbf{(A) } 240 \qquad \textbf{(B) } 246 \qquad \textbf{(C) } 252 \qquad \textbf{(D) } 258 \qquad \textbf{(E) } 264$

On side $BC$ of parallelogram $ABCD$ ($A$ is acute) lies point $T$ so that triangle $ATD$ is an acute triangle. Let $O_1$, $O_2$, and $O_3$ be the circumcenters of triangles $ABT$, $DAT$, and $CDT$ respectively. Prove that the orthocenter of triangle $O_1O_2O_3$ lies on line $AD$.

For $ n \in \mathbb{N}$, let $ f(n)\equal{}1^n\plus{}2^{n\minus{}1}\plus{}3^{n\minus{}2}\plus{}...\plus{}n^1$. Determine the minimum value of: $ \frac{f(n\plus{}1)}{f(n)}.$

For positive real $x$, let $$B_n(x)=1^x+2^x+\ldots+n^x.$$Prove or disprove the convergence of $$\sum_{n=2}^\infty\frac{B_n(\log_n2)}{(n\log_2n)^2}.$$

We consider the set of expressions that can be written with real numbers, $\pm$, $+$, $\times$, and parenthesis, such that if each $\pm$ is independently replaced with either $+$ or $-$, we are left with a valid arithmetic expression. For example, this includes: \[0\pm 1, 1 \pm 2, 1+2\times (1+2\pm 3), (1 \pm 2) \times (3 \pm 4).\] We define the [i]range[/i] of an expression of this form to be the set of all of the possible values when replacing each $\pm$ with either a $+$ or a $-$. For example, [list] [*] $1 \pm 2$ has range $\{-1,3\}$, since $1-2=-1$ and $1+2=3$. [*] $(1 \pm 1) \times (1 \pm 1)$ has range $\{0,4\}$, since $(1-1)(1-1)=(1-1)(1+1)=(1+1)(1-1)=0$ and $(1+1)(1+1)=4.$ [*] $(1 \pm 2)(3\pm 4)$ has range $\{-7,-3,1,21\}$, since $(1-2)(3+4)=-7$, $(1+2)(3-4)=-3$, $(1-2)(3-4)=1$, and $(1+2)(3+4)=21$. [/list] We will prove that every finite nonempty set of real numbers is the range of some expression of this form. Call a nonempty set of real numbers [i]good[/i] if it is the range of some expression of this form. (a) For each of the following sets, find an expression with a range equal to the given set. You do not need to justify the expression. [list=i] [*] $\{1\}$ [*] $\{1,3\}$ [*] $\{-1,0,1\}$ [/list] (b) Prove that if $S$ and $T$ are good sets, the product set $S \cdot T = \{ xy \mid x \in S, y \in T \}$ (the set of product of elements of $S$ with elements of $T$) is good. (c) Prove that if a set $S$ not containing $0$ is good, the set $S \cup \{ 0 \}$ (obtained upon adding $0$ to $S$) is good. (d) Prove that every finite nonempty set of real numbers is good.

Let $n\geqslant 3$ be a positive integer. A circular necklace is called [i]fun[/i] if it has $n{}$ black beads and $n{}$ white beads. A move consists of cutting out a segment of consecutive beads and reattaching it in reverse. Prove that it is possible to change any fun necklace into any other fun necklace using at most $(n-1)$ moves. [i]Note:[/i] Necklaces related by rotations or reflections are considered to be the same. [i]Proposed by Dylan Toh[/i]

For non-coplanar points are given in space. A plane $\pi$ is called [i]equalizing [/i] if all four points have the same distance from $\pi$. Find the number of equilizing planes.