A natural number $n$ is written on a board. On every step, Neneng and Asep changes the number on the board with the following rule: Suppose the number on the board is $X$. Initially, Neneng chooses the sign up or down. Then, Asep will pick a positive divisor $d$ of $X$, and replace $X$ with $X+d$ if Neneng chose the sign "up" or $X-d$ if Neneng chose "down". This procedure is then repeated. Asep wins if the number on the board is a nonzero perfect square, and loses if at any point he writes zero. Prove that if $n \geq 14$, Asep can win in at most $(n-5)/4$ steps.

In the beginning there are $100$ integers in a row on the blackboard. Kain and Abel then play the following game: A [i]move[/i] consists in Kain choosing a chain of consecutive numbers; the length of the chain can be any of the numbers $1,2,\dots,100$ and in particular it is allowed that Kain only chooses a single number. After Kain has chosen his chain of numbers, Abel has to decide whether he wants to add $1$ to each of the chosen numbers or instead subtract $1$ from of the numbers. After that the next move begins, and so on. If there are at least $98$ numbers on the blackboard that are divisible by $4$ after a move, then Kain has won. Prove that Kain can force a win in a finite number of moves.

Two players play the following game: alternatively they write numbers $1$ or $0$ in the vertices of an $n$-gon. First player starts the game and wins if after any of his moves there exists a triangle, whose vertices are three consecutive vertices of the $n$-gon, such that the sum of numbers in it's vertices is divisible by $3$. Second player wins if he prevents this. Determine which player has a winning strategy if: a) $n=2019$ b) $n=2020$ c) $n=2021$

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.

A number line with the integers $1$ through $20,$ from left to right, is drawn. Ten coins are placed along this number line, with one coin at each odd number on the line. A legal move consists of moving one coin from its current position to a position of strictly greater value on the number line that is not already occupied by another coin. How many ways can we perform two legal moves in sequence, starting from the initial position of the coins (different two-move sequences that result in the same position are considered distinct)?

Ari and Beri play a game using a deck of $2020$ cards with exactly one card with each number from $1$ to $2020$. Ari gets a card with a number $a$ and removes it from the deck. Beri sees the card, chooses another card from the deck with a number $b$ and removes it from the deck. Then Beri writes on the board exactly one of the trinomials $x^2-ax+b$ or $x^2-bx+a$ from his choice. This process continues until no cards are left on the deck. If at the end of the game every trinomial written on the board has integer solutions, Beri wins. Otherwise, Ari wins. Prove that Beri can always win, no matter how Ari plays.

There are $20$ points marked on a circle. Two players take turns drawing chords with ends at marked points that do not intersect the already drawn chords. The one who cannot make the next move loses. Who can secure their win?

A game is played with two players and an initial stack of $n$ pennies $(n \geq 3)$. The players take turns choosing one of the stacks of pennies on the table and splitting it into two stacks. The winner is the player who makes a move that causes all stacks to be of height $1$ or $2.$ For which starting values of n does the player who goes first win, assuming best play by both players?