Compute the number of $10$-bit sequences of $0$’s and $1$’s do not contain $001$ as a subsequence.

A sequence of integers $a_{1}, a_{2}, \cdots$ is called $good$ if: • $a_{1}=1$, and; • $a_{i+1}-a_{i}$ is either $1$ or $2$ for all $i \geq 1$. Find all positive integers n that cannot be written as a sum $n = a_{1} + a_{2} + \cdots + a_{k}$, such that the integers $a_{1} , a_{2} , \cdots , a_{k}$ forms a good sequence.

For a positive integer $k$, define the $k$-[i]pop[/i] of a positive integer $n$ as the infinite sequence of integers $a_1, a_2, ...$ such that $a_1 = n$ and $$a_{i+1}= \left\lfloor \frac{a_i}{k} \right\rfloor , i = 1, 2, ..$$ where $ \lfloor x\rfloor $ denotes the greatest integer less than or equal to $x$. Furthermore, define a positive integer $m$ to be $k$-[i]pop avoiding[/i] if $k$ does not divide any nonzero term in the $k$-pop of $m$. For example, $14$ is 3-pop avoiding because $3$ does not divide any nonzero term in the $3$-pop of $14$, which is $14, 4, 1, 0, 0, ....$ Suppose that the number of positive integers less than $13^{2018}$ which are $13$-pop avoiding is equal to N. What is the remainder when $N$ is divided by $1000$?

Find $k \in \mathbb{N}$ such that [b]a.)[/b] For any $n \in \mathbb{N}$, there does not exist $j \in \mathbb{Z}$ which satisfies the conditions $0 \leq j \leq n - k + 1$ and $\left( \begin{array}{c} n\\ j\end{array} \right), \left( \begin{array}{c} n\\ j + 1\end{array} \right), \ldots, \left( \begin{array}{c} n\\ j + k - 1\end{array} \right)$ forms an arithmetic progression. [b]b.)[/b] There exists $n \in \mathbb{N}$ such that there exists $j$ which satisfies $0 \leq j \leq n - k + 2$, and $\left( \begin{array}{c} n\\ j\end{array} \right), \left( \begin{array}{c} n\\ j + 1\end{array} \right), \ldots , \left( \begin{array}{c} n\\ j + k - 2\end{array} \right)$ forms an arithmetic progression. Find all $n$ which satisfies part [b]b.)[/b]

The sequence of integers $a_1, a_2, ,,$ is defined as follows: $$a_n=\begin{cases} 0\,\,\,\, if\,\,\,\, n\,\,\,\, has\,\,\,\, an\,\,\,\, even\,\,\,\, number\,\,\,\, of\,\,\,\, divisors\,\,\,\, greater\,\,\,\, than\,\,\,\, 2014 \\ 1 \,\,\,\, if \,\,\,\, n \,\,\,\, has \,\,\,\, an \,\,\,\, odd \,\,\,\, number \,\,\,\, of \,\,\,\, divisors \,\,\,\, greater \,\,\,\, than \,\,\,\, 2014\end{cases}$$ Show that the sequence $a_n$ never becomes periodic.

[hide=Note][i]The following problem is open in the sense that no solution is currently known. Progress on the problem may be awarded points. An example of progress on the problem is a non-trivial bound on the sequence defined below.[/i][/hide] For each integer $n\ge2$, consider a regular polygon with $2n$ sides, all of length $1$. Let $C(n)$ denote the number of ways to tile this polygon using quadrilaterals whose sides all have length $1$. Determine the limit inferior and the limit superior of the sequence defined by $$\frac1{n^2}\log_2C(n).$$

A house has an even number of lamps distributed among its rooms in such a way that there are at least three lamps in every room. Each lamp shares a switch with exactly one other lamp, not necessarily from the same room. Each change in the switch shared by two lamps changes their states simultaneously. Prove that for every initial state of the lamps there exists a sequence of changes in some of the switches at the end of which each room contains lamps which are on as well as lamps which are off. [i]Proposed by Australia[/i]

We say that a sequence $a_1,a_2,\cdots$ is [i]expansive[/i] if for all positive integers $j,\; i<j$ implies $|a_i-a_j|\ge \tfrac 1j$. Find all positive real numbers $C$ for which one can find an expansive sequence in the interval $[0,C]$.

Find all sequences $\left(a_0,a_1,a_2,a_3\right)$, where for each $k$, $0\leq k\leq3$, $a_k$ is the number of times that the number $k$ appears in the sequence $\left(a_0,a_1,a_2,a_3\right)$.

Determine the greatest positive integer $k$ that satisfies the following property: The set of positive integers can be partitioned into $k$ subsets $A_1, A_2, \ldots, A_k$ such that for all integers $n \geq 15$ and all $i \in \{1, 2, \ldots, k\}$ there exist two distinct elements of $A_i$ whose sum is $n.$ [i]Proposed by Igor Voronovich, Belarus[/i]

Let $P_n$ denote the $n$-th Pell number defined by $P_{n+1}=2P_n+P_{n-1}$, $P_0=0$, $P_1=1$. Furthermore, let $T_n$ denote the $n$-th triangular number, that is $T_n=\binom{n+1}2$. Show that $$\sum_{n=0}^\infty4T_n\cdot\frac{P_n}{3^{n+2}}=P_3+P_4$$ [i]Proposed by Ángel Plaza[/i]

Let $p(x)$ be a polynomial with rational coefficients, of degree at least $2$. Suppose that a sequence $(r_{n})$ of rational numbers satisfies $r_{n}= p(r_{n+1})$ for every $n\geq 1$. Prove that the sequence $(r_{n})$ is periodic.

Find all integers $n \ge 2$ for which there exists $n$ integers $a_1,a_2,\dots,a_n \ge 2$ such that for all indices $i \ne j$, we have $a_i \mid a_j^2+1$.

Determine the largest integer $n\geq 3$ for which the edges of the complete graph on $n$ vertices can be assigned pairwise distinct non-negative integers such that the edges of every triangle have numbers which form an arithmetic progression.

Determine the integers $k\geq 2$ for which the sequence $\Big\{ \binom{2n}{n} \pmod{k}\Big\}_{n\in \mathbb{Z}_{\geq 0}}$ is eventually periodic.

Let $(a_n)_{n=1}^{\infty}$ and $(b_n)_{n=1}^{\infty}$ be two sequences of positive numbers. Show that the following statements are equivalent: [list=1] [*]There is a sequence $(c_n)_{n=1}^{\infty}$ of positive numbers such that $\sum_{n=1}^{\infty}{\frac{a_n}{c_n}}$ and $\sum_{n=1}^{\infty}{\frac{c_n}{b_n}}$ both converge;[/*] [*]$\sum_{n=1}^{\infty}{\sqrt{\frac{a_n}{b_n}}}$ converges.[/*] [/list] [i]Proposed by Tomáš Bárta, Charles University, Prague[/i]