In a lake, there are 2024 leaves arranged in a row. Two frogs are positioned, one on the first leaf and the other on the second leaf. Every minute, both frogs jump simultaneously. Each time a frog jumps, it decides whether to jump to the next leaf or to the leaf that is three positions ahead. Is it possible for each leaf to be visited exactly once by exactly one of the frogs?

For a positive integer $a$, define a sequence of integers $x_1,x_2,\ldots$ by letting $x_1=a$ and $x_{n+1}=2x_n+1$ for $n\geq 1$. Let $y_n=2^{x_n}-1$. Determine the largest possible $k$ such that, for some positive integer $a$, the numbers $y_1,\ldots,y_k$ are all prime.

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?

Which one of the following combinations of given parts does not determine the indicated triangle? $ \textbf{(A)}\ \text{base angle and vertex angle; isosceles triangle}$ $ \textbf{(B)}\ \text{vertex angle and the base; isosceles triangle}$ $ \textbf{(C)}\ \text{the radius of the circumscribed circle; equilateral triangle}$ $ \textbf{(D)}\ \text{one arm and the radius of the inscribed circle; right triangle}$ $ \textbf{(E)}\ \text{two angles and a side opposite one of them; scalene triangle}$

In the acute isosceles triangle $ABC$ the altitudes $BB_1$ and $CC_1$ are drawn, which intersect at the point $H$. Let $L_1$ and $L_2$ be the feet of the angle bisectors of the triangles $B_1AC_1$ and $B_1HC_1$ drawn from vertices $A$ and $H$, respectively. The circumscribed circles of triangles $AHL_1$ and $AHL_2$ intersects the line $B_1C_1$ for the second time at points $P$ and $Q$, respectively. Prove that points $B, C, P$ and $Q$ lie on the same circle. (M. Plotnikov, D. Hilko)

Let $n$ be a positive odd integer. $C$ is a set consists of integral points on a plane, which is defined by \[ C = \{(i, j): i, j = 0, 1, \dots, 2n-1\} \] and forms a $2n \times 2n$ array. On every point there is a Guinea pig, which is facing toward one of the following directions: [i]positive/negative $x$-axis[/i], or [i]positive/negative $y$-axis[/i]. Jeff wants to keep $n^2+1$ of the Guinea pigs on the plane and remove all the others. After that, the Guinea pigs on the plane will move as the following: 1. In every round, the Guinea pigs move toward by an unit, and keep facing the same direction. 2. If a Guinea pig move to a point $(i, j)$ which is [i]not[/i] in $C$, it will further move to another point $(p, q)$ in $C$, such that $p \equiv i \pmod {2n}$ and $q \equiv j \pmod {2n}$. [i](For example, if a Guinea pig move from $(2, 0)$ to $(2, -1)$, it will then further move to $(2, 2n-1)$.)[/i] The next round begins after all the Guinea pigs settle up. Jeff's goal is to keep the appropriate Guinea pigs on the plane, so that in every single round, any two Guinea pigs will never move to the same endpoint, and will never move to the startpoints[i](in that round)[/i] of each other simultaneously. Prove that Jeff can always succeed wherever the Guinea pigs initially face. [i]Proposed by Weijiun Kao[/i] Edit: By the way, it can be proven that the number $n^2+1$ is optimal, i.e. if the Guinea pigs face appropriately, Jeff can only keep at most $n^2+1$ of them on the plane to avoid any collision.

For $n \in \mathbb{N}$, let $P(n)$ denote the product of distinct prime factors of $n$, with $P(1) = 1$. Show that for any $a_0 \in \mathbb{N}$, if we define a sequence $a_{k+1} = a_k + P(a_k)$ for $k \ge 0$, there exists some $k \in \mathbb{N}$ with $a_k/P(a_k) = 2015$.

Points $A$, $B$, and $C$ lie in the plane such that $AB=13$, $BC=14$, and $CA=15$. A peculiar laser is fired from $A$ perpendicular to $\overline{BC}$. After bouncing off $BC$, it travels in a direction perpendicular to $CA$. When it hits $CA$, it travels in a direction perpendicular to $AB$, and after hitting $AB$ its new direction is perpendicular to $BC$ again. If this process is continued indefinitely, the laser path will eventually approach some finite polygonal shape $T_\infty$. What is the ratio of the perimeter of $T_\infty$ to the perimeter of $\triangle ABC$?

We call a finite plane set $S$ consisting of points with integer coefficients a two-neighbour set, if for each point $(p, q)$ of $S$ exactly two of the points $(p +1, q), (p, q +1), (p-1, q), (p, q-1)$ belong to $S$. For which integers $n$ there exists a two-neighbour set which contains exactly $n$ points?

Inside a square with side lengths $1$ a broken line of length $>1000$ without selfintersection is drawn. Show that there is a line parallel to a side of the square that intersects the broken line in at least $501$ points.

How many a) bishops b) horses can be positioned on a chessboard at most, so that no one threatens another?

Let $ABC$ be an acute triangle and let $M$, $N$, and $ P$ be on $CB$, $AC$, and $AB$, respectively, such that $AB = AN + PB$, $BC = BP + MC$, $CA = CM + AN$. Let $\ell$ be a line in a different half plane than $C$ with respect to to the line $AB$ such that if $X, Y$ are the projections of $A, B$ on $\ell$ respectively, $AX = AP$ and $BY = BP$. Prove that $NXYM$ is a cyclic quadrilateral.

Compute the remainder when $\binom{205}{101}$ is divded by $101 \times 103$. [i]Proposed by Brandon Xu[/i]

Find all all positive integers x,y,and z satisfying the equation $x^3=3^y7^z+8$

In a mathematical competition, some competitors are friends; friendship is mutual, that is, when $A$ is a friend of $B$, then $B$ is also a friend of $A$. We say that $n \geq 3$ different competitors $A_1, A_2, \ldots, A_n$ form a [i]weakly-friendly cycle [/i]if $A_i$ is not a friend of $A_{i+1}$ for $1 \leq i \leq n$ (where $A_{n+1} = A_1$), and there are no other pairs of non-friends among the components of the cycle. The following property is satisfied: "for every competitor $C$ and every weakly-friendly cycle $\mathcal{S}$ of competitors not including $C$, the set of competitors $D$ in $\mathcal{S}$ which are not friends of $C$ has at most one element" Prove that all competitors of this mathematical competition can be arranged into three rooms, such that every two competitors in the same room are friends. ([i]Serbia[/i])

How many orbitals contain one or more electrons in an isolated ground state iron atom (Z = 26)? $ \textbf{(A) }13 \qquad\textbf{(B) }14 \qquad\textbf{(C) } 15\qquad\textbf{(D) } 16\qquad$

Find $ \lim_{a\rightarrow{\infty}} \frac{1}{a^2}\int_0^a \ln (1\plus{}e^x)dx$.

Let $\left \{ c_i \right \}_{i=0}^{\infty}$ be a sequence of non-negative real numbers with $c_{2017}>0$. A sequence of polynomials is defined as $$P_{-1}(x)=0 \ , \ P_0(x)=1 \ , \ P_{n+1}(x)=xP_n(x)+c_nP_{n-1}(x).$$ Prove that there doesn't exist any integer $n>2017$ and some real number $c$ such that $$P_{2n}(x)=P_n(x^2+c).$$ [i]Proposed by Navid Safaei[/i]

Suppose $X$ and $Y$ are the common points of two circles $\omega_1$ and $\omega_2$. The third circle $\omega$ is internally tangent to $\omega_1$ and $\omega_2$ in $P$ and $Q$, respectively. Segment $XY$ intersects $\omega$ in points $M$ and $N$. Rays $PM$ and $PN$ intersect $\omega_1$ in points $A$ and $D$; rays $QM$ and $QN$ intersect $\omega_2$ in points $B$ and $C$, respectively. Prove that $AB = CD$.

The localities $P_1, P_2, \dots, P_{1983}$ are served by ten international airlines $A_1,A_2, \dots , A_{10}$. It is noticed that there is direct service (without stops) between any two of these localities and that all airline schedules offer round-trip flights. Prove that at least one of the airlines can offer a round trip with an odd number of landings.

$100$ points are given in space such that no four of them lie in the same plane. Consider those convex polyhedra with five vertices that have all vertices from the given set. Prove that the number of such polyhedra is even.

In an $m\times n$ rectangular chessboard,there is a stone in the lower leftmost square. Two persons A,B move the stone alternately. In each step one can move the stone upward or rightward any number of squares. The one who moves it into the upper rightmost square wins. Find all $(m,n)$ such that the first person has a winning strategy.

All cells of the $m\times n$ table are colored either white or black such that all corner cells of any rectangle containing the cells of this table with sides greater than one cell are not the same color. For values $m = 2, 3, 4,$ find all $n$ such that the mentioned coloring is possible.

Jo claims that any two triangles, both having a perimeter of four, are congruent. Jann claims that two circles, both having a circumference of $4\pi$, are congruent. Julia claims that two squares, both having a perimeter of four, are congruent. Which of these students are correct? $\textbf{(A) }\text{Jo}\qquad\textbf{(B) }\text{Jann}\qquad\textbf{(C) }\text{Julia}\qquad\textbf{(D) }\text{Jo, Julia}\qquad\textbf{(E) }\text{Jann, Julia}$

Distinct points $A$, $B$ and $C$ lie on a line in this order. Point $D$ lies on the perpendicular bisector of the segment $BC$. Denote by $M$ the midpoint of the segment $BC$. Let $r$ be the radius of the incircle of the triangle $ABD$ and let $R$ be the radius of the circle with center lying outside the triangle $ACD$, tangent to $CD$, $AC$ and $AD$. Prove that $DM=r+R$.