Find the sum of the decimal digits of the number \[ 5\sum_{k=1}^{99} k(k + 1)(k^2 + k + 1). \] [i]Proposed by Robin Park[/i]

Let $AE$ be a diameter of the circumcircle of triangle $ABC$. Join $E$ to the orthocentre, $H$, of $\triangle ABC$ and extend $EH$ to meet the circle again at $D$. Prove that the nine point circle of $\triangle ABC$ passes through the midpoint of $HD$. Note. The nine point circle of a triangle is a circle that passes through the midpoints of the sides, the feet of the altitudes and the midpoints of the line segments that join the orthocentre to the vertices.

A sequence of $2n + 1$ non-negative integers $a_1, a_2, ..., a_{2n + 1}$ is given. There's also a sequence of $2n + 1$ consecutive cells enumerated from $1$ to $2n + 1$ from left to right, such that initially the number $a_i$ is written on the $i$-th cell, for $i = 1, 2, ..., 2n + 1$. Starting from this initial position, we repeat the following sequence of steps, as long as it's possible: [i]Step 1[/i]: Add up the numbers written on all the cells, denote the sum as $s$. [i]Step 2[/i]: If $s$ is equal to $0$ or if it is larger than the current number of cells, the process terminates. Otherwise, remove the $s$-th cell, and shift shift all cells that are to the right of it one position to the left. Then go to Step 1. Example: $(1, 0, 1, \underline{2}, 0) \rightarrow (1, \underline{0}, 1, 0) \rightarrow (1, \underline{1}, 0) \rightarrow (\underline{1}, 0) \rightarrow (0)$. A sequence $a_1, a_2,. . . , a_{2n+1}$ of non-negative integers is called balanced, if at the end of this process there’s exactly one cell left, and it’s the cell that was initially enumerated by $(n + 1)$, i.e. the cell that was initially in the middle. Find the total number of balanced sequences as a function of $n$. [i]Proposed by Viktor Simjanoski, North Macedonia[/i]

Let $f,g,h : \mathbb R \to \mathbb R$ be continuous functions and \(X\) be a random variable such that $E(g(X)h(X))=0$ and $E(g(X)^2) \neq 0 \neq E(h(X)^2)$. Prove that $$E(f(X)^2) \geq \frac{E(f(X)g(X))^2}{E(g(X)^2)} + \frac{E(f(X)h(X))^2}{E(h(X)^2)}.$$ You may assume that all expected values exist. [i]Proposed by Cristi Calin[/i]

Let $p$ be an odd prime and let $Z_{p}$ denote (the field of) integers modulo $p$. How many elements are in the set \[\{x^{2}: x \in Z_{p}\}\cap \{y^{2}+1: y \in Z_{p}\}?\]

Does there exist $ 2002$ distinct positive integers $ k_1, k_2, \cdots k_{2002}$ such that for any positive integer $ n \geq 2001$, one of $ k_12^n \plus{} 1, k_22^n \plus{} 1, \cdots, k_{2002}2^n \plus{} 1$ is prime?

If quadratic equations $x^2+ax+b=0$ and $x^2+px+q=0$ share one similar root then find quadratic equation for which has roots of other roots of both quadratic equations .

Let $a < b < c < d < e$ be positive integers. Prove that $$\frac{1}{[a, b]} + \frac{1}{[b, c]} + \frac{1}{[c, d]} + \frac{2}{[d, e]} \le 1$$ where $[x, y]$ is the least common multiple of $x$ and $y$ (e.g., $[6, 10] = 30$). When does equality hold?

In an acute triangle $ABC$, let $D$, $E$, $F$ be the feet of the perpendiculars from the points $A$, $B$, $C$ to the lines $BC$, $CA$, $AB$, respectively, and let $P$, $Q$, $R$ be the feet of the perpendiculars from the points $A$, $B$, $C$ to the lines $EF$, $FD$, $DE$, respectively. Prove that $p\left(ABC\right)p\left(PQR\right) \ge \left(p\left(DEF\right)\right)^{2}$, where $p\left(T\right)$ denotes the perimeter of triangle $T$ . [i]Proposed by Hojoo Lee, Korea[/i]

Let $(a_n )_{n \ge o}$ and $(b_n )_{n \ge o}$ be sequences defined by $a_{n+2} = a_{n+1}+ a_n$ , $n = 0 , 1 , . .. $, $a_0 = 1$, $a_1 = 2$, and $b_{n+2} = b_{n+1} + b_n$ , $n = 0 , 1 , . . .$, $b_0 = 2$, $b_1 = 1$. How many integers do the sequences have in common?

Consider a $10 \times 10$ grid of squares. One day, Daniel drops a burrito in the top left square, where a wingless pigeon happens to be looking for food. Every minute, if the pigeon and the burrito are in the same square, the pigeon will eat $10\%$ of the burrito's original size and accidentally throw it into a random square (possibly the one it is already in). Otherwise, the pigeon will move to an adjacent square, decreasing the distance between it and the burrito. What is the expected number of minutes before the pigeon has eaten the entire burrito?

Solve in integers the equation \[ x^2+xy+y^2 = \left(\frac{x+y}{3}+1\right)^3. \]

Let $A$ and $B$ be points with $AB=12$. A point $P$ in the plane of $A$ and $B$ is $\textit{special}$ if there exist points $X, Y$ such that [list] [*]$P$ lies on segment $XY$, [*]$PX : PY = 4 : 7$, and [*]the circumcircles of $AXY$ and $BXY$ are both tangent to line $AB$. [/list] A point $P$ that is not special is called $\textit{boring}$. Compute the smallest integer $n$ such that any two boring points have distance less than $\sqrt{n/10}$ from each other. [i]Proposed by Michael Ren[/i]

Point $M$ is the midpoint of the hypotenuse $AB$ of a right angled triangle $ABC$. Points $P$ and $Q$ lie on segments $AM$ and $MB$ respectively and $PQ=CQ$. Prove that $AP\leq 2\cdot MQ$.

The Fibonacci numbers $F_0, F_1, F_2, . . .$ are defined inductively by $F_0=0, F_1=1$, and $F_{n+1}=F_n+F_{n-1}$ for $n \ge 1$. Given an integer $n \ge 2$, determine the smallest size of a set $S$ of integers such that for every $k=2, 3, . . . , n$ there exist some $x, y \in S$ such that $x-y=F_k$. [i]Proposed by Croatia[/i]