For what value of $ n$ is $ i\plus{}2i^2\plus{}3i^3\plus{}\cdots\plus{}ni^n\equal{}48\plus{}49i$? Note: here $ i\equal{}\sqrt{\minus{}1}$. $ \textbf{(A)}\ 24 \qquad \textbf{(B)}\ 48 \qquad \textbf{(C)}\ 49 \qquad \textbf{(D)}\ 97 \qquad \textbf{(E)}\ 98$

A rabbit, a skunk and a turtle are running a race. The skunk finishes the race in 6 minutes. The rabbit runs 3 times as quickly as the skunk. The rabbit runs 5 times as quickly as the turtle. How long does the turtle take to finish the race?

Prove that every positive rational number can be expressed uniquely as a finite sum of the form $$a_1+\frac{a_2}{2!}+\frac{a_3}{3!}+\dots+\frac{a_n}{n!},$$ where $a_n$ are integers such that $0 \leq a_n \leq n-1$ for all $n > 1$.

Let $G$ be a finite group with $n$ elements and $K$ a subset of $G$ with more than $\frac{n}{2}$ elements. Show that for any $g\in G$ one can find $h,k\in K$ such that $g=h\cdot k$.

The circumference of a circle is divided into $45$ arcs, each of length $1.$ Initially, there are $15$ snakes, each of length $1,$ occupying every third arc. Every second, each snake independently moves either one arc left or one arc right, each with probability $\tfrac{1}{2}.$ If two snakes ever touch, they merge to form a single snake occupying the arcs of both of the previous snakes, and the merged snake moves as one snake. Compute the expected number of seconds until there is only one snake left.

The sum of the reciprocals of the roots of the equation $ ax^2 \plus{} bx \plus{} c \equal{} 0$ is: $ \textbf{(A)}\ \frac {1}{a} \plus{} \frac {1}{b} \qquad \textbf{(B)}\ \minus{} \frac {c}{b} \qquad \textbf{(C)}\ \frac {b}{c} \qquad \textbf{(D)}\ \minus{} \frac {a}{b} \qquad \textbf{(E)}\ \minus{} \frac {b}{c}$

A positive integer $n$ is divisible by $3$ and $5$, but not by $2$. If $n > 20$, what is the smallest possible value of $n$?

Let $a,\ b$ be positive constants. Evaluate \[\int_0^1 \frac{\ln \frac{(x+a)^{x+a}}{(x+b)^{x+b}}}{(x+a)(x+b)\ln (x+a)\ln (x+b)}\ dx.\]

The Baltic Sea has $2016$ harbours. There are two-way ferry connections between some of them. It is impossible to make a sequence of direct voyages $C_1 - C_2 - ... - C_{1062}$ where all the harbours $C_1, . . . , C_{1062}$ are distinct. Prove that there exist two disjoint sets $A$ and $B$ of $477$ harbours each, such that there is no harbour in $A$ with a direct ferry connection to a harbour in $B.$

Sammy has a wooden board, shaped as a rectangle with length $2^{2014}$ and height $3^{2014}$. The board is divided into a grid of unit squares. A termite starts at either the left or bottom edge of the rectangle, and walks along the gridlines by moving either to the right or upwards, until it reaches an edge opposite the one from which the termite started. Depicted below are two possible paths of the termite. [img]https://cdn.artofproblemsolving.com/attachments/3/0/39f3b2aa9c61ff24ffc22b968790f4c61da6f9.png[/img] The termite’s path dissects the board into two parts. Sammy is surprised to find that he can still arrange the pieces to form a new rectangle not congruent to the original rectangle. This rectangle has perimeter $P$. How many possible values of $P$ are there?

Some of the points in the plane are white and some are blue (every point of the plane is either white or blue). Prove that for every positive number $r$: (a) there are at least two points with different color such that the distance between them is equal to $r$; (b) there are at least two points with the same color and the distance between them is equal to $r$; (c) will the statements above be true if the plane is replaced with the real line?

If $i^2=-1$, then $(1+i)^{20}-(1-i)^{20}$ equals $ \textbf{(A)}\ -1024 \qquad\textbf{(B)}\ -1024i \qquad\textbf{(C)}\ 0 \qquad\textbf{(D)}\ 1024 \qquad\textbf{(E)}\ 1024i $

Given $a\in\mathbb{R}$ and a sequence $(u_n)$ defined by \[ \begin{cases} u_1=a\\ u_{n+1}=\frac{1}{2}+\sqrt{\frac{2n+3}{n+1}u_n+\frac{1}{4}}\quad\forall n\in\mathbb{N}^* \end{cases} \] a) Prove that $(u_n)$ is convergent sequence when $a=5$ and find the limit of the sequence in that case b) Find all $a$ such that the sequence $(u_n)$ is exist and is convergent.

Let $a>1$ be an integer which is not divisible by four. Prove that there are infinitely many primes $p$ of the form $4k-1$ such that $p | a^d-1$ for some $d<\frac{p-1}{2}$

A village has a circular wall around it, and the wall has four gates pointing north, south, east and west. A tree stands outside the village, $16 \, \mathrm{m}$ north of the north gate, and it can be [i]just[/i] seen appearing on the horizon from a point $48 \, \mathrm{m}$ east of the south gate. What is the diamter in meters, of the wall that surrounds the village?

Show that $n$ divides $2^n + 1$ for infinitely many positive integers $n$.

Given a scalene triangle $ABC$. Incircle of $\triangle{ABC{}}$ touches the sides $AB$ and $BC$ at points $C_1$ and $A_1$ respectively, and excircle of $\triangle{ABC}$ (on side $AC$) touches $AB$ and $BC$ at points $ C_2$ and $A_2$ respectively. $BN$ is bisector of $\angle{ABC}$ ($N$ lies on $BC$). Lines $A_1C_1$ and $A_2C_2$ intersects the line $AC$ at points $K_1$ and $K_2$ respectively. Let circumcircles of $\triangle{BK_1N}$ and $\triangle{BK_2N}$ intersect circumcircle of a $\triangle{ABC}$ at points $P_1$ and $P_2$ respectively. Prove that $AP_1$=$CP_2$

Let $AA_1, BB_1, CC_1$ be the altitudes of triangle $ABC$, and $A0, C0$ be the common points of the circumcircle of triangle $A_1BC_1$ with the lines $A_1B_1$ and $C_1B_1$ respectively. Prove that $AA_0$ and $CC_0$ meet on the median of ABC or are parallel to it

Find the intersection of all sets of consecutive positive integers having at least four elements and the sum of elements equal to $2001$.

Find all real numbers $a, b, c$ such that $x^3 + ax^2 + bx + c$ has three real roots $\alpha, \beta,\gamma$ (not necessarily all distinct) and the equation $x^3 + \alpha^3 x^2 + \beta^3 x + \gamma^3$ has roots $\alpha^3, \beta^3,\gamma^3$ .

a) Find all integer pairs $(x,y)$ satisfying $x^4+(y+2)^3=(x+2)^4.$ b) Prove that: if $p$ is a prime of the form $p=4k+3$ $(k$ is a non-negative number$),$ then there doesn's exist $p-1$ consecutive non-negative integers such that we can divide the set of these numbers into $2$ distinct subsets so that the product of all the numbers in one subset is equal to that in the remained subset.

In a school, more than $90\% $ of the students know both English and German, and more than $90\%$ percent of the students know both English and French. Prove that more than $90\%$ percent of the students who know both German and French also know English.

$$Problem 4 $$ Straight lines $k,l,m$ intersecting each other in three different points are drawn on a classboard. Bob remembers that in some coordinate system the lines$ k,l,m$ have the equations $y = ax, y = bx$ and $y = c +2\frac{ab}{a+b}x$ (where $ab(a + b)$ is non zero). Misfortunately, both axes are erased. Also, Bob remembers that there is missing a line $n$ ($y = -ax + c$), but he has forgotten $a,b,c$. How can he reconstruct the line $n$?

Let $A_1,$ $B_1$, $C_1$ be the touchpoints of the circle inscribed in the acute triangle $ABC$ ($A_1$ is the touchpoint with the side $BC$, etc.). Let $A_2$, $B_2$, $C_2$ be the intersection points of the altitudes of triangles $AB_1C_1$, $A_1BC_1$ and $A_1B_1C$ respectively. Prove that the lines $A_1A_2$ and $B_1B_2$ and $C_1C_2$ intersect at one point.

Let $n$ be a positive integer and $t$ be a non-zero real number. Let $a_1, a_2, \ldots, a_{2n-1}$ be real numbers (not necessarily distinct). Prove that there exist distinct indices $i_1, i_2, \ldots, i_n$ such that, for all $1 \le k, l \le n$, we have $a_{i_k} - a_{i_l} \neq t$.