Found problems: 1385
Players $A$ and $B$ play a game on a blackboard that initially contains 2020 copies of the number 1 . In every round, player $A$ erases two numbers $x$ and $y$ from the blackboard, and then player $B$ writes one of the numbers $x+y$ and $|x-y|$ on the blackboard. The game terminates as soon as, at the end of some round, one of the following holds:
$(1)$ one of the numbers on the blackboard is larger than the sum of all other numbers;
$(2)$ there are only zeros on the blackboard.
Player $B$ has to pay to player $A$ an amount in reais equivalent to the quantity of numbers left on the blackboard after the game ends. Show that player $A$ can earn at least 8 reais regardless of the moves taken by $B$
Ps.: Easier version of [url = https://artofproblemsolving.com/community/c6h2625868p22698110]ISL 2020 C8[/url]
Consider a board consisting of $n\times n$ unit squares where $n \ge 2$. Two cells are called neighbors if they share a horizontal or vertical border. In the beginning, all cells together contain $k$ tokens. Each cell may contain one or several tokens or none. In each turn, choose one of the cells that contains at least one token for each of its neighbors and move one of those to each of its neighbors. The game ends if no such cell exists.
(a) Find the minimal $k$ such that the game does not end for any starting configuration and choice of cells during the game.
(b) Find the maximal $k$ such that the game ends for any starting configuration and choice of cells during the game.
Proposed by Theresia Eisenkölbl
[b]p1.[/b] Prove that the equation $x^6 - 143x^5 - 917x^4 + 51x^3 + 77x^2 + 291x + 1575 = 0$ has no integer solutions.
[b]p2.[/b] There are $81$ wheels in a storage marked by their two types, say first and second type. Wheels of the same type weigh equally. Any wheel of the second type is much lighter than a wheel of the first type. It is known that exactly one wheel is marked incorrectly. Show that it can be detected with certainty after four measurements on a balance scale.
[b]p3.[/b] Rob and Ann multiplied the numbers from $1$ to $100$ and calculated the sum of digits of this product. For this sum, Rob calculated the sum of its digits as well. Then Ann kept repeating this operation until he got a one-digit number. What was this number?
[b]p4.[/b] Rui and Jui take turns placing bishops on the squares of the $ 8\times 8$ chessboard in such a way that bishops cannot attack one another. (In this game, the color of the rooks is irrelevant.) The player who cannot place a rook loses the game. Rui takes the first turn. Who has a winning strategy, and what is it?
[b]p5.[/b] The following figure can be cut along sides of small squares into several (more than one) identical shapes. What is the smallest number of such identical shapes you can get?
[img]https://cdn.artofproblemsolving.com/attachments/8/e/9cd09a04209774dab34bc7f989b79573453f35.png[/img]
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
In a game of rock-paper-scissors with $n$ people, the following rules are used to determine a champion:
(a) In a round, each person who has not been eliminated randomly chooses one of rock, paper, or scissors to play.
(b) If at least one person plays rock, at least one person plays paper, and at least one person plays scissors, then the round is declared a tie and no one is eliminated. If everyone makes the same move, then the round is also declared a tie.
(c) If exactly two moves are represented, then everyone who made the losing move is eliminated from playing in all further rounds (for example, in a game with $8$ people, if $5$ people play rock and $3$ people play scissors, then the $3$ who played scissors are eliminated).
(d) The rounds continue until only one person has not been eliminated. That person is declared the champion and the game ends.
If a game begins with $4$ people, what is the expected value of the number of rounds required for a champion to be determined?
[i]In the game of rock-paper-scissors, two players each choose one of rock, paper, or scissors to play. Rock beats scissors, scissors beats paper, and paper beats rock. If the players play the same thing, the match is considered a draw.[/i]
The number $1234567890$ is written on the blackboard. Two players $A$ and $B$ play the following game taking alternate moves. In one move, a player erases the number which is written on the blackboard, say, $m$, subtracts from $m$ any positive integer not exceeding the sum of the digits of $m$ and writes the obtained result instead of $m$. The first player who reduces the number written on the blackboard to $0$ wins. Determine which of the players has the winning strategy if the player $A$ makes the first move.
Juty and Azgor plays the following game on a \((2n+1) \times (2n+1)\) board with Juty moving first. Initially all cells are colored white. On Juty's turn, she colors a white cell green and on Azgor's turn, he colors a white cell red. The game ends after they color all the cells of the board. Juty wins if all the green cells are connected, i.e. given any two green cells, there is at least one chain of neighbouring green cells connecting them (we call two cells [i]neighboring[/i] if they share at least one corner), otherwise Azgor wins. Determine which player has a winning strategy.
[i]Proposed by Atonu Roy Chowdhury[/i]
For positive integers $t,a$, and $b$, Lucy and Windy play the $(t,a,b)$- [i]game [/i] defined by the following rules. Initially, the number $t$ is written on a blackboard. On her turn, a player erases the number on the board and writes either the number $t - a$ or $t - b$ on the board. Lucy goes first and then the players alternate. The player who first reaches a negative losses the game. Prove that there exist infinitely many values of $t$ in which Lucy has a winning strategy for all pairs $(a, b)$ with $a + b = 2005$.
Pasha and Vova play the following game, making moves in turn; Pasha moves first. Initially, they have a large piece of plasticine. By a move, Pasha cuts one of the existing pieces into three(of arbitrary sizes), and Vova merges two existing pieces into one. Pasha wins if at some point there appear to be $100$ pieces of equal weights. Can Vova prevent Pasha's win?
Two players $A$ and $B$ take turns playing the following game: There is a pile of $2003$ stones. In his first turn, $A$ selects a divisor of $2003$ and removes this number of stones from the pile. $B$ then chooses a divisor of the number of remaining stones, and removes that number of stones from the new pile, and so on. The player who has to remove the last stone loses. Show that one of the two players has a winning strategy and describe the strategy.
A set $A$ of squares is given on a chessboard which is infinite in all directions. On each square of this chessboard which does not belong to $A$ there is a king. On a command all kings may be moved in such a way that each king either remains on its square or is moved to an adjacent square, which may have been occupied by another king before the command. Each square may be occupied by at most one king. Does there exist such a number $k$ and such a way of moving the kings that after $k$ moves the kings will occupy all squares of the chessboard? Consider the following cases:
(a) $A$ is the set of all squares, both of whose coordinates are multiples of $100$. (There is a horizontal line numbered by the integers from $-\infty$ to $+\infty$, and a similar vertical line. Each square of the chessboard may be denoted by two numbers, its coordinates with respect to these axes.)
(b) $A$ is the set of all squares which are covered by $100$ fixed arbitrary queens (i.e. each square covered by at least one queen).
Remark:
If $A$ consists of just one square, then $k = 1$ and the required way is the following:
all kings to the left of the square of $A$ make one move to the right.
There are 2008 bags numbered from 1 to 2008, with 2008 frogs in each one of them. Two people play in turns. A play consists in selecting a bag and taking out of it any number of frongs (at least one), leaving $ x$ frogs in it ($ x\geq 0$). After each play, from each bag with a number higher than the selected one and having more than $ x$ frogs, some frogs scape until there are $ x$ frogs in the bag. The player that takes out the last frog from bag number 1 looses. Find and explain a winning strategy.
Ana plays a game on a $100\times 100$ chessboard. Initially, there is a white pawn on each square of the bottom row and a black pawn on each square of the top row, and no other pawns anywhere else.\\
Each white pawn moves toward the top row and each black pawn moves toward the bottom row in one of the following ways:
[list]
[*] it moves to the square directly in front of it if there is no other pawn on it;
[*] it [b]captures[/b] a pawn on one of the diagonally adjacent squares in the row immediately in front of it if there is a pawn of the opposite color on it.
[/list]
(We say a pawn $P$ [b]captures[/b] a pawn $Q$ of the opposite color if we remove $Q$ from the board and move $P$ to the square that $Q$ was previously on.)\\
\\
Ana can move any pawn (not necessarily alternating between black and white) according to those rules. What is the smallest number of pawns that can remain on the board after no more moves can be made?
[i]Proposed by José Alejandro Reyes González, Mexico[/i]
Alice and Bob are playing "factoring game." On the paper, $270000(=2^43^35^4)$ is written and each person picks one number from the paper(call it $N$) and erase $N$ and writes integer $X,Y$ such that $N=XY$ and $\text{gcd}(X,Y)\ne1.$ Alice goes first and the person who can no longer make this factoring loses. If two people use optimal strategy, prove that Alice always win.
Flavian and Pavel play a game. Starting with Flavian, they take turns eliminating exactly one edge from a complete graph with $2024$ vertices. The first player to make a move that leaves no cycles loses. Determine who has a winning strategy.
[i]Proposed by Pavel Ciurea[/i]
Alice and Bob play the following game: They start with non-empty piles of coins. Taking turns, with Alice playing first, each player choose a pile with an even number of coins and moves half of the coins of this pile to the other pile. The game ends if a player cannot move, in which case the other player wins.
Determine all pairs $(a,b)$ of positive integers such that if initially the two piles have $a$ and $b$ coins respectively, then Bob has a winning strategy.
Proposed by Dimitris Christophides, Cyprus
Six teams participate in a hockey tournament. Each team plays once against every other team. In each game, a team is awarded $3$ points for a win, $1$ point for a draw, and none for a loss. After the tournament the teams are ranked by total points. No two teams have the same total points. Each team (except the bottom team) has $2$ points more than the team ranking one place lower. Prove that the team that finished fourth has won two games and lost three games.
There is a black token in the lower-left corner of a board $m \times n$ ($m, n \ge 3$), and there are white tokens in the lower-right and upper-left corners of this board. Petryk and Vasyl are playing a game, with Petryk playing with a black token and Vasyl with white tokens. Petryk moves first.
In his move, a player can perform the following operation at most two times: choose any his token and move it to any adjacent by side cell, with one restriction: you can't move a token to a cell where at some point was one of the opponents' tokens.
Vasyl wins if at some point of the game white tokens are in the same cell. For which values of $m, n$ can Petryk prevent him from winning?
[i](Proposed by Arsenii Nikolaiev)[/i]
Let $n$ be an even integer greater than $2$. On the vertices of a regular polygon with n sides we can place red or blue chips. Two players, $A$ and $B$, play alternating turns of the next mode: each player, on their turn, chooses two vertices that have no tiles and places on one of them a red chip and in the other a blue chip. The goal of $A$ is to get three vertices consecutive with tiles of the same color. $B$'s goal is to prevent this from happening. To the beginning of the game there are no tiles in any of the vertices. Show that regardless of who starts to play, Player $B$ can always achieve his goal.
There are given points with integer coordinate $(m,n)$ such that $1\leq m,n\leq 4$. Two players, Ana and Ben, are playing a game: First Ana color one of the coordinates with red one, then she pass the turn to Ben who color one of the remaining coordinates with yellow one, then this process they repeate again one after other. The game win the first player who can create a rectangle with same color of vertices and the length of sides are positive integer numbers, otherwise the game is a tie. Does there exist a strategy for any of the player to win the game?
Let $n$ be a positive integer and $M = \{1, 2, 3, 4, 5, 6\}$. Two persons $A$ and $B$ play in the following Way: $A$ writes down a digit from $M$, $B$ appends a digit from $M$, and so it becomes alternately one digit from $M$ is appended until the $2n$-digit decimal representation of a number has been created. If this number is divisible by $9$, $B$ wins, otherwise $A$ wins.
For which $n$ can $A$ and for which $n$ can $B$ force the win?
Two players by turns draw diagonals in a regular $(2n+1)$-gon ($n>1$). It is forbidden to draw a diagonal, which was already drawn, or intersects an odd number of already drawn diagonals. The player, who has no legal move, loses. Who has a winning strategy?
[i]K. Sukhov[/i]
The game of Nelipe is played on a $16\times16$-grid as follows: The two players write in turn numbers $1, 2,..., 16$ in diff erent squares. The numbers on each row, column, and in every one of the 16 smaller squares have to be di fferent. The loser is the one who is not able to write a number. Which one of the players wins, if both play with an optimal strategy?
Let $n> 1$ be an odd integer. On a square surface have been placed $n^2 - 1$ white slabs and a black slab on the center. Two workers $A$ and $B$ take turns removing them, betting that whoever removes black will lose. First
$A$ picks a slab; if it has row number $i \ge (n + 1) / 2$, then it will remove all tiles from rows with number
greater than or equal to$ i$, while if $i <(n + 1) / 2$, then it will remove all tiles from the rows with lesser number
or equal to $i$. Proceed in a similar way with columns. Then $B$ chooses one of the remaining tiles and repeats the
process. Determine who has a winning strategy and describe it.
Note: Row and column numbering is ascending from top to bottom and from left to right.
Ana and Benito play a game which consists of $2020$ turns. Initially, there are $2020$ cards on the table, numbered from $1$ to $2020$, and Ana possesses an extra card with number $0$. In the $k$-th turn, the player that doesn't possess card $k-1$ chooses whether to take the card with number $k$ or to give it to the other player. The number in each card indicates its value in points. At the end of the game whoever has most points wins. Determine whether one player has a winning strategy or whether both players can force a tie, and describe the strategy.
Given 2015 balls. Astri and Budi will play a game. At first, Astri will choose two different numbers $a$ and $b$ from the set $S = \{ 1, 2, 3, \dots, 30 \}$. Budi will then choose another 2 different numbers $c$ and $d$ from the remaining 28 numbers in set $S$.
By taking turns, starting from Astri, they take balls with the following rules:
(1) Astri could only take $a$ or $b$ balls.
(2) Budi could only take $c$ or $d$ balls.
until someone couldn't take any balls satisfying the condition given (and that person will lose).
Prove that Budi could choose $c,d$ such that he has a strategy to ensure his victory on this game.