A sequence of positive integers $(a_n)_{n \ge 1}$ is of [i]Fibonacci type[/i] if it satisfies the recursive relation $a_{n + 2} = a_{n + 1} + a_n$ for all $n \ge 1$. Is it possible to partition the set of positive integers into an infinite number of Fibonacci type sequences? [i]Proposed by Ivan Borsenco[/i]

In each cell of an $n\times n$ board is a lightbulb. Initially, all of the lights are off. Each move consists of changing the state of all of the lights in a row or of all of the lights in a column (off lights are turned on and on lights are turned off). Show that if after a certain number of moves, at least one light is on, then at this moment at least $n$ lights are on.

Define a sequence by $a_0=1$, together with the rules $a_{2n+1}=a_n$ and $a_{2n+2}=a_n+a_{n+1}$ for each integer $n\ge0$. Prove that every positive rational number appears in the set $ \left\{ \tfrac {a_{n-1}}{a_n}: n \ge 1 \right\} = \left\{ \tfrac {1}{1}, \tfrac {1}{2}, \tfrac {2}{1}, \tfrac {1}{3}, \tfrac {3}{2}, \cdots \right\} $.

Let $S$ be a planar region. A $\emph{domino-tiling}$ of $S$ is a partition of $S$ into $1\times2$ rectangles. (For example, a $2\times3$ rectangle has exactly $3$ domino-tilings, as shown below.) [asy] import graph; size(7cm); pen dps = linewidth(0.7); defaultpen(dps); draw((0,0)--(3,0)--(3,2)--(0,2)--cycle, linewidth(2)); draw((4,0)--(4,2)--(7,2)--(7,0)--cycle, linewidth(2)); draw((8,0)--(8,2)--(11,2)--(11,0)--cycle, linewidth(2)); draw((1,0)--(1,2)); draw((2,1)--(3,1)); draw((0,1)--(2,1), linewidth(2)); draw((2,0)--(2,2), linewidth(2)); draw((4,1)--(7,1)); draw((5,0)--(5,2), linewidth(2)); draw((6,0)--(6,2), linewidth(2)); draw((8,1)--(9,1)); draw((10,0)--(10,2)); draw((9,0)--(9,2), linewidth(2)); draw((9,1)--(11,1), linewidth(2)); [/asy] The rectangles in the partition of $S$ are called $\emph{dominoes}$. (a) For any given positive integer $n$, find a region $S_n$ with area at most $2n$ that has exactly $n$ domino-tilings. (b) Find a region $T$ with area less than $50000$ that has exactly $100002013$ domino-tilings.

Let $ \left(a_n \right)_{n \in \mathbb{N}}$ defined by $ a_1 \equal{} 1,$ and $ a_{n \plus{} 1} \equal{} a^4_n \minus{} a^3_n \plus{} 2a^2_n \plus{} 1$ for $ n \geq 1.$ Show that there is an infinite number of primes $ p$ such that none of the $ a_n$ is divisible by $ p.$

Are there $1998$ different positive integers, the product of any two being divisible by the square of their difference?

Let $a,b$ be integers greater than 2. Prove that there exists a positive integer $k$ and a finite sequence $n_1, n_2, \dots, n_k$ of positive integers such that $n_1 = a$, $n_k = b$, and $n_i n_{i+1}$ is divisible by $n_i + n_{i+1}$ for each $i$ ($1 \leq i < k$).

Assume that $k$ and $n$ are two positive integers. Prove that there exist positive integers $m_1 , \dots , m_k$ such that \[1+\frac{2^k-1}{n}=\left(1+\frac1{m_1}\right)\cdots \left(1+\frac1{m_k}\right).\] [i]Proposed by Japan[/i]

Let $S=\{1,2\dots,n\}$ for some integer $n>1.$ Say a permutation $\pi$ of $S$ has a local maximum at $k\in S$ if \[\begin{array}{ccc}\text{(i)}&\pi(k)>\pi(k+1)&\text{for }k=1\\ \text{(ii)}&\pi(k-1)<\pi(k)\text{ and }\pi(k)>\pi(k+1)&\text{for }1<k<n\\ \text{(iii)}&\pi(k-1)M\pi(k)&\text{for }k=n\end{array}\] (For example, if $n=5$ and $\pi$ takes values at $1,2,3,4,5$ of $2,1,4,5,3,$ then $\pi$ has a local maximum of $2$ as $k=1,$ and a local maximum at $k-4.$) What is the average number of local maxima of a permutation of $S,$ averaging over all permuatations of $S?$

Let $P$ be a set of people. For two people $A$ and $B$, if $A$ knows $B$, $B$ also knows $A$. Each person in $P$ knows $2$ or less people in the set. $S$, a subset of $P$ with $k$ people, is called [i][b]k-independent set[/b][/i] of $P$ if any two people in $S$ don’t know each other. $X_1, X_2, …, X_{4041}$ are [i][b]2021-independent set[/b][/i]s of $P$ (not necessarily distinct). Show that there exists a [i][b]2021-independent set[/b][/i] of $P$, $\{v_1, v_2, …, v_{2021}\}$, which satisfies the following condition: [center] For some integer $1 \le i_1 < i_2 < \cdots < i_{2021} \leq 4041$, $v_1 \in X_{i_1}, v_2 \in X_{i_2}, \ldots, v_{2021} \in X_{i_{2021}}$ [/center] [hide=Graph Wording] Thanks to Evan Chen, here's a graph wording of the problem :) Let $G$ be a finite simple graph with maximum degree at most $2$. Let $X_1, X_2, \ldots, X_{4041}$ be independent sets of size $2021$ [i](not necessarily distinct)[/i]. Prove that there exists another independent set $\{v_1, v_2, \ldots, v_{2021}\}$ of size $2021$ and indices $1 \le t_1 < t_2 < \cdots < t_{2021} \le 4041$ such that $v_i \in X_{t_i}$ for all $i$. [/hide]

For an integer $n \geq 5,$ two players play the following game on a regular $n$-gon. Initially, three consecutive vertices are chosen, and one counter is placed on each. A move consists of one player sliding one counter along any number of edges to another vertex of the $n$-gon without jumping over another counter. A move is legal if the area of the triangle formed by the counters is strictly greater after the move than before. The players take turns to make legal moves, and if a player cannot make a legal move, that player loses. For which values of $n$ does the player making the first move have a winning strategy?

Let $(x_n)$, $n=1,2, \ldots $ be a sequence defined by $x_1=2008$ and \begin{align*} x_1 +x_2 + \ldots + x_{n-1} = \left( n^2-1 \right) x_n \qquad ~ ~ ~ \forall n \geq 2 \end{align*} Let the sequence $a_n=x_n + \frac{1}{n} S_n$, $n=1,2,3, \ldots $ where $S_n$ $=$ $x_1+x_2 +\ldots +x_n$. Determine the values of $n$ for which the terms of the sequence $a_n$ are perfect squares of an integer.

Show that for any natural number n, n^3 + (n + 1)^3 + (n + 2)^3 is divisible by 9.

Find all functions $f : Z \to Z$ satisfying $\bullet$ $ f(p) > 0$ for all prime numbers $p$, $\bullet$ $p| (f(x) + f(p))^{f(p)}- x$ for all $x \in Z$ and all prime numbers $p$.

Let $m, n \ge 2$ be integers. Carl is given $n$ marked points in the plane and wishes to mark their centroid.* He has no standard compass or straightedge. Instead, he has a device which, given marked points $A$ and $B$, marks the $m-1$ points that divide segment $\overline{AB}$ into $m$ congruent parts (but does not draw the segment). For which pairs $(m,n)$ can Carl necessarily accomplish his task, regardless of which $n$ points he is given? *Here, the [i]centroid[/i] of $n$ points with coordinates $(x_1, y_1), \dots, (x_n, y_n)$ is the point with coordinates $\left( \frac{x_1 + \dots + x_n}{n}, \frac{y_1 + \dots + y_n}{n}\right)$. [i]Proposed by Holden Mui and Carl Schildkraut[/i]