Octavio writes an integer $n \geq 1$ on a blackboard and then he starts a process in which, at each step he erases the integer $k$ written on the blackboard and replaces it with one of the following numbers: $$3k-1, \quad 2k+1, \quad \frac{k}{2}.$$ provided that the result is an integer. Show that for any integer $n \geq 1$, Octavio can write on the blackboard the number $3^{2023}$ after a finite number of steps.

A row of $1000$ numbers is written on the blackboard. We write a new row, below the first according to the rule: We write under every number $a$ the natural number, indicating how many times the number $a$ is encountered in the first line. Then we write down the third line: under every number $b$ -- the natural number, indicating how many times the number $b$ is encountered in the second line, and so on. a) Prove that there is a line that coincides with the preceding one. b) Prove that the eleventh line coincides with the twelfth. c) Give an example of the initial line such, that the tenth row differs from the eleventh.

Positive real numbers $a_1, a_2, \ldots, a_{2024}$ are written on the blackboard. A move consists of choosing two numbers $x$ and $y$ on the blackboard, erasing them and writing the number $\frac{x^2+6xy+y^2}{x+y}$ on the blackboard. After $2023$ moves, only one number $c$ will remain on the blackboard. Prove that \[ c<2024 (a_1+a_2+\ldots+a_{2024}).\]

On blackboard is written $3$ digit number so all three digits are distinct than zero. Out of it, we made three $2$ digit numbers by crossing out first digit of original number, crossing out second digit of original number and crossing out third digit of original number. Sum of those three numbers is $293$. Which number is written on blackboard?

Initially, a positive integer $N$ is written on a blackboard. We repeatedly replace the number according to the following rules: 1) replace the number by a positive multiple of itself 2) replace the number by a number with the same digits in a different order. (The new number is allowed to have leading digits, which are then deleted.) [i]A possible sequence of moves is given by $5 \to 20 \to 140 \to 041=41$.[/i] Determine for which values of $N$ it is possible to obtain $1$ after a finite number of such moves.

There are $33$ children in a given class. Each child writes a number on the blackboard, which indicates how many other children possess the same forename as oneself. Afterwards, each child does the same thing with their surname. After they've finished, each of the numbers $0,1,2,\dots,10$ appear at least once on the blackboard. Prove that there are at least two children in this class that have the same forename and surname.

The numbers $1,2,3,\dots,2017$ are on the blackboard. Amelie and Boris take turns removing one of those until only two numbers remain on the board. Amelie starts. If the sum of the last two numbers is divisible by $8$, then Amelie wins. Else Boris wins. Who can force a victory?

The numbers $1- \sqrt{2}$, $\sqrt{2}$ and $1+\sqrt{2}$ are written on a blackboard. Every minute, if $x, y, z$ are the numbers written, then they are erased and the numbers, $x^2 + xy + y^2$, $y^2 + yz + z^2$ and $z^2 + zx + x^2$ are written. Determine whether it is possible for all written numbers to be rational numbers after a finite number of minutes.

The numbers $1, 2, 3, \dots, 1024$ are written on a blackboard. They are divided into pairs. Then each pair is wiped off the board and non-negative difference of its numbers is written on the board instead. $512$ numbers obtained in this way are divided into pairs and so on. One number remains on the blackboard after ten such operations. Determine all its possible values. [i]Proposed by A. Golovanov[/i]

Humberto and Luciano use the break between classes to have fun with the following game: Humberto writes a list of distinct positive integers on a green sheet of paper and hands it to Luciano. Luciano then writes on a board all the possible sums, without repetitions, of one or more different numbers written on the green sheet. For example, if Humberto writes $1$, $3$ and $4$ on the green sheet, Luciano will write $1$, $3$, $4$, $5$, $7$ and $8$ on the board. (a) Let $n$ be a positive integer. Determine all positive integers $k$ such that Humberto can write a list of $n$ numbers on the green sheet in order to guarantee that Luciano will write exactly $k$ numbers on the board. (b) Luciano now decides to write a list of $m$ distinct positive integers on a yellow sheet of paper. Determine the smallest positive integer $m$ such that it is possible for Luciano to write this list so that, for any list that Humberto writes on the green sheet, with a maximum of $2023$ numbers, not all the numbers on the yellow sheet will be written on the board.

The natural numbers $y>x$ are written on the board. Vassya decides to write the reminder of one number on the board to some other non-zero number in each step. Prove that Vassya can find a natural number $k$ such that if $y>k$ then the number distinct numbers on the board after arbitrary number of steps does not exceed $\frac{y}{1000000}.$

There are $n \ge 2$ numbers on the blackboard: $1, 2,..., n$. It is permitted to erase two of those numbers $x,y$ and write $2x - y$ instead. Find all values of $n$ such that it is possible to leave number $0$ on the blackboard after $n - 1$ such procedures.

Three numbers were written with a chalk on the blackboard. The following operation was repeated several times: One of the numbers was cleared and the sum of two other numbers, decreased by $1$, was written instead of it. The final set of numbers is $\{17, 1967, 1983\}$.Is it possible to admit that the initial numbers were a) $\{2, 2, 2\}$? b) $\{3, 3, 3\}$?

If the polynomials $f(x)$ and $g(x)$ are written on a blackboard then we can also write down the polynomials $f(x)\pm g(x), f(x)g(x), f(g(x))$ and $cf(x)$, where $c$ is an arbitrary real constant. The polynomials $x^3 - 3x^2 + 5$ and $x^2 - 4x$ are written on the blackboard. Can we write a nonzero polynomial of the form $x^n - 1$ after a finite number of steps? Justify your answer.