On the ends of the diameter two "$1$"s are written. Each of the semicircles is divided onto two parts and the sum of the numbers of its ends (i.e. "$2$") is written at the midpoint. Then every of the four arcs is halved and in its midpoint the sum of the numbers on its ends is written. Find the total sum of the numbers on the circumference after $n$ steps.

Two lines with slopes $\dfrac{1}{2}$ and $2$ intersect at $(2,2)$. What is the area of the triangle enclosed by these two lines and the line $x+y=10 ?$ $\textbf{(A) } 4 \qquad\textbf{(B) } 4\sqrt{2} \qquad\textbf{(C) } 6 \qquad\textbf{(D) } 8 \qquad\textbf{(E) } 6\sqrt{2}$

Find values of $n\in \mathbb{N}$ for which the fraction $\frac{3^n-2}{2^n-3}$ is reducible.

Determine all triangles such that the lengths of the three sides and its area are given by four consecutive natural numbers.

Given a prime $ p = 8k+1 $ for some integer $ k $. Let $ r $ be the remainder when $ \binom{4k}{k} $ is divided by $ p $. Prove that $ \sqrt{r} $ is not an integer. [i]Proposed by Evan Chen[/i]

Let $A_1A_2A_3$ be a triangle and, for $1 \leq i \leq 3$, let $B_i$ be an interior point of edge opposite $A_i$. Prove that the perpendicular bisectors of $A_iB_i$ for $1 \leq i \leq 3$ are not concurrent.

There are $n$ line segments on the plane, no three intersecting at a point, and each pair intersecting once in their respective interiors. Tony and his $2n - 1$ friends each stand at a distinct endpoint of a line segment. Tony wishes to send Christmas presents to each of his friends as follows: First, he chooses an endpoint of each segment as a “sink”. Then he places the present at the endpoint of the segment he is at. The present moves as follows : $\bullet$ If it is on a line segment, it moves towards the sink. $\bullet$ When it reaches an intersection of two segments, it changes the line segment it travels on and starts moving towards the new sink. If the present reaches an endpoint, the friend on that endpoint can receive their present. Prove that Tony can send presents to exactly $n$ of his $2n - 1$ friends.

In a particular game, each of $4$ players rolls a standard $6{ }$-sided die. The winner is the player who rolls the highest number. If there is a tie for the highest roll, those involved in the tie will roll again and this process will continue until one player wins. Hugo is one of the players in this game. What is the probability that Hugo's first roll was a $5,$ given that he won the game? $(\textbf{A})\: \frac{61}{216}\qquad(\textbf{B}) \: \frac{367}{1296}\qquad(\textbf{C}) \: \frac{41}{144}\qquad(\textbf{D}) \: \frac{185}{648}\qquad(\textbf{E}) \: \frac{11}{36}$

Call two circles in three-dimensional space pairwise tangent at a point $ P$ if they both pass through $ P$ and lines tangent to each circle at $ P$ coincide. Three circles not all lying in a plane are pairwise tangent at three distinct points. Prove that there exists a sphere which passes through the three circles.

Let $ABC$ be an equilateral triangle of unit side length and suppose $D$ is a point on segment $\overline{BC}$ such that $DB<DC.$ Let $M$ and $N$ denote the midpoints of $\overline{AB}$ and $\overline{AC},$ respectively. Suppose $X$ and $Y$ are the intersections of lines $AB$ and $ND,$ and lines $AC$ and $MD,$ respectively. Given that $XY=4,$ what is the value of $\frac{DB}{DC}?$ [i]Proposed by Kyle Lee[/i]

Let $ABCD$ be a square. For a point $P$ inside $ABCD$, a $\emph{windmill}$ centred at $P$ consists of two perpendicular lines $l_1$ and $l_2$ passing through $P$, such that $\quad\bullet$ $l_1$ intersects the sides $AB$ and $CD$ at $W$ and $Y$, respectively, and $\quad\bullet$ $l_2$ intersects the sides $BC$ and $DA$ at $X$ and $Z$, respectively. A windmill is called $\emph{round}$ if the quadrilateral $WXYZ$ is cyclic. Determine all points $P$ inside $ABCD$ such that every windmill centred at $P$ is round.

Find all the polynomials $P(x)$ of a degree $\leq n$ with real non-negative coefficients such that $P(x) \cdot P(\frac{1}{x}) \leq [P(1)]^2$ , $ \forall x>0$.

For every $ n\in\mathbb{N}$ let $ d(n)$ denote the number of (positive) divisors of $ n$. Find all functions $ f: \mathbb{N}\to\mathbb{N}$ with the following properties: [list][*] $ d\left(f(x)\right) \equal{} x$ for all $ x\in\mathbb{N}$. [*] $ f(xy)$ divides $ (x \minus{} 1)y^{xy \minus{} 1}f(x)$ for all $ x$, $ y\in\mathbb{N}$.[/list] [i]Proposed by Bruno Le Floch, France[/i]

Let $n$ be a positive integer and let $P(x)$ be a monic polynomial of degree $n$ with real coefficients. Also let $Q(x)=(x+1)^2(x+2)^2\dots (x+n+1)^2$. Consider the minimum possible value $m_n$ of $\displaystyle\sum_{i=1}^{n+1} \dfrac{i^2P(i^2)^2}{Q(i)}$. Then there exist positive constants $a,b,c$ such that, as $n$ approaches infinity, the ratio between $m_n$ and $a^{2n} n^{2n+b} c$ approaches $1$. Compute $\lfloor 2019 abc^2\rfloor$. [i]Proposed by Vincent Huang[/i]

Let $ABCD$ be a square with side $20$ and $T_1, T_2, ..., T_{2000}$ are points in $ABCD$ such that no $3$ points in the set $S = \{A, B, C, D, T_1, T_2, ..., T_{2000}\}$ are collinear. Prove that there exists a triangle with vertices in $S$, such that the area is less than $1/10$.

Let $P$ be the parabola in the plane determined by the equation $y = x^2$ . Suppose a circle $C$ in the plane intersects $P$ at four distinct points. If three of these points are $(-28, 784)$,$(-2, 4)$, and $(13, 169)$, find the sum of the distances from the focus of $P$ to all four of the intersection points

How many five-digit multiples of 3 end with the digit 6 ?

For some positive integer $n,$ Elmo writes down the equation \[x_1+x_2+\dots+x_n=x_1+x_2+\dots+x_n.\] Elmo inserts at least one $f$ to the left side of the equation and adds parentheses to create a valid functional equation. For example, if $n=3,$ Elmo could have created the equation \[f(x_1+f(f(x_2)+x_3))=x_1+x_2+x_3.\] Cookie Monster comes up with a function $f: \mathbb{Q}\to\mathbb{Q}$ which is a solution to Elmo's functional equation. (In other words, Elmo's equation is satisfied for all choices of $x_1,\dots,x_n\in\mathbb{Q})$. Is it possible that there is no integer $k$ (possibly depending on $f$) such that $f^k(x)=x$ for all $x$? [i]Srinivas Arun[/i]

Let $T=\frac{1}{4}x^{2}-\frac{1}{5}y^{2}+\frac{1}{6}z^{2}$ where $x,y,z$ are real numbers such that $1 \leq x,y,z \leq 4$ and $x-y+z=4$. Find the smallest value of $10 \times T$.

Given a pentagon of area $1993$ and $995$ points inside the pentagon, let $S$ be the set containing the vertices of the pentagon and the $995$ points. Show that we can find three points of $S$ which form a triangle of area $\le 1$.

Let $ABC$ be a triangle with $\angle C=90^\circ$, and $D$ be a point outside $ABC$, such that $\angle ADC=\angle BAC$. The segments $CD$ and $AB$ meet at point $E$. It is known that the distance from $E$ to $AC$ is equal to the circumradius of triangle $ADE$. Find the angles of triangle $ABC$.

A graup of pirates had an argument and not each of them holds some other two at gunpoint.All the pirates are called one by one in some order.If the called pirate is still alive , he shoots both pirates he is aiming at ( some of whom might already be dead .) All shorts are immediatcly lethal . After all the pirates have been called , it turns out the exactly $28$ pirates got killed . Prove that if the pirates were called in whatever other order , at least $10$ pirates would have been killed anyway.

For any natural number $n$, consider a $1\times n$ rectangular board made up of $n$ unit squares. This is covered by $3$ types of tiles : $1\times 1$ red tile, $1\times 1$ green tile and $1\times 2$ domino. (For example, we can have $5$ types of tiling when $n=2$ : red-red ; red-green ; green-red ; green-green ; and blue.) Let $t_n$ denote the number of ways of covering $1\times n$ rectangular board by these $3$ types of tiles. Prove that, $t_n$ divides $t_{2n+1}$.

$a,b,c\in\mathbb{R^+}$ and $a^2+b^2+c^2=48$. Prove that \[a^2\sqrt{2b^3+16}+b^2\sqrt{2c^3+16}+c^2\sqrt{2a^3+16}\le24^2\]

Let $a, b, c$ be integers such that \[\frac ab+\frac bc+\frac ca= 3\] Prove that $abc$ is a cube of an integer.