Let $a_1,a_2,a_3,\ldots$ be an infinite sequence of positive integers such that $a_{n+2m}$ divides $a_{n}+a_{n+m}$ for all positive integers $n$ and $m.$ Prove that this sequence is eventually periodic, i.e. there exist positive integers $N$ and $d$ such that $a_n=a_{n+d}$ for all $n>N.$

Let $n$ be a fixed positive integer. How many ways are there to write $n$ as a sum of positive integers, \[n = a_1 + a_2 + \cdots a_k\] with $k$ an arbitrary positive integer and $a_1 \le a_2 \le \cdots \le a_k \le a_1 + 1$? For example, with $n = 4$, there are four ways: $4$, $2 + 2$, $1 + 1 + 2$, $1 + 1 + 1 + 1$.

There are $ n ( \ge 4 ) $ people and some people shaked hands each other. Two people can shake hands at most 1 time. For arbitrary four people $ A, B, C, D$ such that $ (A,B), (B,C), (C,D) $ shaked hands, then one of $ (A,C), (A,D), (B,D) $ shaked hand each other. Prove the following statements. (a) Prove that $ n $ people can be divided into two groups, $ X, Y ( \ne \emptyset )$ , such that for all $ (x,y) $ where $ x \in X $ and $ y \in Y $, $ x $ and $ y $ shaked hands or $ x $ and $ y $ didn't shake hands. (b) There exist two people $ A , B $ such that the set of people who are not $ A $ and $ B $ that shaked hands with $ A $ is same wiith the set of people who are not $ A $ and $ B $ that shaked hands with $ B $.

Infinitely many equidistant parallel lines are drawn in the plane. A positive integer $n \geqslant 3$ is called frameable if it is possible to draw a regular polygon with $n$ sides all whose vertices lie on these lines, and no line contains more than one vertex of the polygon. (a) Show that $3, 4, 6$ are frameable. (b) Show that any integer $n \geqslant 7$ is not frameable. (c) Determine whether $5$ is frameable. [i]Proposed by Muralidharan[/i]

The sequence $ \{x_{n}\}$ is defined by $ x_{1} \equal{} 2,x_{2} \equal{} 12$, and $ x_{n \plus{} 2} \equal{} 6x_{n \plus{} 1} \minus{} x_{n}$, $ (n \equal{} 1,2,\ldots)$. Let $ p$ be an odd prime number, let $ q$ be a prime divisor of $ x_{p}$. Prove that if $ q\neq2,3,$ then $ q\geq 2p \minus{} 1$.

Elmo is drawing with colored chalk on a sidewalk outside. He first marks a set $S$ of $n>1$ collinear points. Then, for every unordered pair of points $\{X,Y\}$ in $S$, Elmo draws the circle with diameter $XY$ so that each pair of circles which intersect at two distinct points are drawn in different colors. Count von Count then wishes to count the number of colors Elmo used. In terms of $n$, what is the minimum number of colors Elmo could have used? [i]Michael Ren[/i]

Let the sequence $(a_n)_{n \in \mathbb{N}}$, where $\mathbb{N}$ denote the set of natural numbers, is given with $a_1=2$ and $a_{n+1}$ $=$ $a_n^2$ $-$ $a_n+1$. Find the minimum real number $L$, such that for every $k$ $\in$ $\mathbb{N}$ \begin{align*} \sum_{i=1}^k \frac{1}{a_i} < L \end{align*}

Suppose that $ T$ is a tree with $ k$ edges. Prove that the $ k$-dimensional cube can be partitioned to graphs isomorphic to $ T$.

For each integer $k\geq 2$, determine all infinite sequences of positive integers $a_1$, $a_2$, $\ldots$ for which there exists a polynomial $P$ of the form \[ P(x)=x^k+c_{k-1}x^{k-1}+\dots + c_1 x+c_0, \] where $c_0$, $c_1$, \dots, $c_{k-1}$ are non-negative integers, such that \[ P(a_n)=a_{n+1}a_{n+2}\cdots a_{n+k} \] for every integer $n\geq 1$.

Find all functions $f: \mathbb{Q}\to \mathbb{R}$ such that for all $x,y\in \mathbb{Q}$: \[f(xy)=f(x)f(y)-f(x+y)+1.\]

Determine all integers $n\geqslant 2$ with the following property: every $n$ pairwise distinct integers whose sum is not divisible by $n$ can be arranged in some order $a_1,a_2,\ldots, a_n$ so that $n$ divides $1\cdot a_1+2\cdot a_2+\cdots+n\cdot a_n.$ [i]Arsenii Nikolaiev, Anton Trygub, Oleksii Masalitin, and Fedir Yudin[/i]

suppose that $A$ is the set of all Closed intervals $[a,b] \subset \mathbb{R}$. Find all functions $f:\mathbb{R} \rightarrow A$ such that $\bullet$ $x \in f(y) \Leftrightarrow y \in f(x)$ $\bullet$ $|x-y|>2 \Leftrightarrow f(x) \cap f(y)=\varnothing$ $\bullet$ For all real numbers $0\leq r\leq 1$, $f(r)=[r^2-1,r^2+1]$ Proposed by Matin Yousefi

Consider an infinite grid $\mathcal G$ of unit square cells. A [i]chessboard polygon[/i] is a simple polygon (i.e. not self-intersecting) whose sides lie along the gridlines of $\mathcal G$. Nikolai chooses a chessboard polygon $F$ and challenges you to paint some cells of $\mathcal G$ green, such that any chessboard polygon congruent to $F$ has at least $1$ green cell but at most $2020$ green cells. Can Nikolai choose $F$ to make your job impossible? [i]Nikolai Beluhov[/i]

A positive integer $n$ is given. If there exists sets $F_1, F_2, \cdots F_m$ satisfying the following conditions, prove that $m \le n$. (For sets $A, B$, $|A|$ is the number of elements of $A$. $A-B$ is the set of elements that are in $A$ but not $B$. $\text{min}(x,y)$ is the number that is not larger than the other.) (i): For all $1 \le i \le m$, $F_i \subseteq \{1,2,\cdots,n\}$ (ii): For all $1 \le i < j \le m$, $\text{min}(|F_i-F_j|,|F_j-F_i|) = 1$