We are given a triangle $ABC$ in a plane $P$. To any line $D$, not parallel to any side of the triangle, we associate the barycenter $G_D$ of the set of intersection points of $D$ with the sides of $\triangle ABC$. The object of this problem is determining the set $\mathfrak F$ of points $G_D$ when $D$ varies. (a) If $D$ goes over all lines parallel to a given line $\delta$, prove that $G_D$ describes a line $\Delta_\delta$. (b) Assume $\triangle ABC$ is equilateral. Prove that all lines $\Delta_\delta$ are tangent to the same circle as $\delta$ varies, and describe the set $\mathfrak F$. (c) If $ABC$ is an arbitrary triangle, prove that one can find a plane $P$ and an equilateral triangle $A'B'C'$ whose orthogonal projection onto $P$ is $\triangle ABC$, and describe the set $\mathfrak F$ in the general case.

The triangle $ ABC$ is given. On the extension of the side $ AB$ we construct the point $ R$ with $ BR \equal{} BC$, where $ AR > BR$ and on the extension of the side $ AC$ we construct the point $ S$ with $ CS \equal{} CB$, where $ AS > CS$. Let $ A_1$ be the point of intersection of the diagonals of the quadrilateral $ BRSC$. Analogous we construct the point $ T$ on the extension of the side $ BC$, where $ CT \equal{} CA$ and $ BT > CT$ and on the extension of the side $ BA$ we construct the point $ U$ with $ AU \equal{} AC$, where $ BU > AU$. Let $ B_1$ be the point of intersection of the diagonals of the quadrilateral $ CTUA$. Likewise we construct the point $ V$ on the extension of the side $ CA$, where $ AV \equal{} AB$ and $ CV > AV$ and on the extension of the side $ CB$ we construct the point $ W$ with $ BW \equal{} BA$ and $ CW > BW$. Let $ C_1$ be the point of intersection of the diagonals of the quadrilateral $ AVWB$. Show that the area of the hexagon $ AC_1BA_1CB_1$ is equal to the sum of the areas of the triangles $ ABC$ and $ A_1B_1C_1$.

Let $k = 2^6 \cdot 3^5 \cdot 5^2 \cdot 7^3 \cdot 53$. Let $S$ be the sum of $\frac{gcd(m,n)}{lcm(m,n)}$ over all ordered pairs of positive integers $(m, n)$ where $mn = k$. If $S$ can be written in simplest form as $\frac{r}{s}$, compute $r + s$.

$n$ is a fixed natural number. Find the least $k$ such that for every set $A$ of $k$ natural numbers, there exists a subset of $A$ with an even number of elements which the sum of it's members is divisible by $n$.

Let $AB$ be the diameter of circle $\Gamma$ centred at $O$. Point $C$ lies on ray $\overrightarrow{AB}$. The line through $C$ cuts circle $\Gamma$ at $D$ and $E$, with point $D$ being closer to $C$ than $E$ is. $OF$ is the diameter of the circumcircle of triangle $BOD$. Next, construct $CF$, cutting the circumcircle of triangle $BOD$ at $G$. Prove that $O,A,E,G$ are concyclic. (Possibly proposed by Pak Wono)

Find the number of ordered pairs of positive integers $(a,b)$ such that $a+b=1000$ and neither $a$ nor $b$ has a zero digit.

In a parallelogram $ABCD$ of surface area $60$ cm$^2$ , a line is drawn by $D$ that intersects $BC$ at $P$ and the extension of $AB$ at $Q$. If the area of the quadrilateral $ABPD$ is $46$ cm$^2$ , find the area of triangle $CPQ$.

In triangle $ ABC$ points $ E$ and $ F$ lie on sides $ AC$ and $ BC$ such that segments $ AE$ and $ BF$ have equal length, and circles formed by $ A,C,F$ and by $ B,C,E,$ respectively, intersect at point $ C$ and another point $ D.$ Prove that that the line $ CD$ bisects $ \angle ACB.$

The great Zagier and his assistant performed a magic trick, which was a natural one number $n$ involved. To do this, Zagier distributes $n$ identical coins (with heads and tails on the sides) and then leave the hall. The audience now arranges the coins in a row, you can choose the top side of each coin as you like, and then tell the assistant one natural number $k$ from $1$ to $n$. This then turns over exactly one coin, whereupon Zagier is brought in and placed in front of said coins. To the surprise of the non-mathematical, he can name the number $k$ to the public. For which natural numbers $n$ can this trick be carried out, if the two are allowed to coordinate only before the show, but during the show they do not use any magic tricks?

Let $B = (-1, 0)$ and $C = (1, 0)$ be fixed points on the coordinate plane. A nonempty, bounded subset $S$ of the plane is said to be [i]nice[/i] if $\text{(i)}$ there is a point $T$ in $S$ such that for every point $Q$ in $S$, the segment $TQ$ lies entirely in $S$; and $\text{(ii)}$ for any triangle $P_1P_2P_3$, there exists a unique point $A$ in $S$ and a permutation $\sigma$ of the indices $\{1, 2, 3\}$ for which triangles $ABC$ and $P_{\sigma(1)}P_{\sigma(2)}P_{\sigma(3)}$ are similar. Prove that there exist two distinct nice subsets $S$ and $S'$ of the set $\{(x, y) : x \geq 0, y \geq 0\}$ such that if $A \in S$ and $A' \in S'$ are the unique choices of points in $\text{(ii)}$, then the product $BA \cdot BA'$ is a constant independent of the triangle $P_1P_2P_3$.

For positive integers $N$ and $m$, where $m \le N$, define $$a_{m,N} =\frac{1}{{N+1 \choose m}} \sum_{i=m-1}^{N-1} \frac{ {i \choose m-1}}{N - i}$$ Compute the smallest positive integer $N$ such that $$\sum^N_{m=1}a_{m,N} >\frac{2020N}{N +1}$$

Let $\{a_i\}$ be a strictly increasing sequence of positive integers. Define the sequence $\{s_k\}$ as $$s_k = \sum_{i=1}^{k}\frac{1}{[a_i,a_{i+1}]},$$ where $[a_i,a_{i+1}]$ is the least commun multiple of $a_i$ and $a_{i+1}$. Show that the sequence $\{s_k\}$ is convergent.

Find the sum of all positive integers less than $2006$ which are both multiples of six and one more than a multiple of seven.

Let P be a point in an acute triangle $ABC$, and $d_A, d_B, d_C$ be the distance from P to vertices of the triangle respectively. If the distance from P to the three edges are $d_1, d_2, d_3$ respectively, prove that \[d_A+d_B+d_C\geq 2(d_1+d_2+d_3)\]

Given the polynomial $a_0x^n+a_1x^{n-1}+\cdots+a_{n-1}x+a_n$, where $n$ is a positive integer or zero, and $a_0$ is a positive integer. The remaining $a$'s are integers or zero. Set $h=n+a_0+|a_1|+|a_2|+\cdots+|a_n|$. [See example 25 for the meaning of $|x|$.] The number of polynomials with $h=3$ is: $ \textbf{(A)}\ 3\qquad\textbf{(B)}\ 5\qquad\textbf{(C)}\ 6\qquad\textbf{(D)}\ 7\qquad\textbf{(E)}\ 9 $

10.2 Prove for all $x>0$ and $n\in\mathbb{N}$ the following inequality \[1+x^{n+1}\geq \frac{(2x)^n}{(1+x)^{n-1}}.\] ([i]A. Khrabrov[/i])