Let $a,b,c$ be 3 integers, $b$ odd, and define the sequence $\{x_n\}_{n\geq 0}$ by $x_0=4$, $x_1=0$, $x_2=2c$, $x_3=3b$ and for all positive integers $n$ we have \[ x_{n+3} = ax_{n-1}+bx_n + cx_{n+1} . \] Prove that for all positive integers $m$, and for all primes $p$ the number $x_{p^m}$ is divisible by $p$.

Let $ p$ be a positive integer. Define the function $ f: \mathbb{N}\to\mathbb{N}$ by $ f(n)\equal{}a_1^p\plus{}a_2^p\plus{}\cdots\plus{}a_m^p$, where $ a_1, a_2,\ldots, a_m$ are the decimal digits of $ n$ ($ n\equal{}\overline{a_1a_2\ldots a_m}$). Prove that every sequence $ (b_k)^\infty_{k\equal{}0}$ of positive integer that satisfy $ b_{k\plus{}1}\equal{}f(b_k)$ for all $ k\in\mathbb{N}$, has a finite number of distinct terms. $ \mathbb{N}\equal{}\{1,2,3\ldots\}$

Prove that in the set consisting of $\binom{2n}{n}$ people we can find a group of $n+1$ people in which everyone knows everyone or noone knows noone.

Let $n$ be a positive integer. Andrés has $n+1$ cards and each of them has a positive integer written, in such a way that the sum of the $n+1$ numbers is $3n$. Show that Andrés can place one or more cards in a red box and one or more cards in a blue box in such a way that the sum of the numbers of the cards in the red box is equal to twice the sum of the numbers of the cards in the blue box. Clarification: Some of Andrés's letters can be left out of the boxes.

Let $ S$ be a set with $ n$ elements, and $ F$ be a family of subsets of $ S$ with $ 2^{n\minus{}1}$ elements, such that for each $ A,B,C\in F$, $ A\cap B\cap C$ is not empty. Prove that the intersection of all of the elements of $ F$ is not empty.

Find all pairs $(k,n)$ of positive integers such that \[ k!=(2^n-1)(2^n-2)(2^n-4)\cdots(2^n-2^{n-1}). \] [i]Proposed by Gabriel Chicas Reyes, El Salvador[/i]

Call a sequence of positive integers $(a_n)_{n \ge 1}$ a "CGMO sequence" if $(a_n)_{n \ge 1}$ strictly increases, and for all integers $n \ge 2022$, $a_n$ is the smallest integer such that there exists a non-empty subset of $\{a_{1}, a_{2}, \cdots, a_{n-1} \}$ $A_n$ where $a_n \cdot \prod\limits_{a \in A_n} a$ is a perfect square. Proof: there exists $c_1, c_2 \in \mathbb{R}^{+}$ s.t. for any "CGMO sequence" $(a_n)_{n \ge 1}$ , there is a positive integer $N$ that satisfies any $n \ge N$, $c_1 \cdot n^2 \le a_n \le c_2 \cdot n^2$.

You are given $n \ge 2$ distinct positive integers. For every pair $a<b$ of them, Vlada writes on the board the largest power of $2$ that divides $b-a$. At most how many distinct powers of $2$ could Vlada have written? [i]Proposed by Oleksiy Masalitin[/i]

Determine all pairs $(n,m)$ of positive integers for which there exists an infinite sequence $\{x_k\}$ of $0$'s and $1$'s with the properties that if $x_i=0$ then $x_{i+m}=1$ and if $x_i = 1$ then $x_{i+n} = 0.$

Consider the set $A = \{1, 2, 3, ..., 2008\}$. We say that a set is of [i]type[/i] $r, r \in \{0, 1, 2\}$, if that set is a nonempty subset of $A$ and the sum of its elements gives the remainder $r$ when divided by $3$. Denote by $X_r, r \in \{0, 1, 2\}$ the class of sets of type $r$. Determine which of the classes $X_r, r \in \{0, 1, 2\}$, is the largest.

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$).

With about six hours left on the van ride home from vacation, Wendy looks for something to do. She starts working on a project for the math team. There are sixteen students, including Wendy, who are about to be sophomores on the math team. Elected as a math team officer, one of Wendy's jobs is to schedule groups of the sophomores to tutor geometry students after school on Tuesdays. The way things have been done in the past, the same number of sophomores tutor every week, but the same group of students never works together. Wendy notices that there are even numbers of groups she could select whether she chooses $4$ or $5$ students at a time to tutor geometry each week: \begin{align*}\dbinom{16}4&=1820,\\\dbinom{16}5&=4368.\end{align*} Playing around a bit more, Wendy realizes that unless she chooses all or none of the students on the math team to tutor each week that the number of possible combinations of the sophomore math teamers is always even. This gives her an idea for a problem for the $2008$ Jupiter Falls High School Math Meet team test: \[\text{How many of the 2009 numbers on Row 2008 of Pascal's Triangle are even?}\] Wendy works the solution out correctly. What is her answer?

In the City of Islands there are $2021$ islands connected by bridges. For any given pair of islands $A$ and $B$, one can go from island $A$ to island $B$ using the bridges. Moreover, for any four islands $A_1, A_2, A_3$ and $A_4$: if there is a bridge from $A_i$ to $A_{i+1}$ for each $i \in \left \{ 1,2,3 \right \}$, then there is a bridge between $A_{j}$ and $A_{k}$ for some $j,k \in \left \{ 1,2,3,4 \right \}$ with $|j-k|=2$. Show that there is at least one island which is connected to any other island by a bridge.

The edges of $K_{2017}$ are each labeled with $1,2,$ or $3$ such that any triangle has sum of labels at least $5.$ Determine the minimum possible average of all $\dbinom{2017}{2}$ labels. (Here $K_{2017}$ is defined as the complete graph on 2017 vertices, with an edge between every pair of vertices.) [i]Proposed by Michael Ma[/i]

Show that, for any fixed integer $\,n \geq 1,\,$ the sequence \[2, \; 2^{2}, \; 2^{2^{2}}, \; 2^{2^{2^{2}}}, \cdots \pmod{n}\] is eventually constant.