Let $ABC$ be an acute-angled triangle with $AB \neq BC$, $M$ the midpoint of $AC$, $N$ the point where the median $BM$ meets again the circumcircle of $\triangle ABC$, $H$ the orthocentre of $\triangle ABC$, $D$ the point on the circumcircle for which $\angle BDH = 90^{\circ}$, and $K$ the point that makes $ANCK$ a parallelogram. Prove the lines $AC$, $KH$, $BD$ are concurrent. (I. Nagel)

Evaluate \[\lim_{n\to\infty} n\int_0^\pi e^{-nx} \sin ^ 2 nx\ dx\]

Start with an angle of $60^\circ$ and bisect it, then bisect the lower $30^\circ$ angle, then the upper $15^\circ$ angle, and so on, always alternating between the upper and lower of the previous two angles constructed. This process approaches a limiting line that divides the original $60^\circ$ angle into two angles. Find the measure (degrees) of the smaller angle.

In pentagon $ABCDE$, the altitudes of triangle $ABE$ meet at point $H$. Suppose that $BCDE$ is a rectangle, and that $B$, $C$, $D$, $E$, and $H$ lie on a single circle. Prove that triangles $ABE$ and $HCD$ are congruent. [i]Alan Cheng[/i]

A regular hexagon, as shown in the attachment, is dissected into 54 congruent equilateral triangles by parallels to its sides. Within the figure we yield exactly 37 points which are vertices of at least one of those triangles. Those points are enumerated in an arbitrary way. A triangle is called [i]clocky[/i] if running in a clockwise direction from the vertex with the smallest assigned number, we pass a medium number and finally reach the vertex with the highest number. Prove that at least 19 out of 54 triangles are clocky.

Investigate the existence and uniqueness of the solution of the problem $yu_x = xu_y, u|_{x=1} =\cos y$ in a neighbourhood of the point $(1, y_0)$.

Given that $x$, $y$ are positive integers with $x(x+1)|y(y+1)$, but neither $x$ nor $x+1$ divides either of $y$ or $y+1$, and $x^2 + y^2$ as small as possible, find $x^2 + y^2$.

Given $n\geq 2$, $a_1$, $a_2$, $\cdots$, $a_n\in\mathbb {R}$ satisfy $$a_1\geqslant a_2\geqslant \cdots \geqslant a_n\geqslant 0,a_1+a_2+\cdots +a_n=n.$$ Find the minimum value of $a_1+a_1a_2+\cdots +a_1a_2\cdots a_n$.

Fow which real values of $m$ does the polynomial $x^3+1995x^2-1994x+m$ have all three roots integers?

Find all the prime number $p, q$ and r with $p < q < r$, such that $25pq + r = 2004$ and $pqr + 1 $ is a perfect square.

Find all functions $f$ from the reals to the reals such that \[f\left(f(x)+y\right)=2x+f\left(f(y)-x\right)\] for all real $x,y$.

The sum of $\lfloor x \rfloor$ for all real numbers $x$ satisfying the equation $16 + 15x + 15x^2 = \lfloor x \rfloor ^3$ is:

a) Two seventh graders and several eightth graders take part in a chess tournament. The two seventh graders together scored eight points. The scores of eightth graders are equal. How many eightth graders took part in the tournament? b) Ninth and tenth graders participated in a chess tournament. There were ten times as many tenth graders as ninth graders. The total score of tenth graders was $4.5$ times that of the ninth graders. What was the ninth graders score? Note: According to the rules of a chess tournament, each of the tournament participants ra plays one game with each of them. If one of the players wins the game, then he gets one point, and his opponent gets zero points. In case of a tie, the players receive 1/2 point.

In the figure below, points $A$, $B$, and $C$ are distance 6 from each other. Say that a point $X$ is [i]reachable[/i] if there is a path (not necessarily straight) connecting $A$ and $X$ of length at most 8 that does not intersect the interior of $\overline{BC}$. (Both $X$ and the path must lie on the plane containing $A$, $B$, and $C$.) Let $R$ be the set of reachable points. What is the area of $R$? [asy] unitsize(40); pair A = dir(90); pair B = dir(210); pair C = dir(330); dot(A); dot(B); dot(C); draw(B -- C); label("$A$", A, N); label("$B$", B, W); label("$C$", C, E); [/asy]

Let $a_{1}, a_{2}, \cdots, a_{k}$ be relatively prime positive integers. Determine the largest integer which cannot be expressed in the form \[x_{1}a_{2}a_{3}\cdots a_{k}+x_{2}a_{1}a_{3}\cdots a_{k}+\cdots+x_{k}a_{1}a_{2}\cdots a_{k-1}\] for some nonnegative integers $x_{1}, x_{2}, \cdots, x_{k}$.

A circle centered at $O{}$ passes through the vertices $B{}$ and $C{}$ of the acute-angles triangle $ABC$ and intersects the sides $AC{}$ and $AB{}$ at $D{}$ and $E{}$ respectively. The segments $CE$ and $BD$ intersect at $U{}.$ The ray $OU$ intersects the circumcircle of $ABC$ at $P{}.$ Prove that the incenters of the triangles $PEC$ and $PBD$ coincide.

Let $x_1, x_2, ..., x_{24}$ be real numbers. prove that $$x_1 + 2x_2 + 3x_3 +...+ 24x_{24} - 439 \le \frac{x^2_1+x^2_2+... + x^2_{24}}{2}+ 2011.$$

Let $A$ and $B$ be matrices of size $3\times 2$ and $2\times 3$ respectively. Suppose that $$AB =\begin{pmatrix} 8 & 2 & -2\\ 2 & 5 &4 \\ -2 &4 &5 \end{pmatrix}.$$ Show that the product $BA$ is equal to $\begin{pmatrix} 9 &0\\ 0 &9 \end{pmatrix}.$

Amy made a list of every possible distinct five-digit positive integer that can be formed using each of the digits $1, 2, 3, 4,$ and $5$ exactly once in each integer. What is the sum of the integers on Amy's list? $\mathrm{(A) \ } 3000000 \qquad \mathrm{(B) \ } 3600000 \qquad \mathrm {(C) \ } 3999960 \qquad \mathrm{(D) \ } 3999990 \qquad \mathrm{(E) \ } 5999940$

Bilbo, Gandalf, and Nitzan play the following game. First, Nitzan picks a whole number between $1$ and $2^{2022}$ inclusive and reveals it to Bilbo. Bilbo now compiles a string of length $4044$ built from the three letters $a,b,c$. Nitzan looks at the string, chooses one of the three letters $a,b,c$, and removes from the string all instances of the chosen letter. Only then is the string revealed to Gandalf. He must now guess the number Nitzan chose. Can Bilbo and Gandalf work together and come up with a strategy beforehand that will always allow Gandalf to guess Nitzan's number correctly, no matter how he acts?

$A, B, C, D, E$ points are on $\Gamma$ cycle clockwise. $[AE \cap [CD = \{M\}$ and $[AB \cap [DC = \{N\}$. The line parallels to $EC$ and passes through $M$ intersects with the line parallels to $BC$ and passes through $N$ on $K$. Similarly, the line parallels to $ED$ and passes through $M$ intersects with the line parallels to $BD$ and passes through $N$ on $L$. Show that the lines $LD$ and $KC$ intersect on $\Gamma$.

Pairwise distinct points $P_1,P_2,\ldots, P_{16}$ lie on the perimeter of a square with side length $4$ centered at $O$ such that $\lvert P_iP_{i+1} \rvert = 1$ for $i=1,2,\ldots, 16$. (We take $P_{17}$ to be the point $P_1$.) We construct points $Q_1,Q_2,\ldots,Q_{16}$ as follows: for each $i$, a fair coin is flipped. If it lands heads, we define $Q_i$ to be $P_i$; otherwise, we define $Q_i$ to be the reflection of $P_i$ over $O$. (So, it is possible for some of the $Q_i$ to coincide.) Let $D$ be the length of the vector $\overrightarrow{OQ_1} + \overrightarrow{OQ_2} + \cdots + \overrightarrow{OQ_{16}}$. Compute the expected value of $D^2$. [i]Ray Li[/i]

$ABCD$ is a convex quadrilateral, both $\angle ABC$ and $\angle BCD$ acute. $E$ is a point inside $ABCD$ satisfying $AE=DE$, and $X, Y$ are the intersection of $AD$ and $CE, BE$ respectively, but not $X=A$ or $Y=D$. If $ABEX$ and $CDEY$ are both inscribed quadrilaterals, prove that the distance between $E$ and the lines $AB, BC, CD$ are all equal.

For $\alpha \in (0,1)$ we consider the equation $\{x\{x\}\}= \alpha$. a) Prove that the equation has rational solutions if and only if there exist $m,p,q\in\mathbb{Z}$, $0<p<q$, $\gcd(p,q)=1$, such that $\alpha = \left( \frac pq\right)^2 + \frac mq$. b) Find a solution for $\alpha = \frac {2004}{2005^2}$.

Let $M$ be the midpoint of cathetus $AB$ of triangle $ABC$ with right angle $A$. Point $D$ lies on the median $AN$ of triangle $AMC$ in such a way that the angles $ACD$ and $BCM$ are equal. Prove that the angle $DBC$ is also equal to these angles.