Let $ABC$ be a triangle such that $AB = 13$, $BC = 14$, $CA = 15$ and let $E$, $F$ be the feet of the altitudes from $B$ and $C$, respectively. Let the circumcircle of triangle $AEF$ be $\omega$. We draw three lines, tangent to the circumcircle of triangle $AEF$ at $A$, $E$, and $F$. Compute the area of the triangle these three lines determine.

Source: 1976 Euclid Part B Problem 3 ----- $I$ is the centre of the inscribed circle of $\triangle{ABC}$. $AI$ meets the circumcircle of $\triangle{ABC}$ at $D$. Prove that $D$ is equidistant from $I$, $B$, and $C$.

Jonah recently harvested a large number of lychees and wants to split them into groups. Unfortunately, for all $n$ where $3\leq n\leq8$, when the lychees are distributed evenly into $n$ groups, $n-1$ lychees remain. What is the smallest possible number of lychees that Jonah could have?

What maximal number of the men in checkers game can be put on the chess-board $8\times 8$ so, that every man can be taken by at least one other man ?

Proove that in every five positive numbers there is a pair, say $a,b$, for which $$\left| \frac{1}{a+25}- \frac{1}{b+25}\right| <\frac{1}{100}.$$

Let $f,g:\mathbb{R}\to\mathbb{R}$ be functions with $g(x)=2f(x)+f(x^2),$ for all $x \in \mathbb{R}.$ a) Prove that, if $f$ is bounded in a neighbourhood of the origin and $g$ is continuous in the origin, then $f$ is continuous in the origin. b) Provide an example of function $f$, discontinuous in the origin, for which the function $g$ is continuous in the origin.

Let $ABC$ and $PQR$ be two triangles such that [list] [b](a)[/b] $P$ is the mid-point of $BC$ and $A$ is the midpoint of $QR$. [b](b)[/b] $QR$ bisects $\angle BAC$ and $BC$ bisects $\angle QPR$ [/list] Prove that $AB+AC=PQ+PR$.

Determine the smallest positive integer $n$ for which the following statement holds true: From any $n$ consecutive integers one can select a non-empty set of consecutive integers such that their sum is divisible by $2019$. [i]Proposed by Kartal Nagy, Hungary[/i]

Let $n$ be an even positive integer. Show that there exists a permutation $(x_1, x_2, \ldots, x_n)$ of the set $\{1, 2, \ldots, n\}$, such that for each $i \in \{1, 2, \ldots, n\}, x_{i+1}$ is one of the numbers $2x_i, 2x_{i}-1, 2x_i - n, 2x_i - n - 1$, where $x_{n+1} = x_1.$

There are $n$ triangles inscribed in a circle and all $3n$ of their vertices are different. Prove that it is possible to put a boy in one of the vertices in each triangle, and a girl in the other, so that boys and girls alternate on a circle.

Let be the points $ M,N,P, $ on the sides $ BC,AC,AB $ (not on their endpoints), respectively, of a triangle $ ABC, $ such that $ \frac{BM}{MC} =\frac{CN}{NA} =\frac{AP}{PB} . $ Denote $ G_1,G_2,G_3 $ the centroids of $ APN,BMP,CNM, $ respectively. Show that the $ MNP $ has the same centroid as $ G_1G_2G_3. $ [i]Ovidiu Țâțan[/i]

Consider a sequence $\{a_n\}$ of integers, satisfying $a_1=1, a_2=2$ and $a_{n+1}$ is the largest prime divisor of $a_1+a_2+\ldots+a_n$. Find $a_{100}$.

Bengt wants to put out crosses and rings in the squares of an $n \times n$-square, so that it is exactly one ring and exactly one cross in each row and in each column, and no more than one symbol in each box. Mona wants to stop him by setting a number in advance ban on crosses and a number of bans on rings, maximum one ban in each square. She want to use as few bans as possible of each variety. To succeed in preventing Bengt, how many prohibitions she needs to use the least of the kind of prohibitions she uses the most of?

Let $\mathbb{N}$ be the set of positive integers. For every $n \in \mathbb{N}$, define $d(n)$ as the number of positive divisors of $n$. Find all functions $f : \mathbb{N} \rightarrow \mathbb{N}$ such that: a) $d(f(x)) = x$ for all $x \in \mathbb{N}$ b) $f(xy)$ divides $(x-1)y^{xy-1}f(x)$ for all $x,y \in \mathbb{N}$

Let $ n$ be a positive integer and let $ a_1,a_2,a_3,\ldots,a_k$ $ ( k\ge 2)$ be distinct integers in the set $ { 1,2,\ldots,n}$ such that $ n$ divides $ a_i(a_{i + 1} - 1)$ for $ i = 1,2,\ldots,k - 1$. Prove that $ n$ does not divide $ a_k(a_1 - 1).$ [i]Proposed by Ross Atkins, Australia [/i]

In a convex $2002\text{-gon}$ several diagonals are drawn so that they do not intersect inside the polygon. As a result the polygon splits into $2000$ triangles. Isit possible that exactly $1000$ triangles have diagonals for all their three sides?

Find the smallest integer $n$ for which the set $A = \{n, n +1, n +2,...,2n\}$ contains five elements $a<b<c<d<e$ so that $$\frac{a}{c}=\frac{b}{d}=\frac{c}{e}$$

Let $P(x)$ be a non-constant polynomial with integer coefficients and let $n$ be a positive integer. The sequence $a_0,a_1,\ldots$ is defined as follows: $a_0=n$ and $a_k=P(a_{k-1})$ for all positive integers $k.$ Assume that for every positive integer $b$ the sequence contains a $b$th power of an integer greater than $1.$ Show that $P(x)$ is linear.

Through an informant, the police know the meeting place of a group of criminals. The identity of the different elements of the group is, however, unknown. Inspector Loureiro's task is to arrest the leader of the group. The inspector knows that the leader of the group is the shortest of the five members of the group, all of them of different heights, who will be present at the meeting. After the meeting, the bandits - as a precautionary measure - leave the building separately with an interval of $15$ minutes. As the inspector doesn't know which of them is the shortest, he decides to let the first two criminals out, and arrest the first of the following who is shorter than those who left until that moment. What is the probability that Inspector Loureiro will arrest the right person?

The diagonals of a cyclic quadrilateral $ABCD$ meet at $O$. Let $S_1, S_2$ be the circumcircles of triangles $ABO$ and $CDO$ respectively, and $O,K$ their intersection points. The lines through $O$ parallel to $AB$ and $CD$ meet $S_1$ and $S_2$ again at $L$ and $M$, respectively. Points $P$ and $Q$ on segments $OL$ and $OM$ respectively are taken such that $OP : PL = MQ : QO$. Prove that $O,K, P,Q$ lie on a circle.

In the Jordan Building (the Olympiad building of High School Mandegar Alborz), Ali and Khosro are playing a game. First, Ali selects 2025 points on the plane such that no three points are collinear and no four points are concyclic. Then, Khosro selects a point, followed by Ali selecting another point, and then Khosro selects one more point. The circumcircle of these three points is drawn, and the number of points inside the circle is denoted by \( t \). If Khosro's goal is to maximize \( t \) and Ali's goal is to minimize \( t \), and both play optimally, determine the value of \( t \). Proposed by Reza Tahernejad Karizi

Given vectors $v_1, \dots, v_n$ and the string $v_1v_2 \dots v_n$, we consider valid expressions formed by inserting $n-1$ sets of balanced parentheses and $n-1$ binary products, such that every product is surrounded by a parentheses and is one of the following forms: 1. A "normal product'' $ab$, which takes a pair of scalars and returns a scalar, or takes a scalar and vector (in any order) and returns a vector. \\ 2. A "dot product'' $a \cdot b$, which takes in two vectors and returns a scalar. \\ 3. A "cross product'' $a \times b$, which takes in two vectors and returns a vector. \\ An example of a [i]valid [/i] expression when $n=5$ is $(((v_1 \cdot v_2)v_3) \cdot (v_4 \times v_5))$, whose final output is a scalar. An example of an [i] invalid [/i] expression is $(((v_1 \times (v_2 \times v_3)) \times (v_4 \cdot v_5))$; even though every product is surrounded by parentheses, in the last step one tries to take the cross product of a vector and a scalar. \\ Denote by $T_n$ the number of valid expressions (with $T_1 = 1$), and let $R_n$ denote the remainder when $T_n$ is divided by $4$. Compute $R_1 + R_2 + R_3 + \ldots + R_{1,000,000}$. [i] Proposed by Ashwin Sah [/i]

Let $AG, CH$ be the angle bisectors of a triangle $ABC$. It is known that one of the intersections of the circles of triangles $ABG$ and $ACH$ lies on the side $BC$. Prove that the angle $BAC$ is $60 ^o$

Let one of the intersection points of two circles with centres $O_1,O_2$ be $P$. A common tangent touches the circles at $A,B$ respectively. Let the perpendicular from $A$ to the line $BP$ meet $O_1O_2$ at $C$. Prove that $AP\perp PC$.

$\boxed{\text{G5}}$ The incircle of a triangle $ABC$ touches its sides $BC$,$CA$,$AB$ at the points $A_1$,$B_1$,$C_1$.Let the projections of the orthocenter $H_1$ of the triangle $A_{1}B_{1}C_{1}$ to the lines $AA_1$ and $BC$ be $P$ and $Q$,respectively. Show that $PQ$ bisects the line segment $B_{1}C_{1}$