Determine all integers $ n\geq 2$ having the following property: for any integers $a_1,a_2,\ldots, a_n$ whose sum is not divisible by $n$, there exists an index $1 \leq i \leq n$ such that none of the numbers $$a_i,a_i+a_{i+1},\ldots,a_i+a_{i+1}+\ldots+a_{i+n-1}$$ is divisible by $n$. Here, we let $a_i=a_{i-n}$ when $i >n$. [i]Proposed by Warut Suksompong, Thailand[/i]

Prove that in the Euclidean plane every regular polygon having an even number of sides can be dissected into lozenges. (A lozenge is a quadrilateral whose four sides are all of equal length).

Let $n \ge 2$ be a fixed integer. [list=a] [*]Determine the largest positive integer $m$ (in terms of $n$) such that there exist complex numbers $r_1$, $\dots$, $r_n$, not all zero, for which \[ \prod_{k=1}^n (r_k+1) = \prod_{k=1}^n (r_k^2+1) = \dots = \prod_{k=1}^n (r_k^m+1) = 1. \] [*]For this value of $m$, find all possible values of \[ \prod\limits_{k=1}^n (r_k^{m+1}+1). \] [/list] [i]Kaixin Wang[/i]

Given \(n \in \mathbb{N}\), let \(\sigma (n)\) denote the sum of the divisors of \(n\) and \(\phi (n)\) denote the number of integers \(n \geq m\) for which \(\gcd(m,n) = 1\). Show that for all \(n \in \mathbb{N}\), \[\large \frac{1}{\sigma (n)} + \frac{1}{\phi (n)} \geq \frac{2}{n}\] and determine when equality holds.

We recursively define a set of [i]goody pairs[/i] of words on the alphabet $\{a,b\}$ as follows: - $(a,b)$ is a goody pair; - $(\alpha, \beta) \not= (a,b)$ is a goody pair if and only if there is a goody pair $(u,v)$ such that $(\alpha, \beta) = (uv,v)$ or $(\alpha, \beta) = (u,uv)$ Show that if $(\alpha, \beta)$ is a good pair then there exists a palindrome $\gamma$ (possibly empty) such that $\alpha\beta = a \gamma b$

Define the sequence $f_1,f_2,\ldots :[0,1)\to \mathbb{R}$ of continuously differentiable functions by the following recurrence: $$ f_1=1; \qquad \quad f_{n+1}'=f_nf_{n+1} \quad\text{on $(0,1)$}, \quad \text{and}\quad f_{n+1}(0)=1. $$ Show that $\lim\limits_{n\to \infty}f_n(x)$ exists for every $x\in [0,1)$ and determine the limit function.

[b](a)[/b] Prove that $\frac{1}{n+1} \cdot \binom{2n}{n}$ is an integer for $n \geq 0.$ [b](b)[/b] Given a positive integer $k$, determine the smallest integer $C_k$ with the property that $\frac{C_k}{n+k+1} \cdot \binom{2n}{n}$ is an integer for all $n \geq k.$

How many integers can be expressed in the form: $\pm 1 \pm 2 \pm 3 \pm 4 \pm \cdots \pm 2018$?

Given a simple, connected graph with $n$ vertices and $m$ edges. Prove that one can find at least $m$ ways separating the set of vertices into two parts, such that the induced subgraphs on both parts are connected.

We say that each positive number $x$ has two sons: $x+1$ and $\frac{x}{x+1}$. Characterize all the descendants of number $1$.

Prove that for any positive integer $k$, \[(k^2)!\cdot\displaystyle\prod_{j=0}^{k-1}\frac{j!}{(j+k)!}\]is an integer.

Does there exist a strictly increasing infinite sequence of perfect squares $a_1, a_2, a_3, ...$ such that for all $k\in \mathbb{Z}^+$ we have that $13^k | a_k+1$? [i]Proposed by Jesse Zhang[/i]

Let $x_1,\ldots, x_n$ and $y_1,\ldots, y_n$ be real numbers. Let $A = (a_{ij})_{1\leq i,j\leq n}$ be the matrix with entries \[a_{ij} = \begin{cases}1,&\text{if }x_i + y_j\geq 0;\\0,&\text{if }x_i + y_j < 0.\end{cases}\] Suppose that $B$ is an $n\times n$ matrix with entries $0$, $1$ such that the sum of the elements in each row and each column of $B$ is equal to the corresponding sum for the matrix $A$. Prove that $A=B$.

A sequence $x_1, x_2, \ldots$ is defined by $x_1 = 1$ and $x_{2k}=-x_k, x_{2k-1} = (-1)^{k+1}x_k$ for all $k \geq 1.$ Prove that $\forall n \geq 1$ $x_1 + x_2 + \ldots + x_n \geq 0.$ [i]Proposed by Gerhard Wöginger, Austria[/i]

Let $n$ be a positive integer. Denote by $S_n$ the set of points $(x, y)$ with integer coordinates such that \[ \left\lvert x\right\rvert + \left\lvert y + \frac{1}{2} \right\rvert < n. \] A path is a sequence of distinct points $(x_1 , y_1), (x_2, y_2), \ldots, (x_\ell, y_\ell)$ in $S_n$ such that, for $i = 2, \ldots, \ell$, the distance between $(x_i , y_i)$ and $(x_{i-1} , y_{i-1} )$ is $1$ (in other words, the points $(x_i, y_i)$ and $(x_{i-1} , y_{i-1} )$ are neighbors in the lattice of points with integer coordinates). Prove that the points in $S_n$ cannot be partitioned into fewer than $n$ paths (a partition of $S_n$ into $m$ paths is a set $\mathcal{P}$ of $m$ nonempty paths such that each point in $S_n$ appears in exactly one of the $m$ paths in $\mathcal{P}$).