Found problems: 1385
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\}$?
The checker is standing on the corner field of a $n\times n$ chess-board. Each of two players moves it in turn to the neighbour (i.e. that has the common side) field. It is forbidden to move to the field, the checker has already visited. That who cannot make a move losts.
a) Prove that for even $n$ the first can always win, and if $n$ is odd, than the second can always win.
b) Who wins if the checker stands initially on the neighbour to the corner field?
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]
The [i]liar's guessing game[/i] is a game played between two players $A$ and $B$. The rules of the game depend on two positive integers $k$ and $n$ which are known to both players.
At the start of the game $A$ chooses integers $x$ and $N$ with $1 \le x \le N.$ Player $A$ keeps $x$ secret, and truthfully tells $N$ to player $B$. Player $B$ now tries to obtain information about $x$ by asking player $A$ questions as follows: each question consists of $B$ specifying an arbitrary set $S$ of positive integers (possibly one specified in some previous question), and asking $A$ whether $x$ belongs to $S$. Player $B$ may ask as many questions as he wishes. After each question, player $A$ must immediately answer it with [i]yes[/i] or [i]no[/i], but is allowed to lie as many times as she wants; the only restriction is that, among any $k+1$ consecutive answers, at least one answer must be truthful.
After $B$ has asked as many questions as he wants, he must specify a set $X$ of at most $n$ positive integers. If $x$ belongs to $X$, then $B$ wins; otherwise, he loses. Prove that:
1. If $n \ge 2^k,$ then $B$ can guarantee a win.
2. For all sufficiently large $k$, there exists an integer $n \ge (1.99)^k$ such that $B$ cannot guarantee a win.
[i]Proposed by David Arthur, Canada[/i]
A game consists of a grid of $4\times 4$ and tiles of two colors (Yellow and White). A player chooses a type of token and gives it to the second player who places it where he wants, then the second player chooses a type of token and gives it to the first who places it where he wants, They continue in this way and the one who manages to form a line with three tiles of the same color wins (horizontal, vertical or diagonal and regardless of whether it is the tile you started with or not). Before starting the game, two yellow and two white pieces are already placed as shows the figure below.
[img]https://cdn.artofproblemsolving.com/attachments/b/5/ba11377252c278c4154a8c3257faf363430ef7.png[/img]
Yolanda and Xinia play a game. If Yolanda starts (choosing the token and giving it to Xinia for this to place) indicate if there is a winning strategy for either of the two players and, if any, describe the strategy.
The two cats Fitz and Will play the following game. On a blackboard is written the expression
\[
x^{100} + {\square} x^{99} + {\square} x^{98} + {\square} x^{97} + \dots + {\square } x^2 + {\square} x +1.
\]
Both cats take alternate turns replacing one $\square$ with a $0$ or $1$, with Fitz going first, until (after 99 turns) all the blanks have been filled. If the resulting polynomial obtained has a real root, then Will wins, otherwise Fitz wins. Determine, with proof, which player has a winning strategy.
[u]Round 9[/u]
[b]p25.[/b] Let $a$, $b$, and $c$ be positive numbers with $a +b +c = 4$. If $a,b,c \le 2$ and $$M =\frac{a^3 +5a}{4a^2 +2}+\frac{b^3 +5b}{4b^2 +2}+\frac{c^3 +5c}{4c^2 +2},$$
then find the maximum possible value of $\lfloor 100M \rfloor$.
[b]p26.[/b] In $\vartriangle ABC$, $AB = 15$, $AC = 16$, and $BC = 17$. Points $E$ and $F$ are chosen on sides $AC$ and $AB$, respectively, such that $CE = 1$ and $BF = 3$. A point $D$ is chosen on side $BC$, and let the circumcircles of $\vartriangle BFD$ and $\vartriangle CED$ intersect at point $P \ne D$. Given that $\angle PEF = 30^o$, the length of segment $PF$ can be expressed as $\frac{m}{n}$ . Find $m+n$.
[b]p27.[/b] Arnold and Barnold are playing a game with a pile of sticks with Arnold starting first. Each turn, a player can either remove $7$ sticks or $13$ sticks. If there are fewer than $7$ sticks at the start of a player’s turn, then they lose. Both players play optimally. Find the largest number of sticks under $200$ where Barnold has a winning strategy
[u]Round 10[/u]
[b]p28.[/b] Let $a$, $b$, and $c$ be positive real numbers such that $\log_2(a)-2 = \log_3(b) =\log_5(c)$ and $a +b = c$. What is $a +b +c$?
[b]p29.[/b] Two points, $P(x, y)$ and $Q(-x, y)$ are selected on parabola $y = x^2$ such that $x > 0$ and the triangle formed by points $P$, $Q$, and the origin has equal area and perimeter. Find $y$.
[b]p30.[/b] $5$ families are attending a wedding. $2$ families consist of $4$ people, $2$ families consist of $3$ people, and $1$ family consists of $2$ people. A very long row of $25$ chairs is set up for the families to sit in. Given that all members of the same family sit next to each other, let the number of ways all the people can sit in the chairs such that no two members of different families sit next to each other be $n$. Find the number of factors of $n$.
[u]Round 11[/u]
[b]p31.[/b] Let polynomial $P(x) = x^3 +ax^2 +bx +c$ have (not neccessarily real) roots $r_1$, $r_2$, and $r_3$. If $2ab = a^3 -20 = 6c -21$, then the value of $|r^3_1+r^3_2+r^3_3|$ can be written as $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find the value of $m+n$.
[b]p32.[/b] In acute $\vartriangle ABC$, let $H$, $I$ , $O$, and $G$ be the orthocenter, incenter, circumcenter, and centroid of $\vartriangle ABC$, respectively. Suppose that there exists a circle $\omega$ passing through $B$, $I$ , $H$, and $C$, the circumradius of $\vartriangle ABC$ is $312$, and $OG = 80$. Let $H'$, distinct from $H$, be the point on $\omega$ such that $\overline{HH'}$ is a diameter of $\omega$. Given that lines $H'O$ and $BC$ meet at a point $P$, find the length $OP$.
[b]p33.[/b] Find the number of ordered quadruples $(x, y, z,w)$ such that $0 \le x, y, z,w \le 1000$ are integers and $$x!+ y! =2^z \cdot w!$$ holds (Note: $0! = 1$).
[u]Round 12[/u]
[b]p34.[/b] Let $Z$ be the product of all the answers from the teams for this question. Estimate the number of digits of $Z$. If your estimate is $E$ and the answer is $A$, your score for this problem will be $$\max \left( 0, \lceil 15- |A-E| \rceil \right).$$ Your answer must be a positive integer.
[b]p35.[/b] Let $N$ be number of ordered pairs of positive integers $(x, y)$ such that $3x^2 -y^2 = 2$ and $x < 2^{75}$. Estimate $N$. If your estimate is $E$ and the answer is $A$, your score for this problem will be
$$\max \left( 0, \lceil 15- 2|A-E| \rceil \right).$$
[b]p36.[/b] $30$ points are located on a circle. How many ways are there to draw any number of line segments between the points such that none of the line segments overlap and none of the points are on more than one line segment? (It is possible to draw no line segments). If your estimate is $E$ and the answer is $A$, your score for this problem will be $$\max \left( 0, \left \lceil 15- \ln \frac{A}{E} \right \rceil \right).$$
PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h3166472p28814057]here [/url] and 5-8 [url=https://artofproblemsolving.com/community/c3h3166476p28814111]here[/url].. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
An $ (n, k) \minus{}$ tournament is a contest with $ n$ players held in $ k$ rounds such that:
$ (i)$ Each player plays in each round, and every two players meet at most once.
$ (ii)$ If player $ A$ meets player $ B$ in round $ i$, player $ C$ meets player $ D$ in round $ i$, and player $ A$ meets player $ C$ in round $ j$, then player $ B$ meets player $ D$ in round $ j$.
Determine all pairs $ (n, k)$ for which there exists an $ (n, k) \minus{}$ tournament.
[i]Proposed by Carlos di Fiore, Argentina[/i]
$25$ chess players are going to participate in a chess tournament. All are on distinct skill levels, and of the two players the one who plays better always wins. What is the least number of games needed to select the two best players?
Consider the set of all integer points in $Z^3$. Sasha and Masha play such a game. At first, Masha marks an arbitrary point. After that, Sasha marks all the points on some a plane perpendicular to one of the coordinate axes and at no point, which Masha noted. Next, they continue to take turns (Masha can't to select previously marked points, Sasha cannot choose the planes on which there are points said Masha). Masha wants to mark $n$ consecutive points on some line that parallel to one of the coordinate axes, and Sasha seeks to interfere with it. Find all $n$, in which Masha can achieve the desired result.
Ana and Beto play the following game with a stick of length $15$. Ana starts, and on her first turn, she cuts the stick into two pieces with integer lengths. Then, on each player's turn, they must cut one of the pieces, of their choice, into two new pieces with integer lengths. The player who, on their turn, leaves at least one piece with length equal to $1$ loses. Determine which of the two players has a winning strategy.
Thomas and Nils are playing a game. They have a number of cards, numbered $1, 2, 3$, et cetera.
At the start, all cards are lying face up on the table. They take alternate turns. The person whose turn it is, chooses a card that is still lying on the table and decides to either keep the card himself or to give it to the other player. When all cards are gone, each of them calculates the sum of the numbers on his own cards. If the difference between these two outcomes is divisible by $3$, then Thomas wins. If not, then Nils wins.
(a) Suppose they are playing with $2018$ cards (numbered from $1$ to $2018$) and that Thomas starts. Prove that Nils can play in such a way that he will win the game with certainty.
(b) Suppose they are playing with $2020 $cards (numbered from $1$ to $2020$) and that Nils starts. Which of the two players can play in such a way that he wins with certainty?
There is a pile with 2022 rocks. Ana y Beto play by turns to the following game, starting with Ana: in each turn, if there are $n$ rocks in the pile, the player can remove $S(n)$ rocks or $n-S(n)$ rocks, where $S(n)$ is the sum of the the digits of $n$. The person who removes the last rock wins. Determine which of the two players has a winning strategy and describe it.
There are $n$ cards. Max and Lewis play, alternately, the following game
Max starts the game, he removes exactly $1$ card, in each round the current player can remove any quantity of cards, from $1$ card to $t+1$ cards, which $t$ is the number of removed cards by the previous player, and the winner is the player who remove the last card. Determine all the possible values of $n$ such that Max has the winning strategy.
Two persons, A and B, set up an incantation contest in which they spell incantations (i.e. a finite sequence of letters) alternately. They must obey the following rules:
i) Any incantation can appear no more than once;
ii) Except for the first incantation, any incantation must be obtained by permuting the letters of the last one before it, or deleting one letter from the last incantation before it;
iii)The first person who cannot spell an incantation loses the contest. Answer the following questions:
a) If A says '$STAGEPREIMO$' first, then who will win?
b) Let $M$ be the set of all possible incantations whose lengths (i.e. the numbers of letters in them) are $2009$ and containing only four letters $A,B,C,D$, each of them appearing at least once. Find the first incantation (arranged in dictionary order) in $M$ such that A has a winning strategy by starting with it.
Suppose you are playing a game against Daniel. There are $2017$ chips on a table. During your turn, if you can write the number of chips on the table as a sum of two cubes of not necessarily distinct, nonnegative integers, then you win. Otherwise, you can take some number of chips between $1$ and $6$ inclusive off the table. (You may not leave fewer than $0$ chips on the table.) Daniel can also do the same on his turn. You make the first move, and you and Daniel always make the optimal move during turns. Who should win the game? Explain.
$A$ and $B$ play a game, given an integer $N$, $A$ writes down $1$ first, then every player sees the last number written and if it is $n$ then in his turn he writes $n+1$ or $2n$, but his number cannot be bigger than $N$. The player who writes $N$ wins. For which values of $N$ does $B$ win?
[i]Proposed by A. Slinko & S. Marshall, New Zealand[/i]
In the game of Guess the Card, two players each have a $\frac{1}{2}$ chance of winning and there is exactly one winner. Sixteen competitors stand in a circle, numbered $1,2,\dots,16$ clockwise. They participate in an $4$-round single-elimination tournament of Guess the Card. Each round, the referee randomly chooses one of the remaining players, and the players pair off going clockwise, starting from the chosen one; each pair then plays Guess the Card and the losers leave the circle. If the probability that players $1$ and $9$ face each other in the last round is $\frac{m}{n}$ where $m,n$ are positive integers, find $100m+n$.
[i]Proposed by Evan Chen[/i]
On a board there is a regular polygon $A_1A_2\ldots A_{99}.$ Ana and Barbu alternatively occupy empty vertices of the polygon and write down triangles on a list: Ana only writes obtuse triangles, while Barbu only writes acute ones.
At the first turn, Ana chooses three vertices $X,Y$ and $Z$ and writes down $\triangle XYZ.$ Then, Barbu chooses two of $X,Y$ and $Z,$ for example $X$ and $Y$, and an unchosen vertex $T$, and writes down $\triangle XYT.$ The game goes on and at each turn, the player must choose a new vertex $R$ and write down $\triangle PQR$, where $P$ is the last vertex chosen by the other player, and $Q$ is one of the other vertices of the last triangle written down by the other player.
If one player cannot perform a move, then the other one wins. If both people play optimally, determine who has a winning strategy.
Given an initial integer $ n_0 > 1$, two players, $ {\mathcal A}$ and $ {\mathcal B}$, choose integers $ n_1$, $ n_2$, $ n_3$, $ \ldots$ alternately according to the following rules :
[b]I.)[/b] Knowing $ n_{2k}$, $ {\mathcal A}$ chooses any integer $ n_{2k \plus{} 1}$ such that
\[ n_{2k} \leq n_{2k \plus{} 1} \leq n_{2k}^2.
\]
[b]II.)[/b] Knowing $ n_{2k \plus{} 1}$, $ {\mathcal B}$ chooses any integer $ n_{2k \plus{} 2}$ such that
\[ \frac {n_{2k \plus{} 1}}{n_{2k \plus{} 2}}
\]
is a prime raised to a positive integer power.
Player $ {\mathcal A}$ wins the game by choosing the number 1990; player $ {\mathcal B}$ wins by choosing the number 1. For which $ n_0$ does :
[b]a.)[/b] $ {\mathcal A}$ have a winning strategy?
[b]b.)[/b] $ {\mathcal B}$ have a winning strategy?
[b]c.)[/b] Neither player have a winning strategy?
A pack of $2n$ cards contains $n$ different pairs of cards. Each pair consists of two identical cards, either of which is called the twin of the other. A game is played between two players $A$ and $B$. A third person called the [i]dealer[/i] shuffles the pack and deals the cards one by one face upward onto the table. One of the players, called the [i]receiver[/i], takes the card dealt, provided he does not have already its twin. If he does already have the twin, his opponent takes the dealt card and becomes the receiver.
$A$ is initially the receiver and takes the first card dealt. The player who first obtains a complete set of $n$ different cards wins the game. What fraction of all possible arrangements of the pack lead to $A$ winning? Prove the correctness of your answer.
A grid consists of all points of the form $(m, n)$ where $m$ and $n$ are integers with $|m|\le 2019,|n| \le 2019$ and $|m| +|n| < 4038$. We call the points $(m,n)$ of the grid with either $|m| = 2019$ or $|n| = 2019$ the [i]boundary points[/i]. The four lines $x = \pm 2019$ and $y= \pm 2019$ are called [i]boundary lines[/i]. Two points in the grid are called [i]neighbours [/i] if the distance between them is equal to $1$.
Anna and Bob play a game on this grid.
Anna starts with a token at the point $(0,0)$. They take turns, with Bob playing first.
1) On each of his turns. Bob [i]deletes [/i] at most two boundary points on each boundary line.
2) On each of her turns. Anna makes exactly three [i]steps[/i] , where a [i]step [/i] consists of moving her token from its current point to any neighbouring point, which has not been deleted.
As soon as Anna places her token on some boundary point which has not been deleted, the game is over and Anna wins.
Does Anna have a winning strategy?
[i]Proposed by Demetres Christofides, Cyprus[/i]
There are 2 pizzerias in a town, with 2010 pizzas each. Two scientists $A$ and $B$ are taking turns ($A$ is first), where on each turn one can eat as many pizzas as he likes from one of the pizzerias or exactly one pizza from each of the two. The one that has eaten the last pizza is the winner. Which one of them is the winner, provided that they both use the best possible strategy?
Alberto and Barbara are sitting one next to each other in front of a table onto which they arranged in a line $15$ chocolates. Some of them are milk chocolates, while the others are dark chocolates. Starting from Alberto, they play the following game: during their turn, each player eats a positive number of consecutive chocolates, starting from the leftmost of the remaining ones, so that the number of chocolates eaten that are of the same type as the first one is odd (for example, if after some turns the sequence of the remaining chocolates is $\text{MMDMD},$ where $\text{M}$ stands for $\emph{milk}$ and $\text{D}$ for $\emph{dark},$ the player could either eat the first chocolate, the first $4$ chocolates or all $5$ of them). The player eating the last chocolate wins.
Among all $2^{15}$ possible initial sequences of chocolates, how many of them allow Barbara to have a winning strategy?
[u]Round 1[/u]
[b]p1.[/b] Tom and Jerry stole a chain of $7$ sausages and are now trying to divide the bounty. They take turns biting the sausages at one of the connections. When one of them breaks a connection, he may eat any single sausages that may fall out. Tom takes the first bite. Each of them is trying his best to eat more sausages than his opponent. Who will succeed?
[b]p2. [/b]The King of the Mountain Dwarves wants to light his underground throne room by placing several torches so that the whole room is lit. The king, being very miserly, wants to use as few torches as possible. What is the least number of torches he could use? (You should show why he can't do it with a smaller number of torches.)
This is the shape of the throne room:
[img]https://cdn.artofproblemsolving.com/attachments/b/2/719daafd91fc9a11b8e147bb24cb66b7a684e9.png[/img]
Also, the walls in all rooms are lined with velvet and do not reflect the light. For example, the picture on the right shows how another room in the castle is partially lit.
[img]https://cdn.artofproblemsolving.com/attachments/5/1/0f6971274e8c2ff3f2d0fa484b567ff3d631fb.png[/img]
[b]p3.[/b] In the Hundred Acre Wood, all the animals are either knights or liars. Knights always tell the truth and liars always lie. One day in the Wood, Winnie-the-Pooh, a knight, decides to visit his friend Rabbit, also a noble knight. Upon arrival, Pooh finds his friend sitting at a round table with $5$ other guests.
One-by-one, Pooh asks each person at the table how many of his two neighbors are knights. Surprisingly, he gets the same answer from everybody! "Oh bother!" proclaims Pooh. "I still don't have enough information to figure out how many knights are at this table."
"But it's my birthday," adds one of the guests. "Yes, it's his birthday!" agrees his neighbor.
Now Pooh can tell how many knights are at the table. Can you?
[b]p4.[/b] Several girls participate in a tennis tournament in which each player plays each other player exactly once. At the end of the tournament, it turns out that each player has lost at least one of her games. Prove that it is possible to find three players $A$, $B$, and $C$ such that $A$ defeated $B$, $B$ defeated $C$, and $C$ defeated $A$.
[b]p5.[/b] There are $40$ piles of stones with an equal number of stones in each. Two players, Ann and Bob, can select any two piles of stones and combine them into one bigger pile, as long as this pile would not contain more than half of all the stones on the table. A player who can’t make a move loses. Ann goes first. Who wins?
[u]Round 2[/u]
[b]p6.[/b] In a galaxy far, far away, there is a United Galactic Senate with $100$ Senators. Each Senator has no more than three enemies. Tired of their arguments, the Senators want to split into two parties so that each Senator has no more than one enemy in his own party. Prove that they can do this. (Note: If $A$ is an enemy of $B$, then $B$ is an enemy of $A$.)
[b]p7.[/b] Harry has a $2012$ by $2012$ chessboard and checkers numbered from $1$ to $2012 \times 2012$. Can he place all the checkers on the chessboard in such a way that whatever row and column Professor Snape picks, Harry will be able to choose three checkers from this row and this column such that the product of the numbers on two of the checkers will be equal to the number on the third?
[img]https://cdn.artofproblemsolving.com/attachments/b/3/a87d559b340ceefee485f41c8fe44ae9a59113.png[/img]
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].