Permutation $\pi$ of $\{1,\dots,n\}$ is called [b]stable[/b] if the set $\{\pi (k)-k|k=1,\dots,n\}$ is consisted of exactly two different elements. Prove that the number of stable permutation of $\{1,\dots,n\}$ equals to $\sigma (n)-\tau (n)$ in which $\sigma (n)$ is the sum of positive divisors of $n$ and $\tau (n)$ is the number of positive divisors of $n$. Time allowed for this problem was 75 minutes.

Prove that for each coloring of the points inside or on the boundary of a square with $1391$ colors, there exists a monochromatic regular hexagon.

We say a positive integer $n$ is $k$-special if none of its figures is zero and, for any permutation the figures of $n$, the resulting number is multiple of $k$. Let $m\ge 2$ be a positive integer. [list] [*] Find the number of $4$-special numbers with $m$ figures. [*] Find the number of $3$-special numbers with $m$ figures. [/list]

Given an equilateral triangle with sidelength $k$ cm. With lines parallel to it's sides, we split it into $k^2$ small equilateral triangles with sidelength $1$ cm. This way, a triangular grid is created. In every small triangle of sidelength $1$ cm, we place exactly one integer from $1$ to $k^2$ (included), such that there are no such triangles having the same numbers. With vertices the points of the grid, regular hexagons are defined of sidelengths $1$ cm. We shall name as [i]value [/i] of the hexagon, the sum of the numbers that lie on the $6$ small equilateral triangles that the hexagon consists of . Find (in terms of the integer $k>4$) the maximum and the minimum value of the sum of the values of all hexagons .

$2024$ ones and $2024$ twos are arranged in a circle in some order. Is it always possible to divide the circle into [b]a)[/b] two (contiguous) parts with equal sums? [b]b)[/b] three (contiguous) parts with equal sums? [i]Proposed by Fedir Yudin[/i]

A company has $n$ employees. It is known that each of the employees works at least one of the $7$ days of the week, with the exception of an employee who does not work any of the $7$ days. Furthermore, for any two of these $n$ employees, there are at least $3$ days of the week in which one of the two works that day and the other does not (it is not necessarily the same employee who works those days). Determine the highest possible value of $n$.

From $2008 \times 2008$ square we remove one corner cell $1 \times 1$. Is number of ways to divide this figure to corners from $3$ cells odd or even ?

Let $n$ be a positive integer. $S_1, S_2, \ldots, S_n$ are pairwise non-intersecting sets, and $S_k $ has exactly $k$ elements $(k = 1, 2, \ldots, n)$. Define $S = S_1\cup S_2\cup\cdots \cup S_n$. The function $f: S \to S $ maps all elements in $S_k$ to a fixed element of $S_k$, $k = 1, 2, \ldots, n$. Find the number of functions $g: S \to S$ satisfying $f(g(f(x))) = f(x).$

A flea is, initially, in the point, which the coordinate is $1$, in the real line. At each second, from the coordinate $a$, the flea can jump to the coordinate point $a+2$ or to the coordinate point $\frac{a}{2}$. Determine the quantity of distinct positions(including the initial position) which the flea can be in until $n$ seconds. For instance, if $n=1$, the flea can be in the coordinate points $1,3$ or $\frac{1}{2}$.

[u]Set 3[/u] [b]3.1[/b] Annie has $24$ letter tiles in a bag; $8$ C’s, $8$ M’s, and $8$ W’s. She blindly draws tiles from the bag until she has enough to spell “CMWMC.” What is the maximum number of tiles she may have to draw? [b]3.2[/b] Let $T$ be the answer from the previous problem. Charlotte is initially standing at $(0, 0)$ in the coordinate plane. She takes $T$ steps, each of which moves her by $1$ unit in either the $+x$, $-x$, $+y$, or $-y$ direction (e.g. her first step takes her to $(1, 0)$, $(1, 0)$, $(0, 1)$ or $(0, -1)$). After the T steps, how many possibilities are there for Charlotte’s location? [b]3.3[/b] Let $T$ be the answer from the previous problem, and let $S$ be the sum of the digits of $T$. Francesca has an unfair coin with an unknown probability $p$ of landing heads on a given flip. If she flips the coin $S$ times, the probability she gets exactly one head is equal to the probability she gets exactly two heads. Compute the probability $p$. PS. You should use hide for answers.

For a finite set $A$ of positive integers, a partition of $A$ into two disjoint nonempty subsets $A_1$ and $A_2$ is $\textit{good}$ if the least common multiple of the elements in $A_1$ is equal to the greatest common divisor of the elements in $A_2$. Determine the minimum value of $n$ such that there exists a set of $n$ positive integers with exactly $2015$ good partitions.

An urn contains balls of $k$ different colors; there are $n_i$ balls of $i-th$ color. Balls are selected at random from the urn, one by one, without replacement, until among the selected balls $m$ balls of the same color appear. Find the greatest number of selections.

The numbers $ 0$, $ 1$, $ \dots$, $ n$ ($ n \ge 2$) are written on a blackboard. In each step we erase an integer which is the arithmetic mean of two different numbers which are still left on the blackboard. We make such steps until no further integer can be erased. Let $ g(n)$ be the smallest possible number of integers left on the blackboard at the end. Find $ g(n)$ for every $ n$.

$A$ is the set of points of a convex $n$-gon on a plane. The distinct pairwise distances between any $2$ points in $A$ arranged in descending order is $d_1>d_2>...>d_m>0$. Let the number of unordered pairs of points in $A$ such that their distance is $d_i$ be exactly $\mu _i$, for $i=1, 2,..., m$. Prove: For any positive integer $k\leq m$, $\mu _1+\mu _2+...+\mu _k\leq (3k-1)n$.

In a graph with $n$ vertices every two vertices are connected by a unique path. For each two vertices $u$ and $v$, let $d(u, v)$ denote the distance between $u$ and $v$, i.e. the number of edges in the path connecting these two vertices, and $\deg(u)$ denote the degree of a vertex $u$. Let $W$ be the sum of pairwise distances between the vertices, and $D$ the sum of weighted pairwise distances: $\sum_{\{u, v\}}(\deg(u)+\deg(v))d(u, v)$. Prove that $D=4W-n(n-1)$.

In a $99\times 101$ table , cubes of natural numbers, as shown in figure . Prove that the sum of all numbers in the table are divisible by $200$. [img]https://cdn.artofproblemsolving.com/attachments/3/e/dd3d38ca00a36037055acaaa0c2812ae635dcb.png[/img]

Find all positive integers $n$ for which it is possible to partition a regular $n$-gon into triangles with diagonals not intersecting inside the $n$-gon such that at every vertex of the $n$-gon an odd number of triangles meet.

A $\pm 1$-[i]sequence[/i] is a sequence of $2022$ numbers $a_1, \ldots, a_{2022},$ each equal to either $+1$ or $-1$. Determine the largest $C$ so that, for any $\pm 1$-sequence, there exists an integer $k$ and indices $1 \le t_1 < \ldots < t_k \le 2022$ so that $t_{i+1} - t_i \le 2$ for all $i$, and $$\left| \sum_{i = 1}^{k} a_{t_i} \right| \ge C.$$

A mushroom is called [i]bad [/i] if it contains at least $10$ worms. A basket contains $90$ bad and $10$ good mushrooms. Can all mushrooms become good after some worms crawl from bad mushrooms to good ones? [hide=original wording]Гриб называется плохим, если в нем не менее 10 червей. В лукошке 90 плохих и 10 хороших грибов. Могут ли все грибы стать хорошими после того, как некоторые черви переползут из плохих грибов в хорошие?[/hide]

Consider an increasing sequence of real numbers $a_1<a_2<\ldots<a_{2023}$ such that all pairwise sums of the elements in the sequence are different. For such a sequence, denote by $M$ the number of pairs $(a_i,a_j)$ such that $a_i<a_j$ and $a_i+a_j<a_2+a_{2022}$. Find the minimal and the maximal possible value of $M$.

p1. A quadratic equation has the natural roots $a$ and $ b$. Another quadratic equation has roots $ b$ and $c$ with $a\ne c$. If $a$, $ b$, and $c$ are prime numbers less than $15$, how many triplets $(a,b,c)$ that might meet these conditions are there (provided that the coefficient of the quadratic term is equal to $ 1$)? p2. In Indonesia, was formerly known the "Archipelago Fraction''. The [i]Archipelago Fraction[/i] is a fraction $\frac{a}{b}$ such that $a$ and $ b$ are natural numbers with $a < b$. Find the sum of all Archipelago Fractions starting from a fraction with $b = 2$ to $b = 1000$. p3. Look at the following picture. The letters $a, b, c, d$, and $e$ in the box will replaced with numbers from $1, 2, 3, 4, 5, 6, 7, 8$, or $9$, provided that $a,b, c, d$, and $e$ must be different. If it is known that $ae = bd$, how many arrangements are there? [img]https://cdn.artofproblemsolving.com/attachments/f/2/d676a57553c1097a15a0774c3413b0b7abc45f.png[/img] p4. Given a triangle $ABC$ with $A$ as the vertex and $BC$ as the base. Point $P$ lies on the side $CA$. From point $A$ a line parallel to $PB$ is drawn and intersects extension of the base at point $D$. Point $E$ lies on the base so that $CE : ED = 2 :3$. If $F$ is the midpoint between $E$ and $C$, and the area of ​​triangle ABC is equal with $35$ cm$^2$, what is the area of ​​triangle $PEF$? p5. Each side of a cube is written as a natural number. At the vertex of each angle is given a value that is the product of three numbers on three sides that intersect at the vertex. If the sum of all the numbers at the points of the angle is equal to $1001$, find the sum of all the numbers written on the sides of the cube.

Given is a board $n \times n$ and in every square there is a checker. In one move, every checker simultaneously goes to an adjacent square (two squares are adjacent if they share a common side). In one square there can be multiple checkers. Find the minimum and the maximum number of covered cells for $n=5, 6, 7$.

Consider a $2018 \times 2019$ board with integers in each unit square. Two unit squares are said to be neighbours if they share a common edge. In each turn, you choose some unit squares. Then for each chosen unit square the average of all its neighbours is calculated. Finally, after these calculations are done, the number in each chosen unit square is replaced by the corresponding average. Is it always possible to make the numbers in all squares become the same after finitely many turns?

There is a chess tournament with $2n$ players ($n > 1$). There is at most one match between each pair of players. If it is not possible to find three players who all play each other, show that there are at most $n^2$ matches. Conversely, show that if there are at most $n^2$ matches, then it is possible to arrange them so that we cannot find three players who all play each other.

Eight children, all of different heights, must form an orderly line from smallest to largest. We will say that the row has exactly one error if there is a child that is immediately behind another taller than it, and everyone else (except the first in line) is immediately behind a shorter one. of how many ways the eight children can line up with exactly one mistake?