Peter and Basil play the following game on a horizontal table 1×20191\times{2019}1×2019 . Initially Peter chooses nnn positive integers and writes them on a board. After that Basil puts a coin in one of the cells. Then at each move, Peter announce…
Given is an n×nn\times nn×n board, with an integer written in each grid. For each move, I can choose any grid, and add 111 to all 2n−12n-12n−1 numbers in its row and column. Find the largest N(n)N(n)N(n) , such that for any initial choice of integer…
Seth and Cain play a game. They take turns, and on each turn a player chooses a pair of integers from 1 to 50. One integer in the pair must be twice the other, and the players cannot choose any integers used previously. The first player who…
A 'long knight' moves on a square grid. A single move consists of moving three squares in one direction (horizontally or vertically) and then one square at right angles to the first direction. What is the smallest number of moves a long kni…
A field is a 41×4141 \times 4141×41 grid, and a tank is hidden in one of the cells. A fighter plane fires at one cell at a time. If the shot hits, the tank moves to an adjacent cell (sharing a side); if the shot misses, the tank remains in place.…
The wizards Albus and Brian are playing a game on a square of side length 2n+12n+12n+1 meters surrounded by lava. In the center of the square, there sits a toad. On each turn, a wizard chooses a direction parallel to a side of the square and en…
On a clock face with 12 hours (marked with numbers 1, 2, ..., 11, 12), which is fixed to the blackboard at its center and can be rotated by multiples of 30∘30^{\circ}30∘, initially a "0" is written next to each number on the blackboard. Each t…
The teacher wrote the quadratic polynomial x2+10x+20x^{2} + 10x + 20x2+10x+20 on the board. Each student, in turn, either increased or decreased by one either the coefficient of xxx or the constant term, but not both at the same time. As a result, th…
In each cell of a 24×2424 \times 2424×24 table, there is a number equal to either +1 or -1. In one move, you can change the sign of one of these numbers to its opposite, and simultaneously change the signs of all numbers that are in the same row or…
A piece is placed at the point (0,0)(0,0)(0,0), and at each step, we are allowed to replace a piece at position (i,j)(i, j)(i,j) with two pieces at positions (i+1,j)(i+1, j)(i+1,j) and (i,j+1)(i, j+1)(i,j+1), provided that there is not already a piece there. Show that the…
<span style="color:darkblue">Weightlifter Ruslan has just finished the exercise with a weight, which has n nn small weights on one side and n nn on the another. At each stage he takes some weights from one of the sides, such that at any…
A paper sheet is torn into 3 parts. Then, one of these parts is torn again into 3 parts, and so on. Can there be, at some point, a total of 503 parts? 2020 parts?
In the cells of a 7x7 square, pluses and minuses are placed. It is allowed to change all the signs to the opposite in any row or any column. Prove that it is possible to achieve a configuration where there are more pluses than minuses in ea…
Players AAA, BBB, CCC, and DDD start a game with 202020, 191919, 181818, and 171717 tokens respectively. The game's rule is modified such that in each round, the player with the most tokens gives one token to each of the other three players and pla…
A natural number is called good if all its digits are non-zero. A good number is called special if it has at least kkk digits and the digits are in strict ascending order from left to right. Consider a good number. In one move, you are…
There are 100 distinct points chosen on a circle. Peter and Catherine are playing a game. On the first turn, Peter selects three triangles with vertices at the chosen points, and thereafter each player in turn selects one such triangle. At…
A table has 10 rows and 10 columns. We write the first 100 natural numbers into the table in any order. In each row, we rearrange the numbers in ascending order, and then do the same for each column. Can this last step ruin the ordered rows…
Initially, an urn contains 100 black and 120 white marbles. Repeatedly 3 marbles are removed (at random) from the urn and replaced with some marbles from a pile outside the urn as follows: - 3 black marbles are replaced with 2 black marble…
Two players are playing a game. The first player writes down digits from left to right, randomly alternating between 0 and 1, until there are a total of 1999 digits. Each time after the first player writes a new digit, the second player swa…
Currently, there are 1990 piles of stones, with each pile consisting of 1,2,⋯ ,19901, 2, \cdots, 19901,2,⋯,1990 stones. In each round, you are allowed to pick any number of piles and discard the same number of stones from each of the selected piles. What is t…