In a triangle $ABC$, let $H$ be its orthocenter, $O$ its circumcenter, and $R$ its circumradius. Prove that: [b](a)[/b] $|OH| = R \sqrt{1-8 \cos \alpha \cdot \cos \beta \cdot \cos \gamma}$ where $\alpha, \beta, \gamma$ are angles of the triangle $ABC;$ [b](b)[/b] $O \equiv H$ if and only if $ABC$ is equilateral.

Let $D$ be the midpoint of the side $[BC]$ of the triangle $ABC$ with $AB \ne AC$ and $E$ the foot of the altitude from $BC$. If $P$ is the intersection point of the perpendicular bisector of the segment line $[DE]$ with the perpendicular from $D$ onto the the angle bisector of $BAC$, prove that $P$ is on the Euler circle of triangle $ABC$.

Let $\mathbb R_{>0}$ be the set of positive real numbers. Determine all functions $f \colon \mathbb R_{>0} \to \mathbb R_{>0}$ such that \[x \big(f(x) + f(y)\big) \geqslant \big(f(f(x)) + y\big) f(y)\] for every $x, y \in \mathbb R_{>0}$.

Let $a,b,c$ be positive real numbers such that $abc = 1$. Prove that: $\displaystyle\prod(a^5+a^4+a^3+a^2+a+1)\geq 8(a^2+a+1)(b^2+b+1)(c^2+c+1)$

Let $\{x\}$ denote the fractional part of $x$. For example, $\{5.5\}=0.5$. Find the smallest prime $p$ such that the inequality \[\sum_{n=1}^{p^2}\left\{\dfrac{n^p}{p^2}\right\}>2016\] holds.

Two bodies simultaneously emerge from points $A$ and $B$ towards each other. Every time each body finds itself at point $A$ or point $B$, it changes the direction of its movement to the opposite (the absolute values of the velocities of both bodies are constant). A body that initially leaves point $A$ travels the path $AB$ in $101$ seconds. A body that initially left point $B$ travels the same path $AB$ in $201$ seconds. After $2 \cdot 101 \cdot 201$ seconds, each body will be at its starting point. How many times during this time will the first body overtake the second?

A Yule log is shaped like a right cylinder with height $10$ and diameter $5$. Freya cuts it parallel to its bases into $9$ right cylindrical slices. After Freya cut it, the combined surface area of the slices of the Yule log increased by $a\pi$. Compute $a$.

Prove that for each prime $ P =9k+1$ ,exist natural n such that $P|n^3-3n+1$.

The number $400000001$ can be written as $p\cdot q$, where $p$ and $q$ are prime numbers. Find the sum of the prime factors of $p+q-1$.

If you take a subset of $4002$ numbers from the whole numbers $1$ to $6003$, then there is always a subset of $2001$ numbers within that subset with the following property: If you order the $2001$ numbers from small to large, the numbers are alternately even and odd (or odd and even). Prove this.

One day while Tony plays in the back yard of the Kubik's home, he wonders about the width of the back yard, which is in the shape of a rectangle. A row of trees spans the width of the back of the yard by the fence, and Tony realizes that all the trees have almost exactly the same diameter, and the trees look equally spaced. Tony fetches a tape measure from the garage and measures a distance of almost exactly $12$ feet between a consecutive pair of trees. Tony realizes the need to include the width of the trees in his measurements. Unsure as to how to do this, he measures the distance between the centers of the trees, which comes out to be around $15$ feet. He then measures $2$ feet to either side of the first and last trees in the row before the ends of the yard. Tony uses these measurements to estimate the width of the yard. If there are six trees in the row of trees, what is Tony's estimate in feet? [asy] size(400); defaultpen(linewidth(0.8)); draw((0,-3)--(0,3)); int d=8; for(int i=0;i<=5;i=i+1) { draw(circle(7/2+d*i,3/2)); } draw((5*d+7,-3)--(5*d+7,3)); draw((0,0)--(2,0),Arrows(size=7)); draw((5,0)--(2+d,0),Arrows(size=7)); draw((7/2+d,0)--(7/2+2*d,0),Arrows(size=7)); label("$2$",(1,0),S); label("$12$",((7+d)/2,0),S); label("$15$",((7+3*d)/2,0),S); [/asy]

The number 555,555,555,555 factors into eight distinct prime factors, each with a multiplicity of 1. What are the three largest prime factors of 555,555,555,555?

Let $x_1, \ldots , x_{100}$ be nonnegative real numbers such that $x_i + x_{i+1} + x_{i+2} \leq 1$ for all $i = 1, \ldots , 100$ (we put $x_{101 } = x_1, x_{102} = x_2).$ Find the maximal possible value of the sum $S = \sum^{100}_{i=1} x_i x_{i+2}.$ [i]Proposed by Sergei Berlov, Ilya Bogdanov, Russia[/i]

$a$,$b$,$c$ are real. What is the highest value of $a+b+c$ if $a^2+4b^2+9c^2-2a-12b+6c+2=0$

How many integer values satisfy $|x|<3\pi$? $\textbf{(A) }9 \qquad \textbf{(B) }10 \qquad \textbf{(C) }18 \qquad \textbf{(D) }19 \qquad \textbf{(E) }20$

Points $D,E,F$ are on the sides $BC, CA$ and $AB$, respectively which satisfy $EF || BC$, $D_1$ is a point on $BC,$ Make $D_1E_1 || D_E, D_1F_1 || DF$ which intersect $AC$ and $AB$ at $E_1$ and $F_1$, respectively. Make $\bigtriangleup PBC \sim \bigtriangleup DEF$ such that $P$ and $A$ are on the same side of $BC.$ Prove that $E, E_1F_1, PD_1$ are concurrent. [color=red][Edit by Darij: See my post #4 below for a [b]possible correction[/b] of this problem. However, I am not sure that it is in fact the problem given at the TST... Does anyone have a reliable translation?][/color]

The Bernoulli sequence $\{B_{n}\}_{n \ge 0}$ is defined by \[B_{0}=1, \; B_{n}=-\frac{1}{n+1}\sum^{n}_{k=0}{{n+1}\choose k}B_{k}\;\; (n \ge 1)\] Show that for all $n \in \mathbb{N}$, \[(-1)^{n}B_{n}-\sum \frac{1}{p},\] is an integer where the summation is done over all primes $p$ such that $p| 2k-1$.

On a cyclic quadrilateral $ABCD$, there is a point $P$ on side $AD$ such that the triangle $CDP$ and the quadrilateral $ABCP$ have equal perimeters and equal areas. Prove that two sides of $ABCD$ have equal lengths.

A square-shaped field is divided into $n$ rectangular farms whose sides are parallel to the sides of the field. What is the greatest value of $n$, if the sum of the perimeters of the farms is equal to $100$ times of the perimeter of the field? $ \textbf{(A)}\ 10000 \qquad\textbf{(B)}\ 20000 \qquad\textbf{(C)}\ 50000 \qquad\textbf{(D)}\ 100000 \qquad\textbf{(E)}\ 200000 $

Let \( n \) be a positive integer. Determine the largest possible value of \( k \) with the following property: there exists a bijective function \( \phi: [0, 1] \to [0, 1]^k \) and a constant \( C > 0 \) such that, for all \( x, y \in [0, 1] \), \[ \| \phi(x) - \phi(y) \| \leq C \| x - y \|^k. \] Note: \( \| \cdot \| \) denotes the Euclidean norm, that is, \( \| (a_1, \ldots, a_n) \| = \sqrt{a_1^2 + \cdots + a_n^2} \).

Let $abc$ be real numbers satisfying $ab+bc+ca=1$. Show that $\frac{|a-b|}{|1+c^2|}$ + $\frac{|b-c|}{|1+a^2|}$ $>=$ $\frac{|c-a|}{|1+b^2|}$

What is the maximum possible value for the sum of the squares of the roots of $x^4+ax^3+bx^2+cx+d$ where $a$, $b$, $c$, and $d$ are $2$, $0$, $1$, and $7$ in some order?

Show that in the arithmetic progression with first term 1 and ratio 729, there are infinitely many powers of 10. [i]L. Kuptsov[/i]

For all positive integers $n$ and $k$, define $F(n,k) = \sum_{r = 1}^n r^{2k - 1}$. Prove that $F(n,1)$ divides $F(n,k)$.

Is there an infinite sequence of positive integers $\{a_n\}_{n = 1}^{\infty}$ which contains each positive integer exactly once and is such that the number $a_n + a_{n + 1} $ is a perfect square for each $n$?