Let $P(x)$ denote the polynomial \[3\sum_{k=0}^{9}x^k + 2\sum_{k=10}^{1209}x^k + \sum_{k=1210}^{146409}x^k.\]Find the smallest positive integer $n$ for which there exist polynomials $f,g$ with integer coefficients satisfying $x^n - 1 = (x^{16} + 1)P(x) f(x) + 11\cdot g(x)$. [i]Victor Wang.[/i]

Consider the sequence $(a_n)_{n\in \mathbb{N}}$ with $a_0=a_1=a_2=a_3=1$ and $a_na_{n-4}=a_{n-1}a_{n-3} + a^2_{n-2}$. Prove that all the terms of this sequence are integer numbers.

Let $n$ be a natural number. A tiling of a $2n \times 2n$ board is a placing of $2n^2$ dominos (of size $2 \times 1$ or $1 \times 2$) such that each of them covers exactly two squares of the board and they cover all the board.Consider now two [i]sepearate tilings[/i] of a $2n \times 2n$ board: one with red dominos and the other with blue dominos. We say two squares are red neighbours if they are covered by the same red domino in the red tiling; similarly define blue neighbours. Suppose we can assign a non-zero integer to each of the squares such that the number on any square equals the difference between the numbers on it's red and blue neighbours i.e the number on it's red neigbhbour minus the number on its blue neighbour. Show that $n$ is divisible by $3$ [i] Proposed by Tejaswi Navilarekallu [/i]

Let $f:\{1,2,\dots,2019\}\to\{-1,1\}$ be a function, such that for every $k\in\{1,2,\dots,2019\}$, there exists an $\ell\in\{1,2,\dots,2019\}$ such that $$ \sum_{i\in\mathbb{Z}:(\ell-i)(i-k)\geqslant 0} f(i)\leqslant 0. $$ Determine the maximum possible value of $$ \sum_{i\in\mathbb{Z}:1\leqslant i\leqslant 2019} f(i). $$

Find all positive integers $n$ such that $4^n + 4n + 1$ is a perfect square.

Let $ S$ be a set that contains $ n$ elements. Let $ A_{1},A_{2},\cdots,A_{k}$ be $ k$ distinct subsets of $ S$, where $ k\geq 2, |A_{i}| \equal{} a_{i}\geq 1 ( 1\leq i\leq k)$. Prove that the number of subsets of $ S$ that don't contain any $ A_{i} (1\leq i\leq k)$ is greater than or equal to $ 2^n\prod_{i \equal{} 1}^k(1 \minus{} \frac {1}{2^{a_{i}}}).$

Let $x$ and $y$ be positive integers such that $xy$ divides $x^{2}+y^{2}+1$. Show that \[\frac{x^{2}+y^{2}+1}{xy}=3.\]

Find all positive real numbers $\lambda$ such that every sequence $a_1, a_2, \ldots$ of positive real numbers satisfying \[ a_{n+1}=\lambda\cdot\frac{a_1+a_2+\ldots+a_n}{n} \] for all $n\geq 2024^{2024}$ is bounded. [i]Remark:[/i] A sequence $a_1,a_2,\ldots$ of positive real numbers is \emph{bounded} if there exists a real number $M$ such that $a_i<M$ for all $i=1,2,\ldots$

Let $ \{a_k\}$ be a sequence of integers such that $ a_1 \equal{} 1$ and $ a_{m \plus{} n} \equal{} a_m \plus{} a_n \plus{} mn$, for all positive integers $ m$ and $ n$. Then $ a_{12}$ is $ \textbf{(A)}\ 45 \qquad \textbf{(B)}\ 56 \qquad \textbf{(C)}\ 67 \qquad \textbf{(D)}\ 78 \qquad \textbf{(E)}\ 89$

Sequence $a_n$ is defined by $a_1=\frac{1}{2}$, $a_m=\frac{a_{m-1}}{2m \cdot a_{m-1} + 1}$ for $m>1$. Determine value of $a_1+a_2+...+a_k$ in terms of $k$, where $k$ is positive integer.

There are some real numbers on the board (at least two). In every step we choose two of them, for example $a$ and $b$, and then we replace them with $\frac{ab}{a+b}$. We continue until there is one number. Prove that the last number does not depend on which order we choose the numbers to erase.

[b]7.[/b] Prove that any real number x satysfying the inequalities $0<x\leq 1$ can be represented in the form $x= \sum_{k=1}^{\infty}\frac{1}{n_k}$ where $(n_k)_{k=1}^{\infty}$ is a sequence of positive integers such that $\frac{n_{k+1}}{n_k}$ assumes, for each $k$, one of the three values $2,3$ or $4$. [b](N. 14)[/b]

Consider a round-robin tournament with $2n+1$ teams, where each team plays each other team exactly one. We say that three teams $X,Y$ and $Z$, form a [i]cycle triplet [/i] if $X$ beats $Y$, $Y$ beats $Z$ and $Z$ beats $X$. There are no ties. a)Determine the minimum number of cycle triplets possible. b)Determine the maximum number of cycle triplets possible.

A polynomial $P(x)$ is called [i]nice[/i] if $P(0) = 1$ and the nonzero coefficients of $P(x)$ alternate between $1$ and $-1$ when written in order. Suppose that $P(x)$ is nice, and let $m$ and $n$ be two relatively prime positive integers. Show that \[Q(x) = P(x^n) \cdot \frac{(x^{mn} - 1)(x-1)}{(x^m-1)(x^n-1)}\] is nice as well.

Sir Alex plays the following game on a row of 9 cells. Initially, all cells are empty. In each move, Sir Alex is allowed to perform exactly one of the following two operations: [list=1] [*] Choose any number of the form $2^j$, where $j$ is a non-negative integer, and put it into an empty cell. [*] Choose two (not necessarily adjacent) cells with the same number in them; denote that number by $2^j$. Replace the number in one of the cells with $2^{j+1}$ and erase the number in the other cell. [/list] At the end of the game, one cell contains $2^n$, where $n$ is a given positive integer, while the other cells are empty. Determine the maximum number of moves that Sir Alex could have made, in terms of $n$. [i]Proposed by Warut Suksompong, Thailand[/i]