For which $n \ge 1$ is it possible to place the numbers $1, 2, \ldots, n$ in some order $(a)$ on a line segment, or $(b)$ on a circle so that for every $s$ from $1$ to $\frac{n(n+1)}{2}$, there is a connected subset of the segement or circle such that the sum of the numbers in that subset is $s$?

Let there be a trapezoid $ABCD$ with bases $AD$ and $BC$. Points $M$ and $P$ are on sides $AB$ and $CD$ such that $CM$ and $BP$ intersect in $N$ and the pentagon $AMNPD$ is cyclic. Prove that the triangle $ADN$ is isosceles.

Show that there do not exist natural numbers $a_1, a_2, \dots, a_{2018}$ such that the numbers \[ (a_1)^{2018}+a_2, (a_2)^{2018}+a_3, \dots, (a_{2018})^{2018}+a_1 \] are all powers of $5$ [i]Proposed by Tejaswi Navilarekallu[/i]

Prove that there exist infinitely many positive integers $n$ such that the largest prime divisor of $n^4 + n^2 + 1$ is equal to the largest prime divisor of $(n+1)^4 + (n+1)^2 +1$.

Let $a_0 = 1998$ and $a_{n+1} =\frac{a_n^2}{a_n +1}$ for each nonnegative integer $n$. Prove that $[a_n] = 1994- n$ for $0 \le n \le 1000$

In an acute-angled triangle $ABC$, we consider the feet $H_a$ and $H_b$ of the altitudes from $A$ and $B$, and the intersections $W_a$ and $W_b$ of the angle bisectors from $A$ and $B$ with the opposite sides $BC$ and $CA$ respectively. Show that the centre of the incircle $I$ of triangle $ABC$ lies on the segment $H_aH_b$ if and only if the centre of the circumcircle $O$ of triangle $ABC$ lies on the segment $W_aW_b$.

Prove that :$$\sum_{k=0}^{58}C_{2017+k}^{58-k}C_{2075-k}^{k}=\sum_{p=0}^{29}C_{4091-2p}^{58-2p}$$

There are $n$ balls numbered from $1$ to $n$, and $2n-1$ boxes numbered from $1$ to $2n-1$. For each $i$, ball number $i$ can only be put in the boxes with numbers from $1$ to $2i-1$. Let $k$ be an integer from $1$ to $n$. In how many ways we can choose $k$ balls, $k$ boxes and put these balls in the selected boxes so that each box has exactly one ball?

For some positive integer $n$, consider the usual prime factorization \[n = \displaystyle \prod_{i=1}^{k} p_{i}^{e_{i}}=p_1^{e_1}p_2^{e_2}\ldots p_k^{e_k},\] where $k$ is the number of primes factors of $n$ and $p_{i}$ are the prime factors of $n$. Define $Q(n), R(n)$ by \[ Q(n) = \prod_{i=1}^{k} p_{i}^{p_{i}} \text{ and } R(n) = \prod_{i=1}^{k} e_{i}^{e_{i}}. \] For how many $1 \leq n \leq 70$ does $R(n)$ divide $Q(n)$?

Consider an acute triangle $ABC$ with $AB>AC$ inscribed in a circle of center $O$. From the midpoint $D$ of side $BC$ we draw line $(\ell)$ perpendicular to side $AB$ that intersects it at point $E$. If line $AO$ intersects line $(\ell)$ at point $Z$, prove that points $A,Z,D,C$ are concyclic.

a) Given that integers $a$ and $b$ satisfy the equality $$a^2 - (b^2 - 4b + 1) a - (b^4 - 2b^3) = 0 \,\,\, (*)$$, prove that $b^2 + a$ is a square of an integer. b) Do there exist an infinitely many of pairs $(a,b)$ satisfying (*)?

Let $k$ and $m$ be integers with $1 < k < m$. For a positive integer $i$, let $L_i$ be the least common multiple of $1,2,\ldots,i$. Prove that $k$ is a divisor of $L_i \cdot [\binom{m}{i} - \binom{m-k}{i}]$ for all $i \geq 1$. [Here, $\binom{n}{i} = \frac{n!}{i!(n-i)!}$ denotes a binomial coefficient. Note that $\binom{n}{i} = 0$ if $n < i$.]

Let $f$ be a real-valued function defined for all real numbers, such that for some $a>0$ we have \[ f(x+a)={1\over2}+\sqrt{f(x)-f(x)^2} \] for all $x$. Prove that $f$ is periodic, and give an example of such a non-constant $f$ for $a=1$.

Suppose that $ f: \mathbb R^2\rightarrow \mathbb R$ is a non-negative and continuous function that $ \iint_{\mathbb R^2}f(x,y)dxdy\equal{}1$. Prove that there is a closed disc $ D$ with the least radius possible such that $ \iint_D f(x,y)dxdy\equal{}\frac12$.

Two fixed lines $l_1$ and $l_2$ are perpendicular to each other at a point $Y$. Points $X$ and $O$ are on $l_2$ and both are on one side of line $l_1$. We draw the circle $\omega$ with center $O$ and radius $OY$. A variable point $Z$ is on line $l_1$. Line $OZ$ cuts circle $\omega$ in $P$. Parallel to $XP$ from $O$ intersects $XZ$ in $S$. Find the locus of the point $S$. [i]Proposed by Nima Hamidi[/i]

For a natural number $n$, set $S_n$ is defined as: \[S_n = \left \{ {n\choose n}, {2n \choose n}, {3n\choose n},..., {n^2 \choose n} \right \}.\] a) Prove that there are infinitely many composite numbers $n$, such that the set $S_n$ is not complete residue system mod $n$; b) Prove that there are infinitely many composite numbers $n$, such that the set $S_n$ is complete residue system mod $n$.

The letters of the word ‘GAUSS’ and the digits in the number ‘1998’ are each cycled separately and then numbered as shown. 1. AUSSG 9981 2. USSGA 9819 3. SSGAU 8199 etc. If the pattern continues in this way, what number will appear in front of GAUSS 1998? $\textbf{(A)}\ 4 \qquad \textbf{(B)}\ 5 \qquad \textbf{(C)}\ 9 \qquad \textbf{(D)}\ 16 \qquad \textbf{(E)}\ 20$

Three lines are drawn parallel to the sides of the triangles in the opposite to the vertex, not belonging to the side, part of the plane. The distance from each side to the corresponding line equals the length of the side. Prove that six intersection points of those lines with the continuations of the sides are situated on one circumference.

A binary string is a word containing only $0$s and $1$s. In a binary string, a $1-$run is a non extendable substring containing only $1$s. Given a positive integer $n$, let $B(n)$ be the number of $1-$runs in the binary representation of $n$. For example, $B(107)=3$ since $107$ in binary is $1101011$ which has exactly three $1-$runs. What is the following expression equal to? $$B(1)+B(2)+B(3)+ \dots + B(255)$$

We say that a positive integer $n$ is [i]memorable[/i] if it has a binary representation with strictly more $1$'s than $0$'s (for example $25$ is memorable because $25=(11001)_{2}$ has more $1$'s than $0$'s). Are there infinitely many memorable perfect squares? [i]Proposed by Nikola Velov[/i]

Bisectors of triangle ABC of an angles A and C intersect with BC and AB at points A1 and C1 respectively. Lines AA1 and CC1 intersect circumcircle of triangle ABC at points A2 and C2 respectively. K is intersection point of C1A2 and A1C2. I is incenter of ABC. Prove that the line KI divides AC into two equal parts.

Let $m$ and $n$ be positive integers. Player $A$ has a field of $m \times n$, and player $B$ has a $1 \times n$ field (the first is the number of rows). On the first move, each player places on each square of his field white or black chip as he pleases. At each next on the move, each player can change the color of randomly chosen pieces on your field to the opposite, provided that in no row for this move will not change more than one chip (it is allowed not to change not a single chip). The moves are made in turn, player $A$ starts. Player $A$ wins if there is such a position that in the only row player $B$'s squares, from left to right, are the same as in some row of player's field $A$. Prove that player $A$ has the ability to win for any game of player $B$ if and only if $n <2m$.

Let $d(n)$ be the number of divisors of a nonnegative integer $n$ (we set $d(0)=0$). Find all positive integers $d$ such that there exists a two-variable polynomial $P(x,y)$ of degree $d$ with integer coefficients such that: [list] [*] for any positive integer $y$, there are infinitely many positive integers $x$ such that $\gcd(x,y)=1$ and $d(|P(x,y)|) \mid x$, and [*] for any positive integer $x$, there are infinitely many positive integers $y$ such that $\gcd(x,y)=1$ and $d(|P(x,y)|) \mid y$. [/list] [i]Allen Wang[/i]

Let $a$ and $S$ be the length of the side and the area of regular triangle inscribed in a circle of radius $1$. A closed broken line $A_1A_2...A_{51}A_1$ consisting of $51$ segments of the same length $a$ is placed inside the circle. Prove that the sum of areas of the $ 51$ triangles between the neighboring segments $$A_1A_2A_3, A_2A_3A_4,..., A_{49}A_{50}A_{51}, A_{50}A_{51}A_1, A_{51}A_1A_2$$ is not less than $3S$. (A. Berzinsh, Riga)

How many positive integers at most $420$ leave different remainders when divided by each of $5$, $6$, and $7$? [i]Proposed by Milan Haiman.[/i]