In an $n\times{n}$ grid, there are some cats living in each cell (the number of cats in a cell must be a non-negative integer). Every midnight, the manager chooses one cell: (a) The number of cats living in the chosen cell must be greater than or equal to the number of neighboring cells of the chosen cell. (b) For every neighboring cell of the chosen cell, the manager moves one cat from the chosen cell to the neighboring cell. (Two cells are called "neighboring" if they share a common side, e.g. there are only $2$ neighboring cells for a cell in the corner of the grid) Find the minimum number of cats living in the whole grid, such that the manager is able to do infinitely many times of this process.

Alice has two urns. Each urn contains four balls and on each ball a natural number is written. She draws one ball from each urn at random, notes the sum of the numbers written on them, and replaces the balls in the urns from which she took them. This she repeats a large number of times. Bill, on examining the numbers recorded, notices that the frequency with which each sum occurs is the same as if it were the sum of two natural numbers drawn at random from the range 1 to 4. What can he deduce about the numbers on the balls?

Let $n \in \mathbb N$ and $A_n$ set of all permutations $(a_1, \ldots, a_n)$ of the set $\{1, 2, \ldots , n\}$ for which \[k|2(a_1 + \cdots+ a_k), \text{ for all } 1 \leq k \leq n.\] Find the number of elements of the set $A_n$. [i]Proposed by Vidan Govedarica, Serbia[/i]

Prove there exists a constant $c$ (independent of $n$) such that for any graph $G$ with $n>2$ vertices, we can split $G$ into a forest and at most $cf(n)$ disjoint cycles, where a) $f(n)=n\ln{n}$; b) $f(n)=n$. [i]David Yang.[/i]

Let $n$ be a positive integer. Chef Kao has $n$ different flavors of ice cream. He wants to serve one small cup and one large cup for each flavor. He arranges the $2n$ ice cream cups into two rows of $n$ cups on a tray. He wants the tray to be colorful, so he arranges the ice cream cups with the following conditions: [list] [*]each row contains all ice cream flavors, and [*]each column has different sizes of ice cream cup. [/list]Determine the number of ways that Chef Kao can arrange cups of ice cream with the above conditions.

The mayor of a city wishes to establish a transport system with at least one bus line, in which: - each line passes exactly three stops, - every two different lines have exactly one stop in common, - for each two different bus stops there is exactly one line that passes through both. Determine the number of bus stops in the city.

155 birds $ P_1, \ldots, P_{155}$ are sitting down on the boundary of a circle $ C.$ Two birds $ P_i, P_j$ are mutually visible if the angle at centre $ m(\cdot)$ of their positions $ m(P_iP_j) \leq 10^{\circ}.$ Find the smallest number of mutually visible pairs of birds, i.e. minimal set of pairs $ \{x,y\}$ of mutually visible pairs of birds with $ x,y \in \{P_1, \ldots, P_{155}\}.$ One assumes that a position (point) on $ C$ can be occupied simultaneously by several birds, e.g. all possible birds.

A collection of $n$ positive numbers, where repeats are allowed, adds to $500$. They can be split into $20$ groups each adding to $25$, and can also be split into $25$ groups each adding to $20$. (A group is allowed to contain any amount of integers, even just one integer.) What is the least possible value of $n$? [i]Aaron Wang[/i]

Let $n$ be a given positive integer. Let $\mathbb{N}_+$ denote the set of all positive integers. Determine the number of all finite lists $(a_1,a_2,\cdots,a_m)$ such that: [b](1)[/b] $m\in \mathbb{N}_+$ and $a_1,a_2,\cdots,a_m\in \mathbb{N}_+$ and $a_1+a_2+\cdots+a_m=n$. [b](2)[/b] The number of all pairs of integers $(i,j)$ satisfying $1\leq i<j\leq m$ and $a_i>a_j$ is even. For example, when $n=4$, the number of all such lists $(a_1,a_2,\cdots,a_m)$ is $6$, and these lists are $(4),$ $(1,3),$ $(2,2),$ $(1,1,2),$ $(2,1,1),$ $(1,1,1,1)$.

Given a convex polygon $ G$, show that there are three vertices of $ G$ which form a triangle so that it's perimeter is not less than 70% of the polygon's perimeter.

There are $300$ participants to a mathematics competition. After the competition some of the contestants play some games of chess. Each two contestants play at most one game against each other. There are no three contestants, such that each of them plays against each other. Determine the maximum value of $n$ for which it is possible to satisfy the following conditions at the same time: each contestant plays at most $n$ games of chess, and for each $m$ with $1 \le m \le n$, there is a contestant playing exactly $m$ games of chess.

In each square of a $4 \times 4$ table a number $0$ or $1$ is written, such that the product of every two neighboring squares is $0$ (neighboring by side). $a)$ In how many ways is this possible to do if the middle $2\times 2$ is filled with $4$ zeros? $b)$ In general, in how many ways is this possible to do (regardless of the middle $2 \times 2$)?

Five girls have a little store that opens from Monday through Friday. Since two people are always enough for taking care of it, they decide to do a work plan for the week, specifying who will work each day, and fulfilling the following conditions: a) Each girl will work exactly two days a week b) The 5 assigned couples for the week must be different In how many ways can the girls do the work plan?

A group of people is said to be [i]good[/i] if every member has an even number (zero included) of acquaintances in it. Prove that any group of people can be partitioned into two (possibly empty) parts such that each part is good.

Suppose $f:\mathbb{R} \to \mathbb{R}$ is a function given by $$f(x) =\begin{cases} 1 & \mbox{if} \ x=1 \\ e^{(x^{10}-1)}+(x-1)^2\sin\frac1{x-1} & \mbox{if} \ x\neq 1\end{cases}$$ (a) Find $f'(1)$ (b) Evaluate $\displaystyle \lim_{u\to\infty} \left[100u-u\sum_{k=1}^{100} f\left(1+\frac{k}{u}\right)\right]$.

A white bug sits in one corner square of a $1000$ × $n$ chessboard, where $n$ is an odd positive integer and $n > 2020$. In the two nearest corner squares there are two black chess bishops. On each move, the bug either steps into a square adjacent by side or moves as a chess knight. The bug wishes to reach the opposite corner square by never visiting a square occupied or attacked by a bishop, and visiting every other square exactly once. Show that the number of ways for the bug to attain its goal does not depend on $n$.

Consider all segments dividing the area of a triangle $ABC$ in two equal parts. Find the length of the shortest segment among them, if the side lengths $a,$ $b,$ $c$ of triangle $ABC$ are given. How many of these shortest segments exist ?

Given a finite sequence of real numbers $a_1,a_2,\dots ,a_n$ ($\ast$), we call a segment $a_k,\dots ,a_{k+l-1}$ of the sequence ($\ast$) a “[i]long[/i]”(Chinese dragon) and $a_k$ “[i]head[/i]” of the “[i]long[/i]” if the arithmetic mean of $a_k,\dots ,a_{k+l-1}$ is greater than $1988$. (especially if a single item $a_m>1988$, we still regard $a_m$ as a “[i]long[/i]”). Suppose that there is at least one “[i]long[/i]” among the sequence ($\ast$), show that the arithmetic mean of all those items of sequence ($\ast$) that could be “[i]head[/i]” of a certain “[i]long[/i]” individually is greater than $1988$.

Danielle divides a $30 \times30$ board into $100$ regions that are $3 \times 3$ squares squares each and then paint some squares black and the rest white. Then to each region assigns it the color that has the most squares painted with that color. a) If there are more black regions than white, what is the minimum number $N$ of cells that Danielle can paint black? b) In how many ways can Danielle paint the board if there are more black regions than white and she uses the minimum number $N$ of black squares?

We have an $8\times 8$ board. An [i]interior [/i] edge is an edge between two $1 \times 1$ cells. we cut the board into $1 \times 2$ dominoes. For an inner edge $k$, $N(k)$ denotes the number of ways to cut the board so that it cuts along edge $k$. Calculate the last digit of the sum we get if we add all $N(k)$, where $k$ is an inner edge.

The game of Greed starts with an initial configuration of one or more piles of stones. Player $1$ and Player $2$ take turns to remove stones, beginning with Player $1$. At each turn, a player has two choices: • take one stone from any one of the piles (a simple move); • take one stone from each of the remaining piles (a greedy move). The player who takes the last stone wins. Consider the following two initial configurations: (a) There are $2018$ piles, with either $20$ or $18$ stones in each pile. (b) There are four piles, with $17, 18, 19$, and $20$ stones, respectively. In each case, find an appropriate strategy that guarantees victory to one of the players.

We are given some three element subsets of $\{1,2, \dots ,n\}$ for which any two of them have at most one common element. We call a subset of $\{1,2, \dots ,n\}$ [i]nice [/i] if it doesn't include any of the given subsets. If no matter how the three element subsets are selected in the beginning, we can add one more element to every 29-element [i]nice [/i] subset while keeping it nice, find the minimum value of $n$.

For positive integers $n, k, l$, we define the number of $l$-tuples of positive integers $(a_1,a_2,\cdots a_l)$ satisfying the following as $Q(n,k,l)$. (i): $n=a_1+a_2+\cdots +a_l$ (ii): $a_1>a_2>\cdots > a_l > 0$. (iii): $a_l$ is an odd number. (iv): There are $k$ odd numbers out of $a_i$. For example, from $9=8+1=6+3=6+2+1$, we have $Q(9,1,1)=1$, $Q(9,1,2)=2$, $Q(9,1,3)=1$. Prove that if $n>k^2$, $\sum_{l=1}^n Q(n,k,l)$ is $0$ or an even number.

We have many $\text{three-element}$ subsets of a $1000\text{-element}$ set. We know that the union of every $5$ of them has at least $12$ elements. Find the most possible value for the number of these subsets.

You are given a positive integer $k$ and not necessarily distinct positive integers $a_1, a_2 , a_3 , \ldots, a_k$. It turned out that for any coloring of all positive integers from $1$ to $2021$ in one of the $k$ colors so that there are exactly $a_1$ numbers of the first color, $a_2$ numbers of the second color, $\ldots$, and $a_k$ numbers of the $k$-th color, there is always a number $x \in \{1, 2, \ldots, 2021\}$, such that the total number of numbers colored in the same color as $x$ is exactly $x$. What are the possible values of $k$? [i]Proposed by Arsenii Nikolaiev[/i]