Let $A$ be any set of $20$ distinct integers chosen from the arithmetic progression $1, 4, 7,\ldots,100$. Prove that there must be two distinct integers in $A$ whose sum is $104$.

The first term of a sequence is 2005. Each succeeding term is the sum of the cubes of the digits of the previous terms. What is the 2005th term of the sequence? $ \textbf{(A)}\ 29\qquad \textbf{(B)}\ 55\qquad \textbf{(C)}\ 85\qquad \textbf{(D)}\ 133\qquad \textbf{(E)}\ 250$

Except for the first two terms, each term of the sequence $1000, x, 1000-x,\ldots$ is obtained by subtracting the preceding term from the one before that. The last term of the sequence is the first negative term encounted. What positive integer $x$ produces a sequence of maximum length?

Let $ \{\phi_n(x) \}$ be a sequence of functions belonging to $ L^2(0,1)$ and having norm less that $ 1$ such that for any subsequence $ \{\phi_{n_k}(x) \}$ the measure of the set \[ \{x \in (0,1) : \;|\frac{1}{\sqrt{N}} \sum _{k=1}^N \phi_{n_k}(x)| \geq y\ \}\] tends to $ 0$ as $ y$ and $ N$ tend to infinity. Prove that $ \phi_n$ tends to $ 0$ weakly in the function space $ L^2(0,1).$ [i]F. Moricz[/i]

6. Sequence $a_{0}, a_{1}, a_{2},...$ is determined by $a_{0}=-1$ and $a_{n}+\frac{a_{n-1}}{2}+\frac{a_{n-2}}{3}+...+\frac{a_{1}}{n}+\frac{a_{0}}{n+1}=0$ for $n\geq 1$ Prove that $a_{n}>0$ for $n\geq 1$

Let $ f \ne 0$ be a polynomial with real coefficients. Define the sequence $ f_{0}, f_{1}, f_{2}, \ldots$ of polynomials by $ f_{0}= f$ and $ f_{n+1}= f_{n}+f_{n}'$ for every $ n \ge 0$. Prove that there exists a number $ N$ such that for every $ n \ge N$, all roots of $ f_{n}$ are real.

Let $\{x_i\}^{\infty}_{i=1}$ and $\{y_i\}^{\infty}_{i=1}$ be sequences of real numbers such that $x_1=y_1=\sqrt{3}$, $$x_{n+1}=x_n+\sqrt{1+x_n^2}\quad\text{and}\quad y_{n+1}=\frac{y_n}{1+\sqrt{1+y_n^2}}$$ for all $n\geq 1$. Prove that $2<x_ny_n<3$ for all $n>1$.

A sequence of $2n + 1$ non-negative integers $a_1, a_2, ..., a_{2n + 1}$ is given. There's also a sequence of $2n + 1$ consecutive cells enumerated from $1$ to $2n + 1$ from left to right, such that initially the number $a_i$ is written on the $i$-th cell, for $i = 1, 2, ..., 2n + 1$. Starting from this initial position, we repeat the following sequence of steps, as long as it's possible: [i]Step 1[/i]: Add up the numbers written on all the cells, denote the sum as $s$. [i]Step 2[/i]: If $s$ is equal to $0$ or if it is larger than the current number of cells, the process terminates. Otherwise, remove the $s$-th cell, and shift shift all cells that are to the right of it one position to the left. Then go to Step 1. Example: $(1, 0, 1, \underline{2}, 0) \rightarrow (1, \underline{0}, 1, 0) \rightarrow (1, \underline{1}, 0) \rightarrow (\underline{1}, 0) \rightarrow (0)$. A sequence $a_1, a_2,. . . , a_{2n+1}$ of non-negative integers is called balanced, if at the end of this process there’s exactly one cell left, and it’s the cell that was initially enumerated by $(n + 1)$, i.e. the cell that was initially in the middle. Find the total number of balanced sequences as a function of $n$. [i]Proposed by Viktor Simjanoski, North Macedonia[/i]

Let $(a_n )_{n \ge o}$ and $(b_n )_{n \ge o}$ be sequences defined by $a_{n+2} = a_{n+1}+ a_n$ , $n = 0 , 1 , . .. $, $a_0 = 1$, $a_1 = 2$, and $b_{n+2} = b_{n+1} + b_n$ , $n = 0 , 1 , . . .$, $b_0 = 2$, $b_1 = 1$. How many integers do the sequences have in common?

Terri produces a sequence of positive integers by following three rules. She starts with a positive integer, then applies the appropriate rule to the result, and continues in this fashion. Rule 1: If the integer is less than 10, multiply it by 9. Rule 2: If the integer is even and greater than 9, divide it by 2. Rule 3: If the integer is odd and greater than 9, subtract 5 from it. Find the $98th$ term of the sequence that begins $ 98, 49,\ldots . $ $ \text{(A)}\ 6\qquad\text{(B)}\ 11\qquad\text{(C)}\ 22\qquad\text{(D)}\ 27\qquad\text{(E)}\ 54 $

The sequence $ a_1$, $ a_2$, $ a_3$, $ \dots$ satisfies $ a_1 \equal{} 19$, $ a_9 \equal{} 99$, and, for all $ n \ge 3$, $ a_n$ is the arithmetic mean of the first $ n \minus{} 1$ terms. Find $ a_2$. $ \textbf{(A)}\ 29\qquad \textbf{(B)}\ 59\qquad \textbf{(C)}\ 79\qquad \textbf{(D)}\ 99\qquad \textbf{(E)}\ 179$

A sequence $P=\left \{ a_{n} \right \}$ is called a $ \text{Permutation}$ of natural numbers (positive integers) if for any natural number $m,$ there exists a unique natural number $n$ such that $a_n=m.$ We also define $S_k(P)$ as: $S_k(P)=a_{1}+a_{2}+\cdots +a_{k}$ (the sum of the first $k$ elements of the sequence). Prove that there exists infinitely many distinct $ \text{Permutations}$ of natural numbers like $P_1,P_2, \cdots$ such that$:$ $$\forall k, \forall i<j: S_k(P_i)|S_k(P_j)$$

Consider the sequence $(x_n)$ given by $$x_1=2,\enspace x_{n+1}=\frac{x_n+1+\sqrt{x_n^2+2x_n+5}}2,\enspace n\ge2.$$Prove that the sequence $y_n=\sum_{k=1}^n\frac1{x_k^2-1},\enspace n\ge1$ is convergent and find its limit.

Christian Reiher and Reid Barton want to open a security box, they already managed to discover the algorithm to generate the key codes and they obtained the following information: $i)$ In the screen of the box will appear a sequence of $n+1$ numbers, $C_0 = (a_{0,1},a_{0,2},...,a_{0,n+1})$ $ii)$ If the code $K = (k_1,k_2,...,k_n)$ opens the security box then the following must happen: a) A sequence $C_i = (a_{i,1},a_{i,2},...,a_{i,n+1})$ will be asigned to each $k_i$ defined as follows: $a_{i,1} = 1$ and $a_{i,j} = a_{i-1,j}-k_ia_{i,j-1}$, for $i,j \ge 1$ b) The sequence $(C_n)$ asigned to $k_n$ satisfies that $S_n = \sum_{i=1}^{n+1}|a_i|$ has its least possible value, considering all possible sequences $K$. The sequence $C_0$ that appears in the screen is the following: $a_{0,1} = 1$ and $a_0,i$ is the sum of the products of the elements of each of the subsets with $i-1$ elements of the set $A =$ {$1,2,3,...,n$}, $i\ge 2$, such that $a_{0, n+1} = n!$ Find a sequence $K = (k_1,k_2,...,k_n)$ that satisfies the conditions of the problem and show that there exists at least $n!$ of them.

Let $k$ be a fixed integer greater than 1, and let ${m=4k^2-5}$. Show that there exist positive integers $a$ and $b$ such that the sequence $(x_n)$ defined by \[x_0=a,\quad x_1=b,\quad x_{n+2}=x_{n+1}+x_n\quad\text{for}\quad n=0,1,2,\dots,\] has all of its terms relatively prime to $m$. [i]Proposed by Jaroslaw Wroblewski, Poland[/i]