The infinite sequence $a_0,a _1, a_2, \dots$ of (not necessarily distinct) integers has the following properties: $0\le a_i \le i$ for all integers $i\ge 0$, and \[\binom{k}{a_0} + \binom{k}{a_1} + \dots + \binom{k}{a_k} = 2^k\] for all integers $k\ge 0$. Prove that all integers $N\ge 0$ occur in the sequence (that is, for all $N\ge 0$, there exists $i\ge 0$ with $a_i=N$).

Let $n > 1$ be a given integer. Prove that infinitely many terms of the sequence $(a_k )_{k\ge 1}$, defined by \[a_k=\left\lfloor\frac{n^k}{k}\right\rfloor,\] are odd. (For a real number $x$, $\lfloor x\rfloor$ denotes the largest integer not exceeding $x$.) [i]Proposed by Hong Kong[/i]

Let $S = \{(x, y) \in Z^2 | 0 \le x \le 11, 0\le y \le 9\}$. Compute the number of sequences $(s_0, s_1, . . . , s_n)$ of elements in $S$ (for any positive integer $n \ge 2$) that satisfy the following conditions: $\bullet$ $s_0 = (0, 0)$ and $s_1 = (1, 0)$, $\bullet$ $s_0, s_1, . . . , s_n$ are distinct, $\bullet$ for all integers $2 \le i \le n$, $s_i$ is obtained by rotating $s_{i-2}$ about $s_{i-1}$ by either $90^o$ or $180^o$ in the clockwise direction.

Let $n=2^{2018}$ and let $S=\{1,2,\ldots,n\}$. For subsets $S_1,S_2,\ldots,S_n\subseteq S$, we call an ordered pair $(i,j)$ [i]murine[/i] if and only if $\{i,j\}$ is a subset of at least one of $S_i, S_j$. Then, a sequence of subsets $(S_1,\ldots, S_n)$ of $S$ is called [i]tasty[/i] if and only if: 1) For all $i$, $i\in S_i$. 2) For all $i$, $\displaystyle\bigcup_{j\in S_i} S_j=S_i$. 3) There do not exist pairwise distinct integers $a_1,a_2,\ldots,a_k$ with $k\ge 3$ such that for each $i$, $(a_i, a_{i+1})$ is murine, where indices are taken modulo $k$. 4) $n$ divides $1+|S_1|+|S_2|+\ldots+|S_n|$. Find the largest integer $x$ such that $2^x$ divides the number of tasty sequences $(S_1,\ldots, S_n)$. [i]Proposed by Vincent Huang and Brandon Wang

Let $a, b, c, p, q, r$ be positive integers with $p, q, r \ge 2$. Denote \[Q=\{(x, y, z)\in \mathbb{Z}^3 : 0 \le x \le a, 0 \le y \le b , 0 \le z \le c \}. \] Initially, some pieces are put on the each point in $Q$, with a total of $M$ pieces. Then, one can perform the following three types of operations repeatedly: (1) Remove $p$ pieces on $(x, y, z)$ and place a piece on $(x-1, y, z)$ ; (2) Remove $q$ pieces on $(x, y, z)$ and place a piece on $(x, y-1, z)$ ; (3) Remove $r$ pieces on $(x, y, z)$ and place a piece on $(x, y, z-1)$. Find the smallest positive integer $M$ such that one can always perform a sequence of operations, making a piece placed on $(0,0,0)$, no matter how the pieces are distributed initially.

Let be the sequence $ \left( I_n \right)_{n\ge 1} $ defined as $ I_n=\int_0^1 \frac{x^n}{\sqrt{x^{2n} +1}} dx . $ [b]a)[/b] Show that $ \left( I_n \right)_{n\ge 1} $ converges to $ 0. $ [b]b)[/b] Calculate $ \lim_{m\to\infty } m\cdot I_m. $ [b]c)[/b] Prove that the sequence $ \left( n\left( -n\cdot I_n +\lim_{m\to\infty } m\cdot I_m \right) \right)_{n\ge 1} $ is convergent.

Let $ a_1, a_2, ...$ be a sequence for which \[a_1 \equal{} 2\,\hspace{.2in}a_2 \equal{} 3\, \hspace{.2in}\text{and}\hspace{.2in}a_n \equal{} \frac {a_{n \minus{} 1}}{a_{n \minus{} 2}} \text{ for each positive integer } n \ge 3.\]What is $ a_{2006}$? $\textbf{(A) } \frac 12 \qquad \textbf{(B) } \frac 23 \qquad \textbf{(C) } \frac 32 \qquad \textbf{(D) } 2 \qquad \textbf{(E) } 3$

Determine all pairs $ (a,b)$ of real numbers such that $ 10, a, b, ab$ is an arithmetic progression.

The sequence $ \{a_n\}$ is defined by \[ a_0 \equal{} 1,a_1 \equal{} 1, \text{ and } a_n \equal{} a_{n \minus{} 1} \plus{} \frac {a_{n \minus{} 1}^2}{a_{n \minus{} 2}}\text{ for }n\ge2. \]The sequence $ \{b_n\}$ is defined by \[ b_0 \equal{} 1,b_1 \equal{} 3, \text{ and } b_n \equal{} b_{n \minus{} 1} \plus{} \frac {b_{n \minus{} 1}^2}{b_{n \minus{} 2}}\text{ for }n\ge2. \]Find $ \frac {b_{32}}{a_{32}}$.

For any positive integer $n$, let [list] [*]$\tau(n)$ denote the number of positive integer divisors of $n$, [*]$\sigma(n)$ denote the sum of the positive integer divisors of $n$, and [*]$\varphi(n)$ denote the number of positive integers less than or equal to $n$ that are relatively prime to $n$. [/list] Let $a,b > 1$ be integers. Brandon has a calculator with three buttons that replace the integer $n$ currently displayed with $\tau(n)$, $\sigma(n)$, or $\varphi(n)$, respectively. Prove that if the calculator currently displays $a$, then Brandon can make the calculator display $b$ after a finite (possibly empty) sequence of button presses. [i]Proposed by Jaedon Whyte.[/i]

Consider the sequence given by $a_0 = 3$ and such that for $i \ge 1$, we have $ai = 2^{a_{i-1}} + 1$. Let $m$ be the smallest integer such that $a^3_3$ divides $a_m$. Let $m'$ the smallest integer such that $a^3_m$ divides $a_{m'}$ . Find the value of $m'$.

Let $N$ be a positive integer and $A = a_1, a_2, ... , a_N$ be a sequence of real numbers. Define the sequence $f(A)$ to be $$f(A) = \left( \frac{a_1 + a_2}{2},\frac{a_2 + a_3}{2}, ...,\frac{a_{N-1} + a_N}{2},\frac{a_N + a_1}{2}\right)$$ and for $k$ a positive integer define $f^k (A)$ to be$ f$ applied to $A$ consecutively $k$ times (i.e. $f(f(... f(A)))$) Find all sequences $A = (a_1, a_2,..., a_N)$ of integers such that $f^k (A)$ contains only integers for all $k$.

Let $f:\mathbb{C} \to \mathbb{C}$ be an entire function, and suppose that the sequence $f^{(n)}$ of derivatives converges pointwise. Prove that $f^{(n)}(z)\to Ce^z$ pointwise for a suitable complex number $C$.

Let $(a_n)$ and $(b_n)$ be sequences of real numbers, such that $a_1 = b_1 = 1$, $a_{n+1} = a_n + \sqrt{a_n}$, $b_{n+1} = b_n + \sqrt[3]{b_n}$ for all positive integers $n$. Prove that there is a positive integer $n$ for which the inequality $a_n \leq b_k < a_{n+1}$ holds for exactly 2021 values of $k$.

Let $m$ be a positive integer. Define the sequence $\{a_{n}\}_{n \ge 0}$ by \[a_{0}=0, \; a_{1}=m, \; a_{n+1}=m^{2}a_{n}-a_{n-1}.\] Prove that an ordered pair $(a, b)$ of non-negative integers, with $a \le b$, gives a solution to the equation \[\frac{a^{2}+b^{2}}{ab+1}= m^{2}\] if and only if $(a, b)$ is of the form $(a_{n}, a_{n+1})$ for some $n \ge 0$.