Let $N$ be an integer, $N>2$. Arnold and Bernold play the following game: there are initially $N$ tokens on a pile. Arnold plays first and removes $k$ tokens from the pile, $1\le k < N$. Then Bernold removes $m$ tokens from the pile, $1\le m\le 2k$ and so on, that is, each player, on its turn, removes a number of tokens from the pile that is between $1$ and twice the number of tokens his opponent took last. The player that removes the last token wins. For each value of $N$, find which player has a winning strategy and describe it.

Consider rows of the form: $[x], [2x], [3x], ...$ Proof that, if $N \in N$ does not occur in the sequence $([n x])$, then there is an $n \in N$ with $n - 1 < \frac{N}{x}< n -\frac{1}{x}$ Prove that, for $x, y \notin Q$: $\frac{1}{x}+\frac{1}{y} = 1$, then each $N \in N$ term is either of $([nx])$ or of $([ny])$.

For a class of $20$ students several field trips were arranged. In each trip at least four students participated. Prove that there was a field trip such that each student who participated in it took part in at least $1/17$-th of all field trips.

There are $4950$ ants. Assume that, for any three ants $A, B$ and $C$, if the ant $A$ is the boss of the ant $B$, and the ant $B$ is the boss of the ant $C$ then the ant $A$ is also the boss of the ant $C$. We want to divide the ants into $n$ groups so that in any group, either any two ants have the boss relationship or any two ants do not have the boss relationship. Find the smallest of $n$ we can always do in any case.

Arrange the numbers $\cos 2, \cos 4, \cos 6$ and $\cos 8$ from the biggest to the smallest where $2,4,6,8$ are given as radians.

Let $P$ be a point in the interior of the equilateral triangle $\triangle ABC$ such that $\sphericalangle{APC}=120^\circ$. Let $M$ be the intersection of $CP$ with $AB$, and $N$ the intersection of $AP$ and $BC$. Find the locus of the circumcentre of the triangle $MBN$ as $P$ varies.

Determine all triples $(x, y, z)$ of positive integers $x > y > z > 0$, such that $x^2 = y \cdot 2^z + 1$

Let $\mathcal{V}_c$ denote the infinite parallel ruler with the parallel edges being at distance $c$ from each other. The following construction steps are allowed using ruler $\mathcal V_c$: [list] [*] the line through two given points; [*] line $\ell'$ parallel to a given line $\ell $at distance $c$ (there are two such lines, both of which can be constructed using this step); [*] for given points $A$ and $B$ with $|AB|\ge c$ two parallel lines at distance $c$ such that one of them passes through $A$, and the other one passes through $B$ (if $|AB|>c$, there exists two such pairs of parallel lines, and both can be constructed using this step). [/list] On the perimeter of a circular piece of paper three points are given that form a scalene triangle. Let $n$ be a given positive integer. Prove that based on the three points and $n$ there exists $C>0$ such that for any $0<c\le C$ it is possible to construct $n$ points using only $\mathcal V_c$ on one of the excircles of the triangle. [i]We are not allowed to draw anything outside our circular paper. We can construct on the boundary of the paper; it is allowed to take the intersection point of a line with the boundary of the paper.[/i] [i]Proposed by Áron Bán-Szabó[/i]

In the figure below, parallelograms $ABCD$ and $BFEC$ have areas $1234$ cm$^2$ and $2804$ cm$^2$, respectively. Points $M$ and $N$ are chosen on sides $AD$ and $FE$, respectively, so that segment $MN$ passes through $B$. Find the area of $\vartriangle MNC$. [img]https://cdn.artofproblemsolving.com/attachments/b/6/8b57b632191bdb3a27ab7c59e2376dab23950b.png[/img]

Let $M$ be a point in the interior of triangle $ABC$. Let $A'$ lie on $BC$ with $MA'$ perpendicular to $BC$. Define $B'$ on $CA$ and $C'$ on $AB$ similarly. Define \[ p(M) = \frac{MA' \cdot MB' \cdot MC'}{MA \cdot MB \cdot MC}. \] Determine, with proof, the location of $M$ such that $p(M)$ is maximal. Let $\mu(ABC)$ denote this maximum value. For which triangles $ABC$ is the value of $\mu(ABC)$ maximal?

Does there exist $ 2002$ distinct positive integers $ k_1, k_2, \cdots k_{2002}$ such that for any positive integer $ n \geq 2001$, one of $ k_12^n \plus{} 1, k_22^n \plus{} 1, \cdots, k_{2002}2^n \plus{} 1$ is prime?

In a sequence $a_1, a_2, . . . , a_{1000}$ consisting of $1000$ distinct numbers a pair $(a_i, a_j )$ with $i < j$ is called [i]ascending [/i] if $a_i < a_j$ and [i]descending[/i] if $a_i > a_j$ . Determine the largest positive integer $k$ with the property that every sequence of $1000$ distinct numbers has at least $k$ non-overlapping ascending pairs or at least $k$ non-overlapping descending pairs.

Define a [i]beautiful number[/i] to be an integer of the form $a^n$, where $a\in\{3,4,5,6\}$ and $n$ is a positive integer. Prove that each integer greater than $2$ can be expressed as the sum of pairwise distinct beautiful numbers. [i]Proposed by Matthew Babbitt[/i]

In acute triangles $ABC$, $AD, BE ,CF$ are altitudes, with $D, E, F$ on the sides $BC, CA, AB$, respectively. Prove that $$DE + DF \le BC$$

Find all positive integers $k$ such that the product of the first $k$ primes increased by $1$ is a power of an integer (with an exponent greater than $1$).

$n\ge 2$ positive integers are written on the blackboard. A move consists of three steps: 1) choose an arbitrary number $a$ on the blackboard, 2) calculate the least common multiple $N$ of all numbers written on the blackboard, and 3) replace $a$ by $N/a$. Prove that using such moves it is always possible to make all the numbers on the blackboard equal to $1$. [i](A. Naradzetski)[/i]

Determine all pairs of $(m, n)$ such that is possible to tile the table $ m \times n$ with figure ”corner” as in figure with condition that in that tilling does not exist rectangle (except $m \times n$) regularly covered with figures.

For integers $0 \le m,n \le 64$, let $\alpha(m,n)$ be the number of nonnegative integers $k$ for which $\left\lfloor m/2^k \right\rfloor$ and $\left\lfloor n/2^k \right\rfloor$ are both odd integers. Consider a $65 \times 65$ matrix $M$ whose $(i,j)$th entry (for $1 \le i, j \le 65$) is \[ (-1)^{\alpha(i-1, j-1)}. \] Compute the remainder when $\det M$ is divided by $1000$. [i] Proposed by Evan Chen [/i]

Prove that any polynomial of the form $1+a_nx^n + a_{n+1}x^{n+1} + \cdots + a_kx^k$ ($k\ge n$) has at least $n-2$ non-real roots (counting multiplicity), where the $a_i$ ($n\le i\le k$) are real and $a_k\ne 0$. [i]David Yang.[/i]

Finite number of $2017$ units long sticks are fixed on a plate. Each stick has a bead that can slide up and down on it. Beads can only stand on integer heights $( 1, 2, 3,..., 2017 )$. Some of the bead pairs are connected with elastic bands. $The$ $young$ $ant$ can go to every bead, starting from any bead by using the elastic bands. $The$ $old$ $ant$ can use an elastic band if the difference in height of the beads which are connected by the band, is smaller than or equal to $1$. If the heights of the beads which are connected to each other are different, we call it $valid$ $situation$. If there exists at least one $valid$ $situation$, prove that we can create a $valid$ $situation$, by arranging the heights of the beads, in which $the$ $old$ $ant$ can go to every bead, starting from any bead.

The sequence $1,2,3,4,0,9,6,9,4,8,7,\ldots$ is formed so that each term, starting from the fifth, is the units digit of the sum of the previous four. (a) Do the digits $2,0,0,4$ occur in the sequence in this order? (b) Will the initial digits $1,2,3,4$ ever occur again in this order?

The vertices of 100-gon (i.e., polygon with 100 sides) are colored alternately white or black. One of the vertices contains a checker. Two players in turn do two things: move the checker into other vertice along the side of 100-gon and then erase some side. The game ends when it is impossible to move the checker. At the end of the game if the checker is in the white vertice then the first player wins. Otherwise the second player wins. Does any of the players have winning strategy? If yes, then who? [i]Remark.[/i] The answer may depend on initial position of the checker.

Let $ABCD$ be a parallelogram, $E$ a point on the line $AB$, beyond $B, F$ a point on the line $AD$, beyond $D$, and $K$ the point of intersection of the lines $ED$ and $BF$. Prove that quadrilaterals $ABKD$ and $CEKF$ have the same area.

On the sides $AB$ and $AC$ of the triangle $ABC$, the points $P$ and $Q$ are chosen, respectively, so that $PQ\parallel BC$. Segments $BQ$ and $CP$ intersect at point $O$. Point $A'$ is symmetric to point $A$ relative to line $BC$. The segment $A'O$ intersects the circumcircle $w$ of the triangle $APQ$ at the point $S$. Prove that circumcircle of $BSC$ is tangent to the circle $w$.

Let $S$ be the set of all 3-tuples $(a,b,c)$ that satisfy $a+b+c=3000$ and $a,b,c>0$. If one of these 3-tuples is chosen at random, what's the probability that $a,b$ or $c$ is greater than or equal to 2,500?