Let $r>1$ be a rational number. Alice plays a solitaire game on a number line. Initially there is a red bead at $0$ and a blue bead at $1$. In a move, Alice chooses one of the beads and an integer $k \in \mathbb{Z}$. If the chosen bead is at $x$, and the other bead is at $y$, then the bead at $x$ is moved to the point $x'$ satisfying $x'-y=r^k(x-y)$. Find all $r$ for which Alice can move the red bead to $1$ in at most $2021$ moves.

On March $6$, $2002$, the celebrations of the $500$th anniversary of the birth of by mathematician Pedro Nunes. That morning, only ten people entered the Viva bookstore for science. Each of these people bought exactly $3$ different books. Furthermore, any two people bought at least one copy of the same book. The Adventures of Mathematics by Pedro Nunes was one of the books that achieved the highest number of sales in this morning. What is the smallest value this number could have taken?

At a party every girl danced with at least one boy, but not with all of them. Similarly, every boy danced with at least one girl, but not with all of them. Show that there were two girls $G$ and $G'$ and two boys $B$ and $B'$, such that each of $B$ and $G$ danced, $B'$ and $G'$ danced, but $B$ and $G'$ did not dance, and $B'$ and $G$ did not dance.

There are $100$ stones in a pile. A partition of the heap in $k $ piles is called [i]special [/i] if it meets that the number of stones in each pile is different and also for any partition of any of the piles into two new piles it turns out that between the $k + 1$ piles there are two that have the same number of stones (each pile contains at least one stone). a) Find the maximum number $k$, such that there is a special partition of the $100$ stones into $k $ piles. b) Find the minimum number $k $, such that there is a special partition of the $100$ stones in $k $ piles.

We are given an infinite row of cells extending infinitely in both directions. Some cells contain one or more stones. The total number of stones is finite. At each move, the player performs one of the following three operations: [b]1. [/b]Take three stones from some cell, and add one stone to the cells located one cell to the left and one cell to the right, each skipping one cell in between. [b]2. [/b]Take two stones from some cell, and add one stone to the cell one cell to the left, skipping one cell and one stone to the adjacent cell to the right. [b]3.[/b] Take one stone from each of two adjacent cells, and add one stone to the cell to the right of these two cells. The process ends when no moves are possible. Prove that the process always terminates and the final distribution of stones does not depend on the choices of moves made by the player. [img]https://i.imgur.com/IjcIDOa.png[/img] [i]Proposed by Luka Tsulaia, Georgia[/i]

Let $n$ be a positive integer. A pair of $n$-tuples $(a_1,\cdots{}, a_n)$ and $(b_1,\cdots{}, b_n)$ with integer entries is called an [i]exquisite pair[/i] if $$|a_1b_1+\cdots{}+a_nb_n|\le 1.$$ Determine the maximum number of distinct $n$-tuples with integer entries such that any two of them form an exquisite pair. [i]Pakawut Jiradilok and Warut Suksompong, Thailand[/i]

For each $k$ , find the least $n$ in terms of $k$ st the following holds: There exists $n$ real numbers $a_1 , a_2 ,\cdot \cdot \cdot , a_n$ st for each $i$ : $$0 < a_{i+1} - a_{i} < a_i - a_{i-1}$$ And , there exists $k$ pairs $(i,j)$ st $a_i - a_j = 1$.

Given a positive integer $ n$, find the number of $ n$-digit natural numbers consisting of digits 1, 2, 3 in which any two adjacent digits are either distinct or both equal to 3.

Given several points, not all lying on one straight line. Some number is assigned to every point. It is known, that if a straight line contains two or more points, than the sum of the assigned to those points equals zero. Prove that all the numbers equal to zero.

Let $n,k$ be integers such that $n\geq k\geq3$. Consider $n+1$ points in a plane (there is no three collinear points) and $k$ different colors, then, we color all the segments that connect every two points. We say that an angle is good if its vertex is one of the initial set, and its two sides aren't the same color. Show that there exist a coloration such that the \\ total number of good angles is greater than $n \binom{k}{2} \lfloor(\frac{n}{k})\rfloor^2$

How many ways are there to paint an $m \times n$ board, so that each square is painted blue, white, brown or gold, and in each $2 \times 2$ square there is one square of each color?

There are $n$ rooms in a sauna, each has unlimited capacity. No room may be attended by a female and a male simultaneously. Moreover, males want to share a room only with males that they don't know and females want to share a room only with females that they know. Find the biggest number $k$ such that any $k$ couples can visit the sauna at the same time, given that two males know each other if and only if their wives know each other.

Let $n$ be a positive integer. There are given $n$ lines such that no two are parallel and no three meet at a single point. a) Prove that there exists a line such that the number of intersection points of these $n$ lines on both of its sides is at least $$\left \lfloor \frac{(n-1)(n-2)}{10} \right \rfloor.$$ Notice that the points on the line are not counted. b) Find all $n$ for which there exists a configurations where the equality is achieved.

A deck consists of 13 types of cards: \( A > K > Q > J > 10 > 9 > \dots > 3 > 2 \), each card appearing 4 times. In total, there are 52 cards. Marius and Alexandru each receive half of the standard deck of cards, placing them face down. On each turn, the players simultaneously draw the top card from their hands, and the player with the most valuable card takes both cards and places them under all of his other cards, with Marius deciding the order in which the two cards are placed. In case of a tie, each player places their own card under the rest of their cards. The game ends when one of the players runs out of cards. Is it possible that, although Alexandru initially has all four \( A \) cards, the game lasts forever?

In a $999 \times 999$ square table some cells are white and the remaining ones are red. Let $T$ be the number of triples $(C_1,C_2,C_3)$ of cells, the first two in the same row and the last two in the same column, with $C_1,C_3$ white and $C_2$ red. Find the maximum value $T$ can attain. [i]Proposed by Merlijn Staps, The Netherlands[/i]

Let \(n\) be a positive integer. On a \(2 \times 3 n\) board, we mark some squares, so that any square (marked or not) is adjacent to at most two other distinct marked squares (two squares are adjacent when they are distinct and have at least one vertex in common, i.e. they are horizontal, vertical or diagonal neighbors; a square is not adjacent to itself). (a) What is the greatest possible number of marked square? (b) For this maximum number, in how many ways can we mark the squares? configurations that can be achieved through rotation or reflection are considered distinct.

A nonempty set $S$ is called [i]Bally[/i] if for every $m\in S$, there are fewer than $\frac{1}{2}m$ elements of $S$ which are less than $m$. Determine the number of Bally subsets of $\{1, 2, . . . , 2020\}$.

Let $S = \mathbb Z \times \mathbb Z$. A subset $P$ of $S$ is called [i]nice[/i] if [list] [*] $(a, b) \in P \implies (b, a) \in P$ [*] $(a, b)$, $(c, d)\in P \implies (a + c, b - d) \in P$ [/list] Find all $(p, q) \in S$ so that if $(p, q) \in P$ for some [i]nice[/i] set $P$ then $P = S$.

With inspiration drawn from the rectilinear network of streets in [i]New York[/i] , the [i]Manhattan distance[/i] between two points $(a,b)$ and $(c,d)$ in the plane is defined to be \[|a-c|+|b-d|\] Suppose only two distinct [i]Manhattan distance[/i] occur between all pairs of distinct points of some point set. What is the maximal number of points in such a set?

Find the maximum number of rectangles with sides equal to 1 and 2 and parallel to the coordinate axes such that each two have an area equal to 1 in common.

Alice places down $n$ bishops on a $2015\times 2015$ chessboard such that no two bishops are attacking each other. (Bishops attack each other if they are on a diagonal.) [list=a] [*]Find, with proof, the maximum possible value of $n$. [*](A1 only) For this maximal $n$, find, with proof, the number of ways she could place her bishops on the chessboard. [/list]

There is a $8\times 8$ table, drawn in a plane and painted in a chess board fashion. Peter mentally chooses a square and an interior point in it. Basil can draws any polygon (without self-intersections) in the plane and ask Peter whether the chosen point is inside or outside this polygon. What is the minimal number of questions suffcient to determine whether the chosen point is black or white?

Alice and Bob play a game on the infinite side of a checkered strip, in which the cells are numbered with consecutive integers from left to right (..., $-2$, $-1$, $0$, $1$, $2$, ...). Alice in her turn puts one cross in any free cell, and Bob in his turn puts zeros in any 2020 free cells. Alice will win if he manages to get such 4 cells marked with crosses, the corresponding cell numbers will form an arithmetic progression. Bob's goal in this game is to prevent Alice from winning. They take turns and Alice moves first. Will Alice be able to win no matter how Bob plays?

In each square of a $10\times 10$ board, there is an arrow pointing upwards, downwards, left, or right. Prove that it is possible to remove $50$ arrows from the board, such that no two remaining arrows point at each other.

Find all positive integers $n$ such that we can put $n$ equal squares on the plane that their sides are horizontal and vertical and the shape after putting the squares has at least $3$ axises.