Dilhan has objects of $3$ types, $A$, $B$, and $C$, and $6$ functions $$f_{A,B},f_{A,C},f_{B,A},f_{B,C},f_{C,A},f_{C,B}$$where $f_{X,Y}$ takes in an object of type $X$ and outputs an object of type $Y$. Dilhan wants to compose his $6$ functions, without repeats, such that the resulting expression is well-typed, meaning an object can be taken in by the first function, and the resulting output can then be taken in by the second function, and so on. In how many orders can he compose his $6$ functions, satisfying this constraint? [i]Proposed by Adam Bertelli[/i]

A blackboard contains $2018$ instances of the digit $1$ separated by spaces. Georg and his mother play a game where they take turns filling in one of the spaces between the digits with either a $+$ or a $\times$. Georg begins, and the game ends when all spaces have been filled. Georg wins if the value of the expression is even, and his mother wins if it is odd. Which player may prepare a strategy which secures him/her victory?

The leader of an IMO team chooses positive integers $n$ and $k$ with $n > k$, and announces them to the deputy leader and a contestant. The leader then secretly tells the deputy leader an $n$-digit binary string, and the deputy leader writes down all $n$-digit binary strings which differ from the leader’s in exactly $k$ positions. (For example, if $n = 3$ and $k = 1$, and if the leader chooses $101$, the deputy leader would write down $001, 111$ and $100$.) The contestant is allowed to look at the strings written by the deputy leader and guess the leader’s string. What is the minimum number of guesses (in terms of $n$ and $k$) needed to guarantee the correct answer?

Let $n$ be a natural number. The graph $G$ has $10n$ vertices. They are separated into $10$ groups with $n$ vertices and we know that there is an edge between two of them if and only if they belong to two different groups. What’s the greatest number of edges a subgraph of $G$ can have, so that there are no 4-cliques in it?

How many ways can you fill a table of size $n\times n$ with integers such that each cell contains the total number of even numbers in its row and column other than itself? Two tables are different if they differ in at least one cell.

The six offices of the city of Salavaara are to be connected to each other by a communication network which utilizes modern picotechnology. Each of the offices is to be connected to all the other ones by direct cable connections. Three operators compete to build the connections, and there is a separate competition for every connection. When the network is finished one notices that the worst has happened: the systems of the three operators are incompatible. So the city must reject connections built by two of the operators, and these are to be chosen so that the damage is minimized. What is the minimal number of offices which still can be connected to each other, possibly through intermediate offices, in the worst possible case.

A real number $f(X)\neq 0$ is assigned to each point $X$ in the space. It is known that for any tetrahedron $ABCD$ with $O$ the center of the inscribed sphere, we have : \[ f(O)=f(A)f(B)f(C)f(D). \] Prove that $f(X)=1$ for all points $X$. [i]Proposed by Aleksandar Ivanov[/i]

Given positive integer $ m \geq 17$, $ 2m$ contestants participate in a circular competition. In each round, we devide the $ 2m$ contestants into $ m$ groups, and the two contestants in one group play against each other. The groups are re-divided in the next round. The contestants compete for $ 2m\minus{}1$ rounds so that each contestant has played a game with all the $ 2m\minus{}1$ players. Find the least possible positive integer $ n$, so that there exists a valid competition and after $ n$ rounds, for any $ 4$ contestants, non of them has played with the others or there have been at least $ 2$ games played within those $ 4$.

Let $m$ be a positive integer. Two players, Axel and Elina play the game HAUKKU ($m$) proceeds as follows: Axel starts and the players choose integers alternately. Initially, the set of integers is the set of positive divisors of a positive integer $m$ .The player in turn chooses one of the remaining numbers, and removes that number and all of its multiples from the list of selectable numbers. A player who has to choose number $1$, loses. Show that the beginner player, Axel, has a winning strategy in the HAUKKU ($m$) game for all $m \in Z_{+}$. PS. As member Loppukilpailija noted, it should be written $m>1$, as the statement does not hold for $m = 1$.

Let $M, k>0$ integers. Let $X(M,k)$ the (infinite) set of all integers that can be factored as ${p_1}^{e_1} \cdot {p_2}^{e_2} \cdot \ldots \cdot {p_r}^{e_r}$ where each $p_i$ is not smaller than $M$ and also each $e_i$ is not smaller than $k$. Let $Z(M,k,n)$ the number of elements of $X(M,k)$ not bigger than $n$. Show that there are positive reals $c(M,k)$ and $\beta(M,k)$ such that $$\lim_{n \rightarrow \infty}{\frac{Z(M,k,n)}{n^{\beta(M,k)}}} = c(M,k)$$ and find $\beta(M,k)$

Three numbers are initially written on the board: 2023, 2024, and 2025. In each move, you can increase any two of these numbers by 1 and decrease the third one by 2. a) Determine whether it is possible to perform a sequence of operations such that the board eventually contains two numbers that are equal. b) Calculate the number of all possible ordered triples of positive integers that can be obtained by performing such operations some number of times. [i]Proposed by Giorgi Arabidze, Georgia [/i]

Let Pascal triangle be an equilateral triangular array of number, consists of $2019$ rows and except for the numbers in the bottom row, each number is equal to the sum of two numbers immediately below it. How many ways to assign each of numbers $a_0, a_1,...,a_{2018}$ (from left to right) in the bottom row by $0$ or $1$ such that the number $S$ on the top is divisible by $1019$.

Let $S$ be a set of three, not necessarily distinct, positive integers. Show that one can transform $S$ into a set containing $0$ by a finite number of applications of the following rule: Select two of the integers $x$ and $y$, where $x\leq y$ and replace them with $2x$ and $y-x.$

A group of persons is called [i]good[/i] if its members can be distributed to several rooms so that nobody is acquainted with any person in the same room but it is possible to choose a person from each room so that all the chosen persons are acquainted with each other. A group is called [i]perfect[/i] if it is good and every set of its members is also good. A perfect group planned a party. However one of its members, Alice, brought here acquaintance Bob, who was not originally expected, and introduced him to all her other acquaintances. Prove that the new group is also perfect. [i]Author: C. Berge[/i]

On a circle, there are $1000$ nonzero real numbers painted black and white in turn. Each black number is equal to the sum of two white numbers adjacent to it, and each white number is equal to the product of two black numbers adjacent to it. What are the possible values of the total sum of $1000$ numbers?

A road company is trying to build a system of highways in a country with $21$ cities. Each highway runs between two cities. A trip is a sequence of distinct cities $C_1,\dots, C_n$, for which there is a highway between $C_i$ and $C_{i+1}$. The company wants to fulfill the following two constraints: (1) for any ordered pair of distinct cities $(C_i, C_j)$, there is exactly one trip starting at $C_i$ and ending at $C_j$. (2) if $N$ is the number of trips including exactly 5 cities, then $N$ is maximized. What is this maximum value of $N$?

Suppose we have a pack of $2n$ cards, in the order $1, 2, . . . , 2n$. A perfect shuffle of these cards changes the order to $n+1, 1, n+2, 2, . . ., n- 1, 2n, n$ ; i.e., the cards originally in the first $n$ positions have been moved to the places $2, 4, . . . , 2n$, while the remaining $n$ cards, in their original order, fill the odd positions $1, 3, . . . , 2n - 1.$ Suppose we start with the cards in the above order $1, 2, . . . , 2n$ and then successively apply perfect shuffles. What conditions on the number $n$ are necessary for the cards eventually to return to their original order? Justify your answer. [hide="Remark"] Remark. This problem is trivial. Alternatively, it may be required to find the least number of shuffles after which the cards will return to the original order.[/hide]

In the Intergalactic Lottery, $7$ numbers are drawn out of $55$. R2-D2 and C-3PO decide that they want to win this lottery, so they fill out lottery tickets separately such that for each possible draw one of them does have a winning ticket for that draw. Prove that one of them has $7$ tickets with all different numbers.

Let $P_1$ be a regular $n$-gon, where $n\in\mathbb{N}$. We construct $P_2$ as the regular $n$-gon whose vertices are the midpoints of the edges of $P_1$. Continuing analogously, we obtain regular $n$-gons $P_3,P_4,\ldots ,P_m$. For $m\ge n^2-n+1$, find the maximum number $k$ such that for any colouring of vertices of $P_1,\ldots ,P_m$ in $k$ colours there exists an isosceles trapezium $ABCD$ whose vertices $A,B,C,D$ have the same colour. [i]Radu Ignat[/i]

A baseball league has $6$ teams. To decide the schedule for the league, for each pair of teams, a coin is flipped. If it lands head, they will play a game this season, in which one team wins and one team loses. If it lands tails, they don't play a game that season. Define the [i]imbalance[/i] of this schedule to be the minimum number of teams that will end up undefeated, i.e. lose $0$ games. Find the expected value of the imbalance in this league.

Peter plays a solitaire game with a deck of cards, some of which are face-up while the others are face-down. Peter loses if all the cards are face-down. As long as at least one card is face up, Peter must choose a stack of consecutive cards from the deck, so that the top and the bottom cards of the stack are face-up. They may be the same card. Then Peter turns the whole stack over and puts it back into the deck in exactly the same place as before. Prove that Peter always loses. (A Shapovalov)

A lattice point $X$ in the plane is said to be [i]visible[/i] from the origin $O$ if the line segment $OX$ does not contain any other lattice points. Show that for any positive integer $n$, there is square $ABCD$ of area $n^{2}$ such that none of the lattice points inside the square is visible from the origin.

A real number is written on each square of a $2024 \times 2024$ chessboard. It is given that the sum of all real numbers on the board is $2024$. Then, the board is covered by $1 \times 2$ or $2\times 1$ dominos such that there isn't any square that is covered by two different dominoes. For each domino, Aslı deletes $2$ numbers covered by it and writes $0$ on one of the squares and the sum of the two numbers on the other square. Find the maximum number $k$ such that after Aslı finishes her moves, there exists a column or row where the sum of all the numbers on it is at least $k$ regardless of how dominos were replaced and the real numbers were written initially.

Find the number of sequences of 10 letters where all the letters are either $A$ or $B$, the first letter is $A$, the last letter is $B$, and the sequence contains no three consecutive letters reading $ABA$. For example, count $AAABBABBAB$ and $ABBBBBBBAB$ but not $AABBAABABB$ or $AAAABBBBBA$.

An equilateral triangle with side $20$ is divided by there series of parallel lines into $400$ equilateral triangles with side $1$. What maximum number of these small triangles can be crossed (internally) by one line? Tuymaada 2017 Q7 Juniors