[b]p1[/b]. Your Halloween took a bad turn, and you are trapped on a small rock above a sea of lava. You are on rock $1$, and rocks $2$ through $12$ are arranged in a straight line in front of you. You want to get to rock $12$. You must jump from rock to rock, and you can either (1) jump from rock $n$ to $n + 1$ or (2) jump from rock $n$ to $n + 2$. Unfortunately, you are weak from eating too much candy, and you cannot do (2) twice in a row. How many different sequences of jumps will take you to your destination? [b]p2.[/b] Find the number of ordered triples $(p; q; r)$ such that $p, q, r$ are prime, $pq + pr$ is a perfect square and $p + q + r \le 100$. [b]p3.[/b] Let $x, y, z$ be nonzero complex numbers such that $\frac{1}{x}+\frac{1}{y} + \frac{1}{z} \ne 0$ and $$x^2(y + z) + y^2(z + x) + z^2(x + y) = 4(xy + yz + zx) = -3xyz.$$ Find $\frac{x^3 + y^3 + z^3}{x^2 + y^2 + z^2}$ . PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Does there exist a sequence of natural numbers in which every natural number occurs exactly once, such that for each $k = 1, 2, 3, \dots$ the sum of the first $k$ terms of the sequence is divisible by $k$? [i]A. Shapovalov[/i]

A nine-digit telephone number [i]abcdefghi [/i] is called [i]memorizable [/i] if the sequence of four initial digits [i]abcd [/i] is repeated in the sequence of the final five digits [i]efghi[/i]. How many [i]memorizable [/i] numbers of nine digits exist?

Show that if the integers $a_1$; $\dots$ $a_m$ are nonzero and for each $k =0; 1; \dots ;n$ ($n < m - 1$), $a_1 + a_22^k + a_33^k + \dots + a_mm^k = 0$; then the sequence $a_1, \dots, a_m$ contains at least $n+1$ pairs of consecutive terms having opposite signs. [i]O. Musin[/i]

The sequence an of non-zero reals satisfies $a_n^2 - a_{n-1}a_{n+1} = 1$ for $n \geq 1$. Prove that there exists a real number $\alpha$ such that $a_{n+1} = \alpha a_n - a_{n-1}$ for $n \geq 1$.

Consider the sequence $s_0 = (1, 2008)$. Define new sequences $s_i$ inductively by inserting the sum of each pair of adjacent terms in $s_{i-1}$ between them — for instance, $s_1 = (1, 2009, 2008)$. For some $n, s_n$ has exactly one term that appears twice. Find this repeated term.

A deck of eight cards has cards numbered $1, 2, 3, 4, 5, 6, 7, 8$, in that order, and a deck of five cards has cards numbered $1, 2, 3, 4, 5$, in that order. The two decks are riffle-shuffled together to form a deck with $13$ cards with the cards from each deck in the same order as they were originally. Thus, numbers on the cards might end up in the order $1122334455678$ or $1234512345678$ but not $1223144553678$. Find the number of possible sequences of the $13$ numbers.

Let $a_1,a_2,a_3,\ldots$ be an infinite sequence where for all positive integers $i$, $a_i$ is chosen to be a random positive integer between $1$ and $2016$, inclusive. Let $S$ be the set of all positive integers $k$ such that for all positive integers $j<k$, $a_j\neq a_k$. (So $1\in S$; $2\in S$ if and only if $a_1\neq a_2$; $3\in S$ if and only if $a_1\neq a_3$ and $a_2\neq a_3$; and so on.) In simplest form, let $\dfrac{p}{q}$ be the expected number of positive integers $m$ such that $m$ and $m+1$ are in $S$. Compute $pq$.

Let two circles $A$ and $B$ with unequal radii $r$ and $R$, respectively, be tangent internally at the point $A_0$. If there exists a sequence of distinct circles $(C_n)$ such that each circle is tangent to both $A$ and $B$, and each circle $C_{n+1}$ touches circle $C_{n}$ at the point $A_n$, prove that \[\sum_{n=1}^{\infty} |A_{n+1}A_n| < \frac{4 \pi Rr}{R+r}.\]

Compute the number of sequences of five positive integers $a_1,..., a_5$ where all $a_i \le 5$ and the greatest common divisor of all five integers is $1$.

Given a sequence $(a_n)$ of non-negative real numbers such that $a_{n+m}\leq a_{n} a_{m} $ for all pairs of positive integers $m$ and $n,$ prove that the sequence $(\sqrt[n]{a_n })$ converges.

The sequence $a = (a_0, a_1,a_2,...)$ is defined by $a_0 = 0, a_1 =2$ and $$a_{n+2} = 2a_{n+1} + 41a_n$$Prove that $a_{2016}$ is divisible by $2017.$

Consider a $m\times n$ rectangular board consisting of $mn$ unit squares. Two of its unit squares are called [i]adjacent[/i] if they have a common edge, and a [i]path[/i] is a sequence of unit squares in which any two consecutive squares are adjacent. Two parths are called [i]non-intersecting[/i] if they don't share any common squares. Each unit square of the rectangular board can be colored black or white. We speak of a [i]coloring[/i] of the board if all its $mn$ unit squares are colored. Let $N$ be the number of colorings of the board such that there exists at least one black path from the left edge of the board to its right edge. Let $M$ be the number of colorings of the board for which there exist at least two non-intersecting black paths from the left edge of the board to its right edge. Prove that $N^{2}\geq M\cdot 2^{mn}$.

Let $(a_n )$ be a sequence of real numbers satisfying the inequalities $$ 0 \leq a_k \leq 100a_n \;\; \text{for} \;\, n \leq k \leq 2n \;\; \text{and} \;\; n=1,2,\ldots,$$ and such that the series $$\sum_{n=0}^{\infty} a_n $$ converges. Prove that $$\lim_{n\to \infty} n a_n = 0.$$

Let $ a $ be a positive real number and $ \left( x_n\right)_{n\ge 1} $ be a sequence of pairwise distinct real numbers satisfying the properties: $ \text{(i) } x_n\in (0,a) , $ for any natural numbers $ n $ $ \text{(ii) } \left| x_n-x_m \right|\geqslant\frac{m+n}{amn} , $ for all pairs $ (m,n) $ of distinct natural numbers Show that $ a\geqslant 2. $