Let $k,m,n$ be positive integers such that $1\le m\le n$ and denote $S=\{1,2,\ldots,n\}$. Suppose that $A_1,A_2,\ldots,A_k$ are $m$-element subsets of $S$ with the following property: for every $i=1,2,\ldots,k$ there exists a partition $S=S_{1,i}\cup S_{2,i}\cup\ldots\cup S_{m,i}$ (into pairwise disjoint subsets) such that (i) $A_i$ has precisely one element in common with each member of the above partition. (ii) Every $A_j,j\ne i$ is disjoint from at least one member of the above partition. Show that $k\le\binom{n-1}{m-1}$.

A gradian is a unit of measurement of angles much like degrees, except that there are $100$ gradians in a right angle. Suppose that the number of gradians in an interior angle of a regular polygon with $m$ sides equals the number of degrees in an interior angle of a regular polygon with $n$ sides. Compute the number of possible distinct ordered pairs $(m, n)$.

Determine the maximal size of a set of positive integers with the following properties: $1.$ The integers consist of digits from the set $\{ 1,2,3,4,5,6\}$. $2.$ No digit occurs more than once in the same integer. $3.$ The digits in each integer are in increasing order. $4.$ Any two integers have at least one digit in common (possibly at different positions). $5.$ There is no digit which appears in all the integers.

Daniel has a (mostly) standard deck of 54 cards, consisting of 4 suits each containing the ranks 1 to 13 as well as 2 jokers. Daniel plays the following game: He shuffles the deck uniformly randomly and then takes all of the cards that end up strictly between the two jokers. He then sums up the ranks of all the cards he has taken and calls that his score. Let $p$ be the probability that his score is a multiple of 13. There exists relatively prime positive integers $a$ and $b,$ with $b$ as small as possible, such that $|p - a/b| < 10^{-10}.$ What is $a/b?$ [i]Proposed by Dilhan Salgado, Daniel Li[/i]

A cycling group that has $4n$ members will have several cycling events, such that: a) Two cycling events are done every week; once on Saturday and once on Sunday. b) Exactly $2n$ members participate in any cycling event. c) No member may participate in both cycling events of a week. d) After all cycling events are completed, the number of events where each pair of members meet is the same for all pairs of members. Prove that after all cycling events are completed, the number of events where each group of three members meet is the same value $t$ for all groups of three members, and that for $n \ge 2$, $t$ is divisible by $n-1$.

Let $P_1P_2...P_n$ be a regular $n$-gon in the plane and $a_1, . . . , a_n$ be nonnegative integers. It is possible to draw $m$ circles so that for each $1 \le i \le n$, there are exactly $a_i$ circles that contain $P_i$ on their interior. Find, with proof, the minimum possible value of $m$ in terms of the $a_i$. .

In an exhibition there are $100$ paintings each of which is made with exactly $k$ colors. Find the minimum possible value of $k$ if any $20$ paintings have a common color but there is no color that is used in all paintings.

Fifteen elephants stand in a row. Their weights are expressed by integer numbers of kilograms. The sum of the weight of each elephant (except the one on the extreme right) and the doubled weight of its right neighbour is exactly $15$ tonnes. Determine the weight of each elephant. (F.L. Nazarov)

Five points are selected on the plane so that no three of them lie on one straight line. Prove that some four of these five points are the vertices of a convex quadrilateral.

A fair coin is repeatedly tossed. We receive one marker for every ”head” and two markers for every ”tail”. We win the game if, at some moment, we possess exactly $100$ markers. Is the probability of winning the game greater than, equal to, or less than $2/3$?

Show that the number of non-zero integers in the expansion of the $n$-th order determinant having zeroes in the main diagonal and ones elsewhere is $$n ! \left(1- \frac{1}{1!} + \frac{1}{2!} - \frac{1}{3!} + \cdots + \frac{(-1)^{n}}{n!} \right) .$$

How many ways are there of representing a positive integer $n$ as the sum of three positive integers? Representations which differ only in the order of the summands are considered to be distinct.

Several positive integers are written in a row. Iteratively, Alice chooses two adjacent numbers $x$ and $y$ such that $x>y$ and $x$ is to the left of $y$, and replaces the pair $(x,y)$ by either $(y+1,x)$ or $(x-1,x)$. Prove that she can perform only finitely many such iterations. [i]Proposed by Warut Suksompong, Thailand[/i]

Let $N$ be a positive integer. Consider a $N \times N$ array of square unit cells. Two corner cells that lie on the same longest diagonal are colored black, and the rest of the array is white. A [i]move[/i] consists of choosing a row or a column and changing the color of every cell in the chosen row or column. What is the minimal number of additional cells that one has to color black such that, after a finite number of moves, a completely black board can be reached?

Let $ k$ be a positive integer. Set $ A \subseteq \mathbb{Z}$ is called a $ \textbf{k \minus{} set}$ if there exists $ x_1, x_2, \cdots, x_k \in \mathbb{Z}$ such that for any $ i \neq j$, $ (x_i \plus{} A) \cap (x_j \plus{} A) \equal{} \emptyset$, where $ x \plus{} A \equal{} \{ x \plus{} a \mid a \in A \}$. Prove that if $ A_i$ is $ \textbf{k}_i\textbf{ \minus{} set}$($ i \equal{} 1,2, \cdots, t$), and $ A_1 \cup A_2 \cup \cdots \cup A_t \equal{} \mathbb{Z}$, then $ \displaystyle \frac {1}{k_1} \plus{} \frac {1}{k_2} \plus{} \cdots \plus{} \frac {1}{k_t} \geq 1$.

Twenty-one girls and twenty-one boys took part in a mathematical competition. It turned out that each contestant solved at most six problems, and for each pair of a girl and a boy, there was at least one problem that was solved by both the girl and the boy. Show that there is a problem that was solved by at least three girls and at least three boys.

The set of natural numbers $\mathbb{N}$ are partitioned into a finite number of subsets.Prove that there exists a subset of $S$ so that for any natural numbers $n$,there are infinitely many multiples of $n$ in $S$.

An international society has its members from six different countries. The list of members contain $1978$ names, numbered $1, 2, \dots, 1978$. Prove that there is at least one member whose number is the sum of the numbers of two members from his own country, or twice as large as the number of one member from his own country.

Let ${n}$ and $k$ be positive integers. There are given ${n}$ circles in the plane. Every two of them intersect at two distinct points, and all points of intersection they determine are pairwise distinct (i. e. no three circles have a common point). No three circles have a point in common. Each intersection point must be colored with one of $n$ distinct colors so that each color is used at least once and exactly $k$ distinct colors occur on each circle. Find all values of $n\geq 2$ and $k$ for which such a coloring is possible. [i]Proposed by Horst Sewerin, Germany[/i]

In a room there is a series of bulbs on a wall and corresponding switches on the opposite wall. If you put on the $n$ -th switch the $n$ -th bulb will light up. There is a group of men who are operating the switches according to the following rule: they go in one by one and starts flipping the switches starting from the first switch until he has to turn on a bulb; as soon as he turns a bulb on, he leaves the room. For example the first person goes in, turns the first switch on and leaves. Then the second man goes in, seeing that the first switch on turns it off and then lights the second bulb. Then the third person goes in, finds the first switch off and turns it on and leaves the room. Then the fourth person enters and switches off the first and second bulbs and switches on the third. The process continues in this way. Finally we find out that first 10 bulbs are off and the 11 -th bulb is on. Then how many people were involved in the entire process?

Find maximum value of number $a$ such that for any arrangement of numbers $1,2,\ldots ,10$ on a circle, we can find three consecutive numbers such their sum bigger or equal than $a$.

Given is a $K_{2024}$ in which every edge has weight $1$ or $2$. If every cycle has even total weight, find the minimal value of the sum of all weights in the graph.

In chess, a king threatens another king if, and only if, they are on neighboring squares, whether horizontally, vertically, or diagonally . Find the greatest amount of kings that can be placed on a $12 \times 12$ board such that each king threatens just another king. Here, we are not considering part colors, that is, consider that the king are all, say, white, and that kings of the same color can threaten each other.

[b](a)[/b] Each of Peter and Basil thinks of three positive integers. For each pair of his numbers, Peter writes down the greatest common divisor of the two numbers. For each pair of his numbers, Basil writes down the least common multiple of the two numbers. If both Peter and Basil write down the same three numbers, prove that these three numbers are equal to each other. [b](b)[/b] Can the analogous result be proved if each of Peter and Basil thinks of four positive integers instead?

We are given the set $$M = \{-2^{2022}, -2^{2021}, . . . , -2^{2}, -2, -1, 1, 2, 2^2, . . . , 2^{2021}, 2^{2022}\}.$$ Let $T$ be a subset of $M$, such that neighbouring numbers have the same difference when the elements are ordered by size. (a) Determine the maximum number of elements that such a set $T$ can contain. (b) Determine all sets $T$ with the maximum number of elements. [i](Walther Janous)[/i]