Let $ABC$ be an acute triangle and let $P,Q$ be points on $BC$ such that $\angle QAC =\angle ABC$ and $\angle PAB = \angle ACB$. We extend $AP$ to $M$ so that $ P$ is the midpoint of $AM$ and we extend $AQ$ to $N$ so that $Q$ is the midpoint of $AN$. If T is the intersection point of $BM$ and $CN$, show that quadrilateral $ABTC$ is cyclic.

Let $x_1,x_2,\cdots,x_n$ be real numbers with $x_1^2+x_2^2+\cdots+x_n^2=1$. Prove that \[\sum_{k=1}^{n}\left(1-\dfrac{k}{{\displaystyle \sum_{i=1}^{n} ix_i^2}}\right)^2 \cdot \dfrac{x_k^2}{k} \leq \left(\dfrac{n-1}{n+1}\right)^2 \sum_{k=1}^{n} \dfrac{x_k^2}{k}\] Determine when does the equality hold?

Let $n>k>1$ be positive integers and let $G$ be a graph with $n$ vertices such that among any $k$ vertices, there is a vertex connected to the rest $k-1$ vertices. Find the minimal possible number of edges of $G$. Proposed by V. Dolnikov

Alice and Bob play the following game on a square grid with $2024 \times 2024$ unit squares. They take turns covering unit squares with stickers including their names. Alice plays the odd-numbered turns, and Bob plays the even-numbered turns. \\ On the $k$-th turn, let $n_k$ be the least integer such that $n_k\geqslant\tfrac{k}{2024}$. If there is at least one square without a sticker, then the player taking the turn: [list = i] [*] selects at most $n_k$ unit squares on the grid such that at least one of the chosen unit squares does not have a sticker. [*] covers each of the selected unit squares with a sticker that has their name on it. If a selected square already has a sticker on it, then that sticker is removed first. [/list] At the end of their turn, a player wins if there exist $123$ unit squares containing stickers with that player's name that are placed on horizontally, vertically, or diagonally consecutive unit squares. We consider the game to be a draw if all of the unit squares are covered but no player has won yet. \\ Does Alice have a winning strategy? [i]Proposed by Erik Paemurru, Estonia[/i]

Triangle $ABC$ has side lengths $AC = 3$, $BC = 4$, and $AB = 5$. Let $I$ be the incenter of $\triangle{ABC}$, and let $\mathcal{P}$ be the parabola with focus $I$ and directrix $\overleftrightarrow{AC}$. Suppose that $\mathcal{P}$ intersects $\overline{AB}$ and $\overline{BC}$ at points $D$ and $E$, respectively. Find $DI+EI$.

Find all functions $f:\mathbb{Q}\to \mathbb{Q}$ such that \[ f(x+3f(y))=f(x)+f(y)+2y \quad \forall x,y\in \mathbb{Q}\]

There are $n$ points on a circle ($n>1$). Define an "interval" as an arc of a circle such that it's start and finish are from those points. Consider a family of intervals $F$ such that for every element of $F$ like $A$ there is almost one other element of $F$ like $B$ such that $A \subseteq B$ (in this case we call $A$ is sub-interval of $B$). We call an interval maximal if it is not a sub-interval of any other interval. If $m$ is the number of maximal elements of $F$ and $a$ is number of non-maximal elements of $F,$ prove that $n\geq m+\frac a2.$

The squares of an n*n chessboard (n >1) are filled with 1s and -1s. A series of steps are performed. For each step, the number in each square is replaced with the product of the numbers that were in the squares adjacent. Find all values of n for which, starting from an arbitrary collection of numbers, after finitely many steps one obtains a board filled with 1s.

Suppose we have a simple polygon (that is it does not intersect itself, but not necessarily convex). Show that this polygon has a diameter which is completely inside the polygon and the two arcs it creates on the polygon perimeter (the two arcs have 2 vertices in common) both have at least one third of the vertices of the polygon.

There are n cards on a table numbered from $1$ to $n$, where $n$ is an even number. Two people take turns taking away the cards. The first player will always take the card with the largest number on it, but the second player will take a random card. Prove: the probability that the first player takes the card with the number $i$ is $ \frac{i-1}{n-1} $

The sum of sixth powers of six integers minus $1$ is six times greater than the product of these six integers. Prove that one of them is $1$ or $-1$ and all others are $0$s. (LD Kurliandchik)

Find two positive integers $a$ and $b$, when their sum and their least common multiple is given. Find the numbers when the sum is $3972$ and the least common multiple is $985928$.

Three unit squares and two line segments connecting two pairs of vertices are shown. What is the area of $\triangle ABC$? [asy] size(200); defaultpen(linewidth(.6pt)+fontsize(12pt)); dotfactor=4; draw((0,0)--(0,2)); draw((0,0)--(1,0)); draw((1,0)--(1,2)); draw((0,1)--(2,1)); draw((0,0)--(1,2)); draw((0,2)--(2,1)); draw((0,2)--(2,2)); draw((2,1)--(2,2)); label("$A$",(0,2),NW); label("$B$",(1,2),N); label("$C$",(4/5,1.55),W); dot((0,2)); dot((1,2)); dot((4/5,1.6)); dot((2,1)); dot((0,0)); [/asy] $ \textbf{(A)}\ \frac{1}{6}\qquad\textbf{(B)}\ \frac{1}{5}\qquad\textbf{(C)}\ \frac{2}{9}\qquad\textbf{(D)}\ \frac{1}{3}\qquad\textbf{(E)}\ \frac{\sqrt2}{4} $

The game Prongle is played with a special deck of cards: on each card is a nonempty set of distinct colors. No two cards in the deck contain the exact same set of colors. In this game, a “Prongle” is a set of at least $2$ cards such that each color is on an even number of cards in the set. Let k be the maximum possible number of prongles in a set of $2019$ cards. Find $\lfloor \log 2 (k) \rfloor$.

Two players $A$ and $B$ play a game with a ball and $n$ boxes placed onto the vertices of a regular $n$-gon where $n$ is a positive integer. Initially, the ball is hidden in a box by player $A$. At each step, $B$ chooses a box, then player $A$ says the distance of the ball to the selected box to player $B$ and moves the ball to an adjacent box. If $B$ finds the ball, then $B$ wins. Find the least number of steps for which $B$ can guarantee to win.

Let $ A$ and $ B$ be two disjoint sets in the interval $ (0,1)$ . Denoting by $ \mu$ the Lebesgue measure on the real line, let $ \mu(A)>0$ and $ \mu(B)>0$ . Let further $ n$ be a positive integer and $ \lambda \equal{}\frac1n$ . Show that there exists a subinterval $ (c,d)$ of $ (0,1)$ for which $ \mu(A\cap (c,d))\equal{}\lambda \mu(A)$ and $ \mu(B\cap (c,d))\equal{}\lambda \mu(B)$ . Show further that this is not true if $ \lambda$ is not of the form $ \frac1n$.

Find the smallest value of the expression $|3 \cdot 5^m - 11 \cdot 13^n|$ for all $m,n \in N$. (Folklore)

Two planes, $ \alpha $ and $ \beta, $ form a dihedral angle of $ 30^{\circ} , $ and their intersection is the line $ d. $ A point $ A $ situated at the exterior of this angle projects itself in $ P\not\in d $ on $ \alpha , $ and in $ Q\not\in d $ on $ \beta $ such that $ AQ<AP. $ Name $ B $ the projection of $ A $ upon $ d. $ [b]a)[/b] Are $ A,B,P,Q, $ coplanar? [b]b)[/b] Knowing that a perpendicular to $ \beta $ make with $ AB $ an angle of $ 60^{\circ} , $ and $ AB=4, $ find the area of $ BPQ. $

Each element of set $\mathcal{S}$ is colored with multiple colors. A $\textit{rainbow}$ is a subset of $\mathcal{S}$ which has amongst its elements at least $1$ color from each element of $\mathcal{S}$. A $\textit{minimal rainbow}$ is a rainbow where removing any single element gives a non-rainbow. Prove that the union of all minimal rainbows is $\mathcal{S}$. [i]Grisham Paimagam[/i]

Let $m,n$ be positive integers and let $[a]$ denote the residue class$\pmod{mn}$ of the integer $a$ (thus $\{[r]|r\text{ is an integer}\}$ has exactly $mn$ elements). Suppose the set $\{[ar]|r\text{ is an integer}\}$ has exactly $m$ elements. Prove that there is a positive integer $q$ such that $q$ is coprime to $mn$ and $[nq]=[a]$.

Let $ABCDE$ be a convex pentagon such that $BC=DE$. Assume that there is a point $T$ inside $ABCDE$ with $TB=TD,TC=TE$ and $\angle ABT = \angle TEA$. Let line $AB$ intersect lines $CD$ and $CT$ at points $P$ and $Q$, respectively. Assume that the points $P,B,A,Q$ occur on their line in that order. Let line $AE$ intersect $CD$ and $DT$ at points $R$ and $S$, respectively. Assume that the points $R,E,A,S$ occur on their line in that order. Prove that the points $P,S,Q,R$ lie on a circle.

Find all natural numbers $a$, $b$, $c$ and prime numbers $p$ and $q$, such that: $\blacksquare$ $4\nmid c$ $\blacksquare$ $p\not\equiv 11\pmod{16}$ $\blacksquare$ $p^aq^b-1=(p+4)^c$

There were $10$ boys and $10$ girls at the party. Every boy likes a different 'positive' number of girls. Every girl likes a different positive number of boys. Define the largest non-negative integer $n$ such that it is always possible to form at least $n$ disjoint pairs in which both like the other.

$10.$ A $2\times 3$ rectangle and a $3 \times 4$ rectangle are contained within a square without overlapping at any interior point, and the sides of the square are parallel to the sides of the two given rectangles. What is the smallest possible area of the square $?$

For $a,b, x \in R$ holds: $x^2 - (2a^2 + 4)x + a^2 + 2a + b = 0$. For which $b$ does this equation have at least one root between $0$ and $1$ for all $a$?