A tournament of order $n$, $n \in \mathbb{N}$, consists of $2^n$ players, which are numbered with $1, 2, \ldots, 2^n$, and has $n$ rounds. In each round, the remaining players paired with each other to play a match and the winner from each match advances to the next round. The winner of the $n$-th round is considered the winner of the tournament. Two tournaments are considered different if there is a match that took place in the $k$-th round of one tournament, but not in the $k$-th round of the other, or if the tournaments have different winners. Determine how many different tournaments of order $n$ there are with the property that in each round, the sum of the numbers of the players in each match is the same (but not necessarily the same for all rounds).

Determine all pairs of positive integers $(a,b)$, such that the roots of the equations \[x^2-ax+a+b-3=0,\] \[x^2-bx+a+b-3=0,\] are also positive integers.

Let $ABC$ be an acute-angled triangle, and let $F$ be the foot of its altitude from the vertex $C$. Let $M$ be the midpoint of the segment $CA$. Assume that $CF=BM$. Then the angle $MBC$ is equal to angle $FCA$ if and only if the triangle $ABC$ is equilateral.

Let $n$ be a positive integer. In a village, $n$ boys and $n$ girls are living. For the yearly ball, $n$ dancing couples need to be formed, each of which consists of one boy and one girl. Every girl submits a list, which consists of the name of the boy with whom she wants to dance the most, together with zero or more names of other boys with whom she wants to dance. It turns out that $n$ dancing couples can be formed in such a way that every girl is paired with a boy who is on her list. Show that it is possible to form $n$ dancing couples in such a way that every girl is paired with a boy who is on her list, and at least one girl is paired with the boy with whom she wants to dance the most.

The point $K{}$ is the middle of the arc $BAC$ of the circumcircle of the triangle $ABC$. The point $I{}$ is the center of its inscribed circle $\omega$. The line $KI$ intersects the circumcircle of the triangle $ABC$ at $T{}$ for the second time. Prove that the circle passing through the midpoints of the segments $BC, BT$ and $CT$ is tangent to the circle which is symmetric to $\omega$ with respect to $BC$.

Find all solutions to \[ (abcde)^2 = a^2+b^2+c^2+d^2+e^2+f^2. \] in integers. Proposed by [i]Seongjin Shim[/i]

What is the remainder when $x^{51}+51$ is divided by $x+1$? $ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 49 \qquad\textbf{(D)}\ 50 \qquad\textbf{(E)}\ 51 $

Prove that if \( a \), \( b \), and \( c \) are positive real numbers, then the following inequality holds: \[ \frac{a + 3c}{a + b} + \frac{c + 3a}{b + c} + \frac{4b}{c + a} \geq 6. \]

Let $S$ be a subset of $\{1, 2, 3, \cdots, 1989 \}$ in which no two members differ by exactly $4$ or by exactly $7$. What is the largest number of elements $S$ can have?

For a function $ f(x)\equal{}(\ln x)^2\plus{}2\ln x$, let $ C$ be the curve $ y\equal{}f(x)$. Denote $ A(a,\ f(a)),\ B(b,\ f(b))\ (a<b)$ the points of tangency of two tangents drawn from the origin $ O$ to $ C$ and the curve $ C$. Answer the following questions. (1) Examine the increase and decrease, extremal value and inflection point , then draw the approximate garph of the curve $ C$. (2) Find the values of $ a,\ b$. (3) Find the volume by a rotation of the figure bounded by the part from the point $ A$ to the point $ B$ and line segments $ OA,\ OB$ around the $ y$-axis.

a) Prove that \[ \dfrac{1}{2} \plus{} \dfrac{1}{3} \plus{} ... \plus{} \dfrac{1}{2^{2n}} > n, \] for all positive integers $ n$. b) Prove that for every positive integer $ n$ we have $ \min\left\{ k \in \mathbb{Z}, k\geq 2 \mid \dfrac{1}{2} \plus{} \dfrac{1}{3} \plus{} \cdots \plus{} \dfrac{1}{k}>n \right\} > 2^n$.

Postman Pete has a pedometer to count his steps. The pedometer records up to $ 99999$ steps, then flips over to $ 00000$ on the next step. Pete plans to determine his mileage for a year. On January $ 1$ Pete sets the pedometer to $ 00000$. During the year, the pedometer flips from $ 99999$ to $ 00000$ forty-four times. On December $ 31$ the pedometer reads $ 50000$. Pete takes $ 1800$ steps per mile. Which of the following is closest to the number of miles Pete walked during the year? $ \textbf{(A)}\ 2500 \qquad \textbf{(B)}\ 3000 \qquad \textbf{(C)}\ 3500 \qquad \textbf{(D)}\ 4000 \qquad \textbf{(E)}\ 4500$

The altitudes $AA_1$, $BB_1$ and $CC_1$ are drawn in the acute triangle $ABC$. The bisector of the angle $AA_1C$ intersects the segments $CC_1$ and $CA$ at $E$ and $D$ respectively. The bisector of the angle $AA_1B$ intersects the segments $BB_1$ and $BA$ at $F$ and $G$ respectively. The circumcircles of the triangles $FA_1D$ and $EA_1G$ intersect at $A_1$ and $X$. Prove that $\angle BXC=90^{\circ}$.

There is an equilateral triangle $ABC$ on the plane. Three straight lines pass through $A$, $B$ and $C$, respectively, such that the intersections of these lines form an equilateral triangle inside $ABC$. On each turn, Ming chooses a two-line intersection inside $ABC$, and draws the straight line determined by the intersection and one of $A$, $B$ and $C$ of his choice. Find the maximum possible number of three-line intersections within $ABC$ after 300 turns. [i] Proposed by usjl[/i]

Let $\triangle ABC$ be a triangle with $AB =AC$ and $\angle BAC = 20^{\circ}$. Let $D$ be point on the side $AB$ such that $\angle BCD = 70^{\circ}$. Let $E$ be point on the side $AC$ such that $\angle CBE = 60^{\circ}$. Determine the value of angle $\angle CDE$.

Let $ABC$ be a triangle with $\angle A<90^o, AB \ne AC$. Denote $H$ the orthocenter of triangle $ABC$, $N$ the midpoint of segment $[AH]$, $M$ the midpoint of segment $[BC]$ and $D$ the intersection point of the angle bisector of $\angle BAC$ with the segment $[MN]$. Prove that $<ADH=90^o$

An isosceles right-angled triangle $ABC$ is given. On the extensions of sides $AB$ and $AC$, behind vertices $B$ and $C$ equal segments $BK$ and $CL$ were laid. $E$ and F are the points of intersection of the segment $KL$ and the lines perpendicular to the $KC$ , passing through the points $B$ and $A$, respectively. Prove that $EF = FL$.

Let $ABCDEF$ be a convex hexagon. The diagonal $AC$ is cut by $BF$ and $BD$ at points $P$ and $Q$, respectively. The diagonal $CE$ is cut by $DB$ and $DF$ at points $R$ and $S$, respectively. The diagonal $EA$ is cut by $FD$ and $FB$ at points $T$ and $U$, respectively. It is known that each of the seven triangles $APB, PBQ, QBC, CRD, DRS, DSE$ and $AUF$ has area $1$. Find the area of the hexagon $ABCDEF$.

There are $12$ candies on the table, four of which are rare candies. Chad has a friend who can tell rare candies apart from regular candies, but Chad can’t. Chad’s friend is allowed to take four candies from the table, but may not take any rare candies. Can his friend always take four candies in such a way that Chad will then be able to identify the four rare candies? If so, describe a strategy. If not, prove that it cannot be done. Note that Chad does not know anything about how the candies were selected (e.g. the order in which they were selected). However, Chad and his friend may communicate beforehand.

The parabolas $y=x^2+15x+32$ and $x = y^2+49y+593$ meet at one point $(x_0,y_0)$. Find $x_0+y_0$.

Find all functions $f : \mathbb N \to \mathbb N$ such that: i) $f^{2000}(m)=f(m)$ for all $m \in \mathbb N$, ii) $f(mn)=\dfrac{f(m)f(n)}{f(\gcd(m,n))}$, for all $m,n\in \mathbb N$, and iii) $f(m)=1$ if and only if $m=1$.

For every $m \geq 2$, let $Q(m)$ be the least positive integer with the following property: For every $n \geq Q(m)$, there is always a perfect cube $k^3$ in the range $n < k^3 \leq m \cdot n$. Find the remainder when \[ \sum_{m = 2}^{2017} Q(m) \] is divided by 1000.

For any integer $d > 0,$ let $f(d)$ be the smallest possible integer that has exactly $d$ positive divisors (so for example we have $f(1)=1, f(5)=16,$ and $f(6)=12$). Prove that for every integer $k \geq 0$ the number $f\left(2^k\right)$ divides $f\left(2^{k+1}\right).$ [i]Proposed by Suhaimi Ramly, Malaysia[/i]

We have an a sequence such that $a_n = 2 \cdot 10^{n + 1} + 19$. Determine all the primes $p$, with $p \le 19$, for which there exists some $n \ge 1$ such that $p$ divides $a_n$.

In a scalene triangle $ABC$ with incenter $I$, the incircle is tangent to sides $CA$ and $AB$ at points $E$ and $F$. The tangents to the circumcircle of triangle $AEF$ at $E$ and $F$ meet at $S$. Lines $EF$ and $BC$ intersect at $T$. Prove that the circle with diameter $ST$ is orthogonal to the nine-point circle of triangle $BIC$. [i]Proposed by Evan Chen[/i]