There are 60 empty boxes $B_1,\ldots,B_{60}$ in a row on a table and an unlimited supply of pebbles. Given a positive integer $n$, Alice and Bob play the following game. In the first round, Alice takes $n$ pebbles and distributes them into the 60 boxes as she wishes. Each subsequent round consists of two steps: (a) Bob chooses an integer $k$ with $1\leq k\leq 59$ and splits the boxes into the two groups $B_1,\ldots,B_k$ and $B_{k+1},\ldots,B_{60}$. (b) Alice picks one of these two groups, adds one pebble to each box in that group, and removes one pebble from each box in the other group. Bob wins if, at the end of any round, some box contains no pebbles. Find the smallest $n$ such that Alice can prevent Bob from winning. [i]Czech Republic[/i]

In the game of [i]Winners Make Zeros[/i], a pair of positive integers $(m,n)$ is written on a sheet of paper. Then the game begins, as the players make the following legal moves: [list] [*] If $m\geq n$, the player choose a positive integer $c$ such that $m-cn\geq 0$, and replaces $(m,n)$ with $(m-cn,n)$. [*] If $m<n$, the player choose a positive integer $c$ such that $n-cm\geq 0$, and replaces $(m,n)$ with $(m,n-cm)$. [/list] When $m$ or $n$ becomes $0$, the game ends, and the last player to have moved is declared the winner. If $m$ and $n$ are originally $2007777$ and $2007$, find the largest choice the first player can make for $c$ (on his first move) such that the first player has a winning strategy after that first move.

The expression $*3^5*3^4*3^3*3^2*3*1$ is given. Ana and Branka alternately change the signs $*$ to $+$ or $-$ (one time each turn). Can Branka, who plays second, do this so as to obtain an expression whose value is divisible by $7$?

Among the $n$ inhabitants of an island, every two are either friends or enemies. Some day, the chief of the island orders that each inhabitant (including himself) makes and wears a necklace consisting of marbles, in such a way that the necklaces of two friends have at least one marble of the same type and that the necklaces of two enemies differ at all marbles. (A necklace may also be marbleless). Show that the chief’s order can be achieved by using $\left\lfloor\frac{n^2}4\right\rfloor$ different types of stones, but not necessarily by using fewer types.

A row of 2021 balls is given. Pasha and Vova play a game, taking turns to perform moves; Pasha begins. On each turn a boy should paint a non-painted ball in one of the three available colors: red, yellow, or green (initially all balls are non-painted). When all the balls are colored, Pasha wins, if there are three consecutive balls of different colors; otherwise Vova wins. Who has a winning strategy?

Two players in turns color the sides of an $n$-gon. The first player colors any side that has $0$ or $2$ common vertices with already colored sides. The second player colors any side that has exactly $1$ common vertex with already colored sides. The player who cannot move, loses. For which $n$ the second player has a winning strategy?

Two players play a game with a pile of $N$ coins on a table. On a player's turn, if there are $n$ coins, the player can take at most $n/2+1$ coins, and must take at least one coin. The player who grabs the last coin wins. For how many values of $N$ between $1$ and $100$ (inclusive) does the first player have a winning strategy?

[b]p1.[/b] Minseo writes all of the divisors of $1,000,000$ on the whiteboard. She then erases all of the numbers which have the digit $0$ in their decimal representation. How many numbers are left? [b]p2.[/b] $n < 100$ is an odd integer and can be expressed as $3k - 2$ and $5m + 1$ for positive integers $k$ and $m$. Find the sum of all possible values of $n$. [b]p3.[/b] Mr. Pascal is a math teacher who has the license plate $SQUARE$. However, at night, a naughty student scrambles Mr. Pascal’s license plate to $UQRSEA$. The math teacher luckily has an unscrambler that is able to move license plate letters. The unscrambler swaps the positions of any two adjacent letters. What is the minimum number of times Mr. Pascal must use the unscrambler to restore his original license plate? [b]p4.[/b] Find the number of distinct real numbers $x$ which satisfy $x^2 + 4 \lfloor x \rfloor + 4 = 0$. [b]p5.[/b] All four faces of tetrahedron $ABCD$ are acute. The distances from point $D$ to $\overline{BC}$, $\overline{CA}$ and $\overline{AB}$ are all $7$, and the distance from point $D$ to face $ABC$ is $5$. Given that the volume of tetrahedron $ABCD$ is $60$, find the surface area of tetrahedron $ABCD$. [b]p6.[/b] Forrest has a rectangular piece of paper with a width of $5$ inches and a height of $3$ inches. He wants to cut the paper into five rectangular pieces, each of which has a width of $1$ inch and a distinct integer height between $1$ and $5$ inches, inclusive. How many ways can he do so? (One possible way is shown below.) [img]https://cdn.artofproblemsolving.com/attachments/7/3/205afe28276f9df1c6bcb45fff6313c6c7250f.png[/img] [b]p7.[/b] In convex quadrilateral $ABCD$, $AB = CD = 5$, $BC = 4$ and $AD = 8$. If diagonal $\overline{AC}$ bisects $\angle DAB$, find the area of quadrilateral $ABCD$. [b]p8.[/b] Let $x$ and $y$ be real numbers such that $$x + y = x^3 + y^3 + \frac34 = \frac{1}{8xy}.$$ Find the value of $x + y$. [b]p9.[/b] Four blue squares and four red parallelograms are joined edge-to-edge alternately to form a ring of quadrilateral as shown. The areas of three of the red parallelograms are shown. Find the area of the fourth red parallelogram. [img]https://cdn.artofproblemsolving.com/attachments/9/c/911a8d53604f639e2f9bd72b59c7f50e43e258.png[/img] [b]p10.[/b] Define $f(x, n) =\sum_{d|n}\frac{x^n-1}{x^d-1}$ . For how many integers $n$ between $1$ and $2023$ inclusive is $f(3, n)$ an odd integer? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Joe makes two cubes of sidelengths $9$ and $10$ from $1729$ randomly oriented and randomly arranged unit cubes, which are initially unpainted. These cubes are dipped into white paint. Then two cubes of sidelengths $1$ and $12$ are formed from the same unit cubes, again randomly oriented and randomly arranged, and these cubes are dipped into paint remover. Joe continues to alternately dip cubes of sides $9$ and $10$ into paint and cubes of sides $1$ and $12$ into paint remover ad nauseam. What is the limit of the expected number of painted unit cube faces immediately after dipping in paint remover?

Oleksii and Solomiya play the following game on a square $6n\times 6n$, where $n$ is a positive integer. Oleksii in his turn places a piece of type $F$, consisting of three cells, on the board. Solomia, in turn, after each move of Oleksii, places the numbers $0, 1, 2$ in the cells of the figure that Oleksii has just placed, using each of the numbers exactly once. If two of Oleksii's pieces intersect at any moment (have a common square), he immediately loses. Once the square is completely filled with numbers, the game stops. In this case, if the sum of the numbers in each row and each column is divisible by $3$, Solomiya wins, and otherwise Oleksii wins. Who can win this game if the figure of type $F$ is: a) a rectangle ; b) a corner of three cells? [i]Proposed by Oleksii Masalitin[/i]

Petro and Vasyl play the following game. They take turns making moves and Petro goes first. In one turn, a player chooses one of the numbers from $1$ to $2024$ that wasn't selected before and writes it on the board. The first player after whose turn the product of the numbers on the board will be divisible by $2024$ loses. Who wins if every player wants to win? [i]Proposed by Mykhailo Shtandenko[/i]

There are $k$ heaps on the table, each containing a different positive number of stones. Juri and Mari make moves alternatingly, Juri starts. On each move, the player making the move has to pick a heap and remove one or more stones in it from the table; in addition, the player is allowed to distribute any number of remaining stones from that heap in any way between other non-empty heaps. The player to remove the last stone from the table wins. For which positive integers $k$ does Juri have a winning strategy for any initial state that satisfies the conditions?

You are given a row made by $2018$ squares, numbered consecutively from $0$ to $2017$. Initially, there is a coin in the square $0$. Two players $A$ and $B$ play alternatively, starting with $A$, on the following way: In his turn, each player can either make his coin advance $53$ squares or make the coin go back $2$ squares. On each move the coin can never go to a number less than $0$ or greater than $2017$. The player who puts the coin on the square $2017$ wins. ¿Who is the one with the wining strategy and how should he play to win?

The five sides and five diagonals of a regular pentagon are drawn on a piece of paper. Two people play a game, in which they take turns to colour one of these ten line segments. The first player colours line segments blue, while the second player colours line segments red. A player cannot colour a line segment that has already been coloured. A player wins if they are the first to create a triangle in their own colour, whose three vertices are also vertices of the regular pentagon. The game is declared a draw if all ten line segments have been coloured without a player winning. Determine whether the first player, the second player, or neither player can force a win.

p1. A fraction is called Toba-$n$ if the fraction has a numerator of $1$ and the denominator of $n$. If $A$ is the sum of all the fractions of Toba-$101$, Toba-$102$, Toba-$103$, to Toba-$200$, show that $\frac{7}{12} <A <\frac56$. p2. If $a, b$, and $c$ satisfy the system of equations $$ \frac{ab}{a+b}=\frac12$$ $$\frac{bc}{b+c}=\frac13 $$ $$ \frac{ac}{a+c}=\frac17 $$ Determine the value of $(a- c)^b$. p3. Given triangle $ABC$. If point $M$ is located at the midpoint of $AC$, point $N$ is located at the midpoint of $BC$, and the point $P$ is any point on $AB$. Determine the area of ​​the quadrilateral $PMCN$. [img]https://cdn.artofproblemsolving.com/attachments/4/d/175e2d55f889b9dd2d8f89b8bae6c986d87911.png[/img] p4. Given the rule of motion of a particle on a flat plane $xy$ as following: $N: (m, n)\to (m + 1, n + 1)$ $T: (m, n)\to (m + 1, n - 1)$, where $m$ and $n$ are integers. How many different tracks are there from $(0, 3)$ to $(7, 2)$ by using the above rules ? p5. Andra and Dedi played “SUPER-AS”. The rules of this game as following. Players take turns picking marbles from a can containing $30$ marbles. For each take, the player can take the least a minimum of $ 1$ and a maximum of $6$ marbles. The player who picks up the the last marbels is declared the winner. If Andra starts the game by taking $3$ marbles first, determine how many marbles should be taken by Dedi and what is the next strategy to take so that Dedi can be the winner.

The numbers $1, 2,. . . , 33$ are written on the board . A student performs the following procedure: choose two numbers from those written on the board so that one of them is a multiple of the other number; after the election he deletes the two numbers and writes on the board their number. The student repeats the procedure so many times until only numbers without multiples remain on the board. Determine how many numbers they remain on the board in the situation where the student can no longer repeat the procedure.