Consider $\vartriangle ABC$ and a point $S$ inside it. Let $A_1, B_1, C_1$ be the intersection points of $AS, BS, CS$ with $BC, AC, AB$, respectively. Prove that at least in one of the resulting quadrilaterals $AB_1SC_1, C_1SA_1B, A_1SB_1C$ both angles at either $C_1$ and $B_1$, or $C_1$ and $A_1$, or $A_1$ and $B_1$ are not acute.

In a classroom there are $m$ students. During the month of July each of them visited the library at least once but none of them visited the library twice in the same day. It turned out that during the month of July each student visited the library a different number of times, furthermore for any two students $A$ and $B$ there was a day in which $A$ visited the library and $B$ did not and there was also a day when $B$ visited the library and $A$ did not do so. Determine the largest possible value of $m$.

We have seven equal pails with water, filled to one half, one third, one quarter, one fifth, one eighth, one ninth, and one tenth, respectively. We are allowed to pour water from one pail into another until the first pail empties or the second one fills to the brim. Can we obtain a pail that is filled to (a) one twelfth, (b) one sixth after several such steps?

How many ways are there to fill an $8\times8\times8$ cube with $1\times1\times8$ sticks? Rotations and reflections are considered distinct. [i]Team #2[/i]

What fraction of a $5$-dimensional cube is the volume of the inscribed sphere? What fraction is it of a $10$-dimensional cube?

What is the maximum number of colours that can be used to paint an $8 \times 8$ chessboard so that every square is painted in a single colour, and is adjacent , horizontally, vertically but not diagonally, to at least two other squares of its own colour? (A Shapovalov)

Jar A contains four liters of a solution that is $45\%$ acid. Jar B contains five liters of a solution that is $48\%$ acid. Jar C contains one liter of a solution that is $k\%$ acid. From jar C, $\tfrac{m}{n}$ liters of the solution is added to jar A, and the remainder of the solution in jar C is added to jar B. At the end, both jar A and jar B contain solutions that are $50\%$ acid. Given that $m$ and $n$ are relatively prime positive integers, find $k+m+n$.

Let $n \ge 4$ and $k$ be positive integers. We consider $n$ lines in the plane between which there are not two parallel nor three concurrent. In each of the $\frac{n(n-1)}{2}$ points of intersection of these lines, $k$ coins are placed. Ana and Beto play the following game in turns: each player, in turn, chooses one of those points that does not share one of the $n$ lines with the point chosen immediately before by the other player, and removes a coin from that point. Ana starts and can choose any point. The player who cannot make his move loses. Determine based on $n$ and $k$ who has a winning strategy.

Suppose $ABC$ is an acute triangle. Points $A_1, B_1$ and $C_1$ are chosen on sides $BC, AC$ and $AB$ respectively so that the rays $A_1A, B_1B$ and $C_1C$ are bisectors of triangle $A_1B_1C_1$. Prove that $AA_1, BB_1$ and $CC_1$ are altitudes of triangle $ABC$. (6)

In how many ways can we form three teams of four players each from a group of $12$ participants?

Alice and Bob play the following game. It begins with a set of $1000$ $1\times 2$ rectangles. A [i]move[/i] consists of choosing two rectangles (a rectangle may consist of one or several $1\times 2$ rectangles combined together) that share a common side length and combining those two rectangles into one rectangle along those sides sharing that common length. The first player who cannot make a move loses. Alice moves first. Describe a winning strategy for Bob.

Anna and Bob, with Anna starting first, alternately color the integers of the set $S = \{1, 2, ..., 2022 \}$ red or blue. At their turn each one can color any uncolored number of $S$ they wish with any color they wish. The game ends when all numbers of $S$ get colored. Let $N$ be the number of pairs $(a, b)$, where $a$ and $b$ are elements of $S$, such that $a$, $b$ have the same color, and $b - a = 3$. Anna wishes to maximize $N$. What is the maximum value of $N$ that she can achieve regardless of how Bob plays?

[b]p1.[/b] (a) Put the numbers $1$ to $6$ on the circle in such way that for any five consecutive numbers the sum of first three (clockwise) is larger than the sum of remaining two. (b) Can you arrange these numbers so it works both clockwise and counterclockwise. [b]p2.[/b] A girl has a box with $1000$ candies. Outside the box there is an infinite number of chocolates and muffins. A girl may replace: $\bullet$ two candies in the box with one chocolate bar, $\bullet$ two muffins in the box with one chocolate bar, $\bullet$ two chocolate bars in the box with one candy and one muffin, $\bullet$ one candy and one chocolate bar in the box with one muffin, $\bullet$ one muffin and one chocolate bar in the box with one candy. Is it possible that after some time it remains only one object in the box? [b]p3.[/b] Find any integer solution of the puzzle: $WE+ST+RO+NG=128$ (different letters mean different digits between $1$ and $9$). [b]p4.[/b] Two consecutive three‐digit positive integer numbers are written one after the other one. Show that the six‐digit number that is obtained is not divisible by $1001$. [b]p5.[/b] There are $9$ straight lines drawn in the plane. Some of them are parallel some of them intersect each other. No three lines do intersect at one point. Is it possible to have exactly $17$ intersection points? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In $\triangle ABC,\sin A=\frac{3}{5},\cos B=\frac{5}{13}$, then $\cos C=$________.

Find the number of sequences $a_1,a_2,\dots,a_{100}$ such that $\text{(i)}$ There exists $i\in\{1,2,\dots,100\}$ such that $a_i=3$, and $\text{(ii)}$ $|a_i-a_{i+1}|\leq 1$ for all $1\leq i<100$.

A sequence $(x_n)_{n\ge 0}$ is defined as follows: $x_0=a,x_1=2$ and $x_n=2x_{n-1}x_{n-2}-x_{n-1}-x_{n-2}+1$ for all $n>1$. Find all integers $a$ such that $2x_{3n}-1$ is a perfect square for all $n\ge 1$.

Find all natural numbers that can be expressed in a unique way as a sum of five or less perfect squares.

Find all functions $f: \mathbb R \rightarrow \mathbb R$ such that for all $x, y \in \mathbb R$, $$f(f(x) + y)^2 = (x-y)(f(x) - f(y)) + 4f(x) f(y).$$

A triangle has perimeter $2s$, inradius $r$, and incenter $I$. If $s_a, s_b$ and $s_c$ are the distances from $I$ to the three vertices, then show that $$\frac34 +\frac{r}{s_a}+\frac{r}{s_b}+\frac{r}{s_c} \le \frac{s^2}{12r^2}$$

Leonard wrote three 3-digit numbers on the board whose sum is $1000$. All of the nine digits are different. Determine which digit does not appear on the board. [i]Proposed by Giorgi Arabidze, Georgia[/i]

A triangle has inradius $r$ and circumradius $R$. Its longest altitude has length $H$. Show that if the triangle does not have an obtuse angle, then $H \ge r+R$. When does equality hold?

Find all triples $(x,y,z)$ of positive integers such that $x \leq y \leq z$ and \[x^3(y^3+z^3)=2012(xyz+2).\]

For an integer $n \ge 2$, let $G_n$ be an $n \times n$ grid of unit cells. A subset of cells $H \subseteq G_n$ is considered \textit{quasi-complete} if and only if each row of $G_n$ has at least one cell in $H$ and each column of $G_n$ has at least one cell in $H$. A subset of cells $K \subseteq G_n$ is considered \textit{quasi-perfect} if and only if there is a proper subset $L \subset K$ such that $|L| = n$ and no two elements in $L$ are in the same row or column. Let $\vartheta(n)$ be the smallest positive integer such that every quasi-complete subset $H \subseteq G_n$ with $|H| \ge \vartheta(n)$ is also quasi-perfect. Moreover, let $\varrho(n)$ be the number of quasi-complete subsets $H \subseteq G_n$ with $|H| = \vartheta(n) - 1$ such that $H$ is not quasi-perfect. Compute $\vartheta(20) + \varrho(20)$.

Let $p$ be a natural number greater than or equal to $2$ and let $(M, \cdot)$ be a finite monoid such that $a^p \ne a$, for any $a\in M \backslash \{e\}$, where $e$ is the identity element of $M$. Show that $(M, \cdot)$ is a group.

Given the polynomial $P(x)=(x^2-7x+6)^{2n}+13$ where $n$ is a positive integer. Prove that $P(x)$ can't be written as a product of $n+1$ non-constant polynomials with integer coefficients.