Let $ABC$ be an acute triangle, and let $H$ be its orthocentre. Denote by $H_A$, $H_B$, and $H_C$ the second intersection of the circumcircle with the altitudes from $A$, $B$, and $C$ respectively. Prove that the area of triangle $H_A H_B H_C$ does not exceed the area of triangle $ABC$.

$ R_k(m,n)$ is the least number such that for each coloring of $ k$-subsets of $ \{1,2,\dots,R_k(m,n)\}$ with blue and red colors, there is a subset with $ m$ elements such that all of its k-subsets are red or there is a subset with $ n$ elements such that all of its $ k$-subsets are blue. a) If we give a direction randomly to all edges of a graph $ K_n$ then what is the probability that the resultant graph does not have directed triangles? b) Prove that there exists a $ c$ such that $ R_3(4,n)\geq2^{cn}$.

Prove that if $\alpha$ and $\beta$ are acute angles and $\alpha$ < $\beta$ , then $\frac{tan \alpha}{\alpha} < \frac{tan \beta}{\beta} $

Let $m, n, k$ be positive integers such that $k\le mn$. Let $S$ be the set consisting of the $(m + 1)$-by-$(n + 1)$ rectangular array of points on the Cartesian plane with coordinates $(i, j)$ where $i, j$ are integers satisfying $0\le i\le m$ and $0\le j\le n$. The diagram below shows the example where $m = 3$ and $n = 5$, with the points of $S$ indicated by black dots: [asy] unitsize(1cm); int m=3; int n=5; int xmin=-2; int xmax=7; for (int i=xmin+1; i<=xmax-1; i+=1) { draw((xmin+0.5,i)--(xmax-0.5,i),gray); draw((i,xmin+0.5)--(i,xmax-0.5),gray); } draw((xmin-0.25,0)--(xmax+0.25,0),black,Arrow(2mm)); draw((0,xmin-0.25)--(0,xmax+0.25),black,Arrow(2mm)); for (int i=0; i<=m; ++i) { for (int j=0; j<=n; ++j) { fill(shift(i,j)*scale(.1)*unitcircle); }} label("$x$",(xmax+0.25,0),E); label("$y$",(0,xmax+0.25),N); [/asy]

Let $f$ be a non-constant function from the set of positive integers into the set of positive integer, such that $a-b$ divides $f(a)-f(b)$ for all distinct positive integers $a$, $b$. Prove that there exist infinitely many primes $p$ such that $p$ divides $f(c)$ for some positive integer $c$. [i]Proposed by Juhan Aru, Estonia[/i]

What is the smallest possible value of $\left|12^m-5^n\right|$, where $m$ and $n$ are positive integers?

Gwendoline rolls a pair of six-sided dice and records the product of the two values rolled. Gwendoline repeatedly rolls the two dice and records the product of the two values until one of the values she records appears for a third time. What is the maximum number of times Gwendoline will need to roll the two dice?

Prove that if $h_1,h_2,h_3,h_4$ are the altitudes of a tetrahedron and $d_1,d_2,d_3$ the distances between the pairs of opposite edges of the tetrahedron, then $$\frac{1}{h_1^2} +\frac{1}{h_2^2} +\frac{1}{h_3^2} +\frac{1}{h_4^2} =\frac{1}{d_1^2} +\frac{1}{d_2^2} +\frac{1}{d_3^2}.$$

Rachel and Robert run on a circular track. Rachel runs counterclockwise and completes a lap every $ 90$ seconds, and Robert runs clockwise and completes a lap every $ 80$ seconds. Both start from the start line at the same time. At some random time between $ 10$ minutes and $ 11$ minutes after they begin to run, a photographer standing inside the track takes a picture that shows one-fourth of the track, centered on the starting line. What is the probability that both Rachel and Robert are in the picture? $ \textbf{(A)}\ \frac{1}{16}\qquad \textbf{(B)}\ \frac18\qquad \textbf{(C)}\ \frac{3}{16} \qquad \textbf{(D)}\ \frac14\qquad \textbf{(E)}\ \frac{5}{16}$

Prove that a necessary and sufficient for the existence of a set $ S \subset \{1,2,...,n \}$ with the property that the integers $ 0,1,...,n\minus{}1$ all have an odd number of representations in the form $ x\minus{}y, x,y \in S$, is that $ (2n\minus{}1)$ has a multiple of the form $ 2.4^k\minus{}1$ [i]L. Lovasz, J. Pelikan[/i]

Find all functions $f:\mathbb{R} \rightarrow \mathbb{R}$ with the property that $$f(x)f(y) = (xy - 1)^2f\left(\frac{x + y - 1}{xy - 1}\right)$$ for all real numbers $x, y$ with $xy \neq 1$.

A $2$-by-$2018$ grid is completely covered by non-overlapping L-tiles (see diagram below) and $1$-by-$1$ squares. If the L-tiles can be rotated and flipped, there are a total of $M$ such tilings. [asy] size(1cm); draw((0,0)--(2,0)--(2,1)--(1,1)--(1,2)--(0,2)--cycle); draw((0,1)--(1,1)--(1,0)); [/asy] What is $\ln M?$ Give your answer as an integer or decimal. If your answer is $A$ and the correct answer is $C$, then your score will be $\max\{\lfloor7.5-\tfrac{|A-C|^{1.5}}{20}\rfloor,0\}.$

The function $F (x)$ is defined on $R$ and has a second derivative for each value of the variable. Prove that there is a point $x_0$ such that the product $ F(x_0) F''(x_0)$ is non-negative. PS. In my [url=http://www.1543.su/olympiads/soros/20002001/1/1soros00.htm]source[/url], it is not clear if it means $ F(x_0) F''(x_0)$ or $ F(x_0) F'(x_0)$.

Let $a_1=1$ and $a_n=n(a_{n-1}+1)$ for $n\ge2$. Define $$p_n=\prod_{i=1}^n\left(1+\frac1{a_i}\right)$$Then $\lim_{n\to\infty}p_n$ is $\textbf{(A)}~1+e$ $\textbf{(B)}~e$ $\textbf{(C)}~1$ $\textbf{(D)}~\infty$

It is known that the merchant’s $n$ clients live in locations laid along the ring road. Of these, $k$ customers have debts to the merchant for $a_1,a_2,...,a_k$ rubles, and the merchant owes the remaining $n-k$ clients, whose debts are $b_1,b_2,...,b_{n-k}$ rubles, moreover, $a_1+a_2+...+a_k=b_1+b_2+...+b_{n-k}$. Prove that a merchant who has no money can pay all his debts and have paid all the customer debts, by starting a customer walk along the road from one of points and not missing any of their customers.

Let $P_{1}P_{2}\dots P_{2n}$ be a convex polygon with an even number of corners. Prove that there exists a diagonal $P_{i}P_{j}$ which is not parallel to any side of the polygon.