Found problems: 1385
Alice and Bob are playing a game. First, Alice chooses a partition $\mathcal{C}$ of the positive integers
into a (not necessarily finite) set of sets, such that each positive integer is in exactly one of the
sets in $\mathcal{C}$. Then Bob does the following operation a finite number of times.
Choose a set $S \in \mathcal{C}$ not previously chosen, and let $D$ be the set of all positive integers dividing at least one element in $S$. Then add the set $D \setminus S$ (possibly the empty set) to $\mathcal{C}$.
Bob wins if there are two equal sets in $\mathcal{C}$ after he has done all his moves, otherwise, Alice wins.
Determine which player has a winning strategy.
Let $ p \geq 2$ be a prime number. Eduardo and Fernando play the following game making moves alternately: in each move, the current player chooses an index $i$ in the set $\{0,1,2,\ldots, p-1 \}$ that was not chosen before by either of the two players and then chooses an element $a_i$ from the set $\{0,1,2,3,4,5,6,7,8,9\}$. Eduardo has the first move. The game ends after all the indices have been chosen .Then the following number is computed:
$$M=a_0+a_110+a_210^2+\cdots+a_{p-1}10^{p-1}= \sum_{i=0}^{p-1}a_i.10^i$$.
The goal of Eduardo is to make $M$ divisible by $p$, and the goal of Fernando is to prevent this.
Prove that Eduardo has a winning strategy.
[i]Proposed by Amine Natik, Morocco[/i]
Veronica, Ana and Gabriela are forming a round and have fun with the following game. One of them chooses a number and says out loud, the one to its left divides it by its largest prime divisor and says the result out loud and so on. The one who says the number out loud $1$ wins , at which point the game ends. Ana chose a number greater than $50$ and less than $100$ and won. Veronica chose the number following the one chosen by Ana and also won. Determine all the numbers that could have been chosen by Ana.
Initially, on the board, all integers from $1$ to $400$ are written. Two players play a game alternating their moves. In one move it is allowed to erase from the board any 3 integers, which form a triangle. The player, who can not perform a move loses. Who has a winning strategy?
A game in a casino uses the diagram shown. At the start a ball appears at $S$. Each time the player presses a button, the ball moves to one of the adjacent letters with equal probability. The game ends when one of the following two things happens:
(i) The ball returns to $S$, the player loses.
(ii) The ball reaches $G$, the player wins.
Find the probability that the player wins and the expected duration of a game.
Initially, the number $10$ is written on the board. In each subsequent moves, you can either
(i) erase the number $1$ and replace it with a $10$, or
(ii) erase the number $10$ and replace it with a $1$ and a $25$ or
(iii) erase a $25$ and replace it with two $10$.
After sometime, you notice that there are exactly one hundred copies of $1$ on the board. What is the least possible sum of all the numbers on the board at that moment?
On Halloween 31 children walked into the principal's office asking for candy. They can be classified into three types: Some always lie; some always tell the truth; and some alternately lie and tell the truth. The alternaters arbitrarily choose their first response, either a lie or the truth, but each subsequent statement has the opposite truth value from its predecessor. The principal asked everyone the same three questions in this order.
"Are you a truth-teller?" The principal gave a piece of candy to each of the 22 children who answered yes.
"Are you an alternater?" The principal gave a piece of candy to each of the 15 children who answered yes.
"Are you a liar?" The principal gave a piece of candy to each of the 9 children who answered yes.
How many pieces of candy in all did the principal give to the children who always tell the truth?
$\textbf{(A) }7\qquad\textbf{(B) }12\qquad\textbf{(C) }21\qquad\textbf{(D) }27\qquad\textbf{(E) }31$
Nicu plays the Next game on the computer. Initially the number $S$ in the computer has the value $S = 0$. At each step Nicu chooses a certain number $a$ ($0 <a <1$) and enters it in computer. The computer arbitrarily either adds this number $a$ to the number $S$ or it subtracts from $S$ and displays on the screen the new result for $S$. After that Nicu does Next step. It is known that among any $100$ consecutive operations the computer the at least once apply the assembly. Give an arbitrary number $M> 0$. Show that there is a strategy for Nicu that will always allow him after a finite number of steps to get a result $S> M$.
[hide=original wording]Nicu joacă la calculator următorul joc. Iniţial numărul S din calculator are valoarea S = 0. La fiecare pas Nicu alege un număr oarecare a (0 < a < 1) şi îl introduce în calculator. Calculatorul, în mod arbitrar, sau adună acest număr a la numărul S sau îl scade din S şi afişează pe ecran rezultatul nou pentru S. După aceasta Nicu face următorul pas. Se ştie că printre oricare 100 de operaţii consecutive calculatorul cel puţin o dată aplică adunarea. Fie dat un număr arbitrar M > 0. Să se arate că există o strategie pentru Nicu care oricând îi va permite lui după un număr finit de paşi să obţină un rezulat S > M.[/hide]
There are $N$ piles each consisting of a single nut. Two players in turns play the following game. At each move, a player combines two piles that contain coprime numbers of nuts into a new pile. A player who can not make a move, loses. For every $N > 2$ determine which of the players, the first or the second, has a winning strategy.
On Halloween 31 children walked into the principal's office asking for candy. They can be classified into three types: Some always lie; some always tell the truth; and some alternately lie and tell the truth. The alternaters arbitrarily choose their first response, either a lie or the truth, but each subsequent statement has the opposite truth value from its predecessor. The principal asked everyone the same three questions in this order.
"Are you a truth-teller?" The principal gave a piece of candy to each of the 22 children who answered yes.
"Are you an alternater?" The principal gave a piece of candy to each of the 15 children who answered yes.
"Are you a liar?" The principal gave a piece of candy to each of the 9 children who answered yes.
How many pieces of candy in all did the principal give to the children who always tell the truth?
$\textbf{(A) }7\qquad\textbf{(B) }12\qquad\textbf{(C) }21\qquad\textbf{(D) }27\qquad\textbf{(E) }31$
Antonio and Beltran have impeccable logical reasoning, they put on a hat with a integer between $0$ and $19$ (including both) so that each of them sees the number that has the other (but cannot see his own number), and they must try to guess the number that have on their hat.
They have a timer that a bell rings every minute and the moment it rings.
This is when they must say if they know the number on their hat.
A third person tells them: ''the sum of the numbers is $6$ or $11$ or $19$''. At that moment it begins to run time.
After a minute the bell rings and neither of them says anything. The second minute passes , the doorbell rings and neither of us says anything. Time continues to pass and when the bell rings for the tenth time Antonio says that he already knows what is his number.
Just determine the number each has in his hat.
The number 7 is written on a board. Alice and Bob in turn (Alice begins) write an additional digit in the number on the board: it is allowed to write the digit at the beginning (provided the digit is nonzero), between any two digits or at the end. If after someone’s turn the number on the board is a perfect square then this person wins. Is it possible for a player to guarantee the win?
[i]Alexandr Gribalko[/i]
Leo and Smilla find $2020$ gold nuggets with masses $1,2,\dots,2020$ gram, which they distribute to a red and a blue treasure chest according to the following rule:
First, Leo chooses one of the chests and tells its colour to Smilla. Then Smilla chooses one of the not yet distributed nuggets and puts it into this chest.
This is repeated until all the nuggets are distributed. Finally, Smilla chooses one of the chests and wins all the nuggets from this chest.
How many gram of gold can Smilla make sure to win?
An equilateral triangle is divided into $n^2$ congruent equilateral triangles. A spider stands at one of the vertices, a fly at another. Alternately each of them moves to a neighbouring vertex. Prove that the spider can always catch the fly.
For a set \(S\) of positive integers and a positive integer \(n\), consider the game of [i]\((n,S)\)-nim[/i], which is as follows. A pile starts with \(n\) watermelons. Two players, Deric and Erek, alternate turns eating watermelons from the pile, with Deric going first. On any turn, the number of watermelons eaten must be an element of \(S\). The last player to move wins. Let \(f(S)\) denote the set of positive integers \(n\) for which Deric has a winning strategy in \((n,S)\)-nim.
Let \(T\) be a set of positive integers. Must the sequence \[T, \; f(T), \; f(f(T)), \;\ldots\] be eventually constant?
[i]Proposed by Brandon Wang and Edward Wan[/i]
Two people play a game on a $9 \times 9$ board. They move alternately. On each move, the first player draws a cross in an empty cell, and the second player draws a nought in an empty cell. When all $81$ cells are filled, the number $K$ of rows and columns in which there are more crosses and the number $H$ of rows and columns in which there are more noughts are counted. The score for the first player is the difference $B = K- H$. Find a value of $B$ such that the first player can guarantee a score of at least $B$, while the second player can hold the first player's score to at most B, regardless how the opponent plays.
(A Kanel)
[b]p1.[/b] Is there an integer such that the product of all whose digits equals $99$ ?
[b]p2.[/b] An elevator in a $100$ store building has only two buttons: UP and DOWN. The UP button makes the elevator go $13$ floors up, and the DOWN button makes it go $8$ floors down. Is it possible to go from the $13$th floor to the $8$th floor?
[b]p3.[/b] Cut the triangle shown in the picture into three pieces and rearrange them into a rectangle. (Pieces can not overlap.)
[img]https://cdn.artofproblemsolving.com/attachments/9/f/359d3b987012de1f3318c3f06710daabe66f28.png[/img]
[b]p4.[/b] Two players Tom and Sid play the following game. There are two piles of rocks, $5$ rocks in the first pile and $6$ rocks in the second pile. Each of the players in his turn can take either any amount of rocks from one pile or the same amount of rocks from both piles. The winner is the player who takes the last rock. Who does win in this game if Tom starts the game?
[b]p5.[/b] In the next long multiplication example each letter encodes its own digit. Find these digits.
$\begin{tabular}{ccccc}
& & & a & b \\
* & & & c & d \\
\hline
& & c & e & f \\
+ & & a & b & \\
\hline
& c & f & d & f \\
\end{tabular}$
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Alice and Bob play the following game. To start, Alice arranges the numbers $1,2,\ldots,n$ in some order in a row and then Bob chooses one of the numbers and places a pebble on it. A player's [i]turn[/i] consists of picking up and placing the pebble on an adjacent number under the restriction that the pebble can be placed on the number $k$ at most $k$ times. The two players alternate taking turns beginning with Alice. The first player who cannot make a move loses. For each positive integer $n$, determine who has a winning strategy.
(Game) At the beginning of the game, the organisers place paper disks on the table, grouped into piles which may contain various numbers of disks. The two players take turns. On a player’s turn, their opponent selects two piles (one if there is only one pile left), and the player must remove some number of disks from one of the piles selected. This means that at least one disk has to be removed, and removing all disks in the pile is also permitted. The player removing the last disk from the table wins.
[i]Defeat the organisers in this game twice in a row! A starting position will be given and then you can decide whether you want to go first or second.[/i]
Let $n \ge 3$ be a fixed integer. A game is played by $n$ players sitting in a circle. Initially, each player draws three cards from a shuffled deck of $3n$ cards numbered $1, 2, \dots, 3n$. Then, on each turn, every player simultaneously passes the smallest-numbered card in their hand one place clockwise and the largest-numbered card in their hand one place counterclockwise, while keeping the middle card.
Let $T_r$ denote the configuration after $r$ turns (so $T_0$ is the initial configuration). Show that $T_r$ is eventually periodic with period $n$, and find the smallest integer $m$ for which, regardless of the initial configuration, $T_m=T_{m+n}$.
[i]Proposed by Carl Schildkraut and Colin Tang[/i]
Points $A_0,A_1,\ldots,A_{2k}$, in this order, divide a circumference into $2k+1$ equal arcs. Point $A_0$ is connected by chords to all the other points. These $2k$ chords divide the interior of the circle into $2k+1$ parts. These parts are alternately painted red and blue so that there are $k+1$ red and $k$ blue parts. Show that the blue area is larger than the red area.
Two players $A$ and $B$ play the following game:
$A$ chooses a point, with integer coordinates, on the plane and colors it green, then $B$ chooses $10$ points of integer coordinates, not yet colored, and colors them yellow. The game always continues with the same rules; $A$ and $B$ choose one and ten uncolored points and color them green and yellow, respectively.
a. The objective of $A$ is to achieve $111^2$ green points that are the intersections of $111$ horizontal lines and $111$ vertical lines (parallel to the coordinate axes). $B$'s goal is to stop him. Determine which of the two players has a strategy that ensures you achieve your goal.
b. The objective of $A$ is to achieve $4$ green points that are the vertices of a square with sides parallel to the coordinate axes. $B$'s goal is to stop him. Determine which of the two players has a strategy that will ensure that they achieve their goal.
All the cells of a $10\times10$ board are colored white initially. Two players are playing a game with alternating moves. A move consists of coloring any un-colored cell black. A player is considered to loose, if after his move no white domino is left. Which of the players has a winning strategy?
[I]Proposed by A. Khrabrov[/i]
Kostya and Sergey play a game on a white strip of length 2016 cells. Kostya (he plays first) in one move should paint black over two neighboring white cells. Sergey should paint either one white cell either three neighboring white cells. It is forbidden to make a move, after which a white cell is formed the doesn't having any white neighbors. Loses the one that can make no other move. However, if all cells are painted, then Kostya wins. Who will win if he plays the right game (has a winning strategy)?
$8$ CPLP football teams competed in a championship in which each team played one and only time with each of the other teams. In football, each win is worth $3$ points, each draw is worth $1$ point and the defeated team does not score. In that championship four teams were in first place with $15$ points and the others four came in second with $N$ points each. Knowing that there were $12$ draws throughout the championship, determine $N$.