There are $2^{2018}$ positions on a circle numbered from $1$ to $2^{2018}$ in a clockwise manner. Initially, two white marbles are placed at positions $2018$ and $2019$. Before the game starts, Ping chooses to place either a black marble or a white marble at each remaining position. At the start of the game, Ping is given an integer $n$ ($0\leq n\leq 2018$) and two marbles, one black and one white. He will then move around the circle, starting at position $2n$ and moving clockwise by $2n$ positions at a time. At the starting position and each position he reaches, Ping must switch the marble at that position with a marble of the other color he carries. If he cannot do so at any position, he loses the game. Is there a way to place the $2^{2018}-2$ remaining marbles so that Ping will never lose the game regardless of the number $n$ and the number of rounds he moves around the circle?

Evaluate the definite integral $$\int_{-\pi}^{\pi}\frac{\sin nx}{(1+2^{x})\sin x} dx,$$ where $n$ is a natural number.

The NIMO problem writers have invented a new chess piece called the [i]Oriented Knight[/i]. This new chess piece has a limited number of moves: it can either move two squares to the right and one square upward or two squares upward and one square to the right. How many ways can the knight move from the bottom-left square to the top-right square of a $16\times 16$ chess board? [i] Proposed by Tony Kim and David Altizio [/i]

Let $ABC$ be a triangle with circumcircle $\Omega$. Let $S_b$ and $S_c$ respectively denote the midpoints of the arcs $AC$ and $AB$ that do not contain the third vertex. Let $N_a$ denote the midpoint of arc $BAC$ (the arc $BC$ including $A$). Let $I$ be the incenter of $ABC$. Let $\omega_b$ be the circle that is tangent to $AB$ and internally tangent to $\Omega$ at $S_b$, and let $\omega_c$ be the circle that is tangent to $AC$ and internally tangent to $\Omega$ at $S_c$. Show that the line $IN_a$, and the lines through the intersections of $\omega_b$ and $\omega_c$, meet on $\Omega$.

$ AA_{3}$ and $ BB_{3}$ are altitudes of acute-angled $ \triangle ABC$. Points $ A_{1}$ and $ B_{1}$ are second points of intersection lines $ AA_{3}$ and $ BB_{3}$ with circumcircle of $ \triangle ABC$ respectively. $ A_{2}$ and $ B_{2}$ are points on $ BC$ and $ AC$ respectively. $ A_{1}A_{2}\parallel AC$, $ B_{1}B_{2}\parallel BC$. Point $ M$ is midpoint of $ A_{2}B_{2}$. $ \angle BCA \equal{} x$. Find $ \angle A_{3}MB_{3}$.

Let $P(x)$ be a non-zero polynomial with real coefficient so that $P(0)=0$.Prove that for any positive real number $M$ there exist a positive integer $d$ so that for any monic polynomial $Q(x)$ with degree at least $d$ the number of integers $k$ so that $|P(Q(k))| \le M$ is at most equal to the degree of $Q$.

Two circles meet at points $A$ and $B$. A line through $B$ intersects the first circle again at $K$ and the second circle at $M$. A line parallel to $AM$ is tangent to the first circle at $Q$. The line $AQ$ intersects the second circle again at $R$. $(a)$ Prove that the tangent to the second circle at $R$ is parallel to $AK$. $(b)$ Prove that these two tangents meet on $KM$.

Let $ABC$ be a scalene triangle with $\Omega_A, \Omega_B,\Omega_C$ its excircles. $T_A$ is the intersection point of the external tangent (different of $AB$) of $\Omega_A,\Omega_B$ with the external tangent (different of $AC$) of $\Omega_A, \Omega_C$. Define $T_B, T_C$ in a similar way. If $I_A, I_B, I_C$ are the excenters of $ABC$, prove that the circumcircles of $AI_AT_A, BI_BT_B, CI_CT_C$ concur in exactly two points.

Let $p$ be an odd prime number and $\mathbb{Z}_{>0}$ be the set of positive integers. Suppose that a function $f:\mathbb{Z}_{>0}\times\mathbb{Z}_{>0}\to\{0,1\}$ satisfies the following properties: [list] [*] $f(1,1)=0$. [*] $f(a,b)+f(b,a)=1$ for any pair of relatively prime positive integers $(a,b)$ not both equal to 1; [*] $f(a+b,b)=f(a,b)$ for any pair of relatively prime positive integers $(a,b)$. [/list] Prove that $$\sum_{n=1}^{p-1}f(n^2,p) \geqslant \sqrt{2p}-2.$$

A monic quadratic polynomial $f$ with integer coefficients attains prime values at three consecutive integer points.show that it attains a prime value at some other integer point as well.

Let $(a_n)^{\infty}_{n =1}$ be a sequence of positive integers with $a_1 < a_2 < a_3 < ...$ , and for n = 1, 2, 3,..., $$a_{2n} = a_n + n.$$ Furthermore, whenever $n$ is prime, so is $a_n$. Prove that $a_n = n$.

$\frac{\sin 10^\circ + \sin 20^\circ}{\cos 10^\circ + \cos 20^\circ}$ equals A. $\tan 10^\circ + \tan 20^\circ$ B. $\tan 30^\circ$ C. $\frac{1}{2} (\tan 10^\circ + \tan 20^\circ)$ D. $\tan 15^\circ$ E. $\frac{1}{4} \tan 60^\circ$

For any $n,T \geq 2, n, T \in \mathbb{N}$, find all $a \in \mathbb{N}$ such that $\forall a_i > 0, i = 1, 2, \ldots, n$, we have \[\sum^n_{k=1} \frac{a \cdot k + \frac{a^2}{4}}{S_k} < T^2 \cdot \sum^n_{k=1} \frac{1}{a_k},\] where $S_k = \sum^k_{i=1} a_i.$

Let $q$ be an odd positive integer, and let $N_q$ denote the number of integers $a$ such that $0<a<q/4$ and $\gcd(a,q)=1.$ Show that $N_q$ is odd if and only if $q$ is of the form $p^k$ with $k$ a positive integer and $p$ a prime congruent to $5$ or $7$ modulo $8.$

Points $A$ and $B$ are fixed on a circle $c_1$. Circle $c_2$, whose centre lies on $c_1$, touches line $AB$ at $B$. Another line through $A$ intersects $c_2$ at points $D$ and $E$, where $D$ lies between $A$ and $E$. Line $BD$ intersects $c_1$ again at $F$. Prove that line $EB$ is tangent to $c_1$ if and only if $D$ is the midpoint of the segment $BF$.

Let $f(x)$ be a polynomial of degree $n$ with real coefficients, having $n$ (not necessarily distinct) real roots. Prove that for all real $x$, $$f(x)f''(x)\le f'(x)^2.$$

On $\triangle ABC$ if there existed a point $D$ in $AC$ such that $\angle CBD=\angle ABD+60$ and $\angle BDC=30$ and $AB \cdot BC=BD^2$, then find the angles inside the triangle $\triangle ABC$

Initially we have a $2 \times 2$ table with at least one grain of wheat on each cell. In each step we may perform one of the following two kinds of moves: $i.$ If there is at least one grain on every cell of a row, we can take away one grain from each cell in that row. $ii.$ We can double the number of grains on each cell of an arbitrary column. a) Show that it is possible to reach the empty table using the above moves, starting from the position down below. b) Show that it is possible to reach the empty table from any starting position. c) Prove that the same is true for the $8 \times 8$ tables as well.

$(FRA 5)$ Let $\alpha(n)$ be the number of pairs $(x, y)$ of integers such that $x+y = n, 0 \le y \le x$, and let $\beta(n)$ be the number of triples $(x, y, z)$ such that$ x + y + z = n$ and $0 \le z \le y \le x.$ Find a simple relation between $\alpha(n)$ and the integer part of the number $\frac{n+2}{2}$ and the relation among $\beta(n), \beta(n -3)$ and $\alpha(n).$ Then evaluate $\beta(n)$ as a function of the residue of $n$ modulo $6$. What can be said about $\beta(n)$ and $1+\frac{n(n+6)}{12}$? And what about $\frac{(n+3)^2}{6}$? Find the number of triples $(x, y, z)$ with the property $x+ y+ z \le n, 0 \le z \le y \le x$ as a function of the residue of $n$ modulo $6.$What can be said about the relation between this number and the number $\frac{(n+6)(2n^2+9n+12)}{72}$?

Let $A$ and $B$ be sets with $2011^2$ and $2010$ elements, respectively. Show that there is a function $f:A \times A \to B$ satisfying the condition $f(x,y)=f(y,x)$ for all $(x,y) \in A \times A$ such that for every function $g:A \to B$ there exists $(a_1,a_2) \in A \times A$ with $g(a_1)=f(a_1,a_2)=g(a_2)$ and $a_1 \neq a_2.$

(a) Some vertices of a dodecahedron are to be marked so that each face contains a marked vertex. What is the smallest number of marked vertices for which this is possible? (b) Answer the same question, but for an icosahedron. (G. Galperin, Moscow) (Recall that a dodecahedron has $12$ pentagonal faces which meet in threes at each vertex, while an icosahedron has $20$ triangular faces which meet in fives at each vertex.)

4. A square can be divided into four congruent figures as shown: [asy] size(2cm); draw((0,0)--(2,0)--(2,2)--(0,2)--cycle); draw((1,0)--(1,2)); draw((0,1)--(2,1)); [/asy] For how many $n$ with $1 \le n \le 100$ can a unit square be divided into $n$ congruent figures? 5. If $x + 2y - 3z = 7$ and $2x - y + 2z = 6$, determine $8x + y$. 6. Let $ABCD$ be a rectangle, and let $E$ and $F$ be points on segment $AB$ such that $AE = EF = FB$. If $CE$ intersects the line $AD$ at $P$, and $PF$ intersects $BC$ at $Q$, determine the ratio of $BQ$ to $CQ$.

There are some markets in a city. Some of them are joined by one-way streets, such that for any market there are exactly two streets to leave it. Prove that the city may be partitioned into $1014$ districts such that streets join only markets from different districts, and by the same one-way for any two districts (either only from first to second, or vice-versa).

$ABCD$ is a trapezium such that $AB\parallel DC$ and $\frac{AB}{DC}=\alpha >1$. Suppose $P$ and $Q$ are points on $AC$ and $BD$ respectively, such that \[\frac{AP}{AC}=\frac{BQ}{BD}=\frac{\alpha -1}{\alpha+1}\] Prove that $PQCD$ is a parallelogram.

Let $a,b,c,d$ be positive real numbers such that $ 2(a+b+c+d)\ge abcd $. Prove that \[ a^2+b^2+c^2+d^2 \ge abcd .\]