A four-term sequence is formed by adding each term of a four-term arithmetic sequence of positive integers to the corresponding term of a four-term geometric sequence of positive integers. The first three terms of the resulting four-term sequence are 57, 60, and 91. What is the fourth term of this sequence? $\textbf{(A) }190\qquad\textbf{(B) }194\qquad\textbf{(C) }198\qquad\textbf{(D) }202\qquad\textbf{(E) }206$

Let $a_n$ be a sequence of natural numbers defined by $a_1 = m$ and for $n > 1$. We call apair$ (a_k, a_{\ell })$ [i]interesting [/i] if (i) $0 < \ell - k < 2016$, (ii) $a_k$ divides $a_{\ell }$. Show that there exists a $m$ such that the sequence $a_n$ contains no interesting pair.

let $a_1,a_2,...a_n$ a sequence of real numbers such that $a_1+....+a_n=0$. define $b_i=a_1+a_2+....a_i$ for all $1 \leq i \leq n$ .suppose $b_i(a_{j+1}-a_{i+1}) \geq 0$ for all $1 \leq i \leq j \leq n-1$. Show that $$\max_{1 \leq l \leq n} |a_l| \geq \max_{1 \leq m \leq n} |b_m|$$

Let $a_0 < a_1 < a_2 < \dots$ be an infinite sequence of positive integers. Prove that there exists a unique integer $n\geq 1$ such that \[a_n < \frac{a_0+a_1+a_2+\cdots+a_n}{n} \leq a_{n+1}.\] [i]Proposed by Gerhard Wöginger, Austria.[/i]

Let $a > 1$ be a positive integer and $d > 1$ be a positive integer coprime to $a$. Let $x_1=1$, and for $k\geq 1$, define $$x_{k+1} = \begin{cases} x_k + d &\text{if } a \text{ does not divide } x_k \\ x_k/a & \text{if } a \text{ divides } x_k \end{cases}$$ Find, in terms of $a$ and $d$, the greatest positive integer $n$ for which there exists an index $k$ such that $x_k$ is divisible by $a^n$.

Let $S$ be a sequence $n_1, n_2,..., n_{1995}$ of positive integers such that $n_1 +...+ n_{1995 }=m < 3990$. Prove that for each integer $q$ with $1 \le q \le m$, there is a sequence $n_{i_1} , n_{i_2} , ... , n_{i_k}$ , where $1 \le i_1 < i_2 < ...< i_k \le 1995$, $n_{i_1} + ...+ n_{i_k} = q$ and $k$ depends on $q$.

Let $ a > 2$ be given, and starting $ a_0 \equal{} 1, a_1 \equal{} a$ define recursively: \[ a_{n\plus{}1} \equal{} \left(\frac{a^2_n}{a^2_{n\minus{}1}} \minus{} 2 \right) \cdot a_n.\] Show that for all integers $ k > 0,$ we have: $ \sum^k_{i \equal{} 0} \frac{1}{a_i} < \frac12 \cdot (2 \plus{} a \minus{} \sqrt{a^2\minus{}4}).$

The positive numbers $a_1, a_2,...$ satisfy $a_1 = 1$ and $(m+n)a_{m+n }\le a_m +a_n$ for all positive integers $m$ and $n$. Show that $\frac{1}{a_{200}} > 4 \cdot 10^7$ . .

A sequence $a_n$ is defined by $$a_0=0,\qquad a_1=3;$$$$a_n=8a_{n-1}+9a_{n-2}+16\text{ for }n\ge2.$$Find the least positive integer $h$ such that $a_{n+h}-a_n$ is divisible by $1999$ for all $n\ge0$.

A strictly increasing sequence of positive integers $a_1, a_2, a_3, \ldots$ has the property that for every positive integer $k$, the subsequence $a_{2k-1}, a_{2k}, a_{2k+1}$ is geometric and the subsequence $a_{2k}, a_{2k+1}, a_{2k+2}$ is arithmetic. Suppose that $a_{13} = 2016$. Find $a_1$.

Denote by $l(n)$ the largest prime divisor of $n$. Let $a_{n+1} = a_n + l(a_n)$ be a recursively defined sequence of integers with $a_1 = 2$. Determine all natural numbers $m$ such that there exists some $i \in \mathbb{N}$ with $a_i = m^2$. [i]Proposed by Nikola Velov, North Macedonia[/i]

Let $n$ be a positive integer, and let $f(n)$ denote the last nonzero digit in the decimal expansion of $n!$. $(\text a)$ Show that if $a_1,a_2,\ldots,a_k$ are distinct nonnegative integers, then $f(5^{a_1}+5^{a_2}+\ldots+5^{a_k})$ depends only on the sum $a_1+a_2+\ldots+a_k$. $(\text b)$ Assuming part $(\text a)$, we can define $$g(s)=f(5^{a_1}+5^{a_2}+\ldots+5^{a_k}),$$where $s=a_1+a_2+\ldots+a_k$. Find the least positive integer $p$ for which $$g(s)=g(s+p),\enspace\text{for all }s\ge1,$$or show that no such $p$ exists.

Find all sequences of integer $x_1,x_2,..,x_n,...$ such that $ij$ divides $x_i+x_j$ for any distinct positive integer $i$, $j$.

Let $r$ be a positive integer, and let $a_0 , a_1 , \cdots $ be an infinite sequence of real numbers. Assume that for all nonnegative integers $m$ and $s$ there exists a positive integer $n \in [m+1, m+r]$ such that \[ a_m + a_{m+1} +\cdots +a_{m+s} = a_n + a_{n+1} +\cdots +a_{n+s} \] Prove that the sequence is periodic, i.e. there exists some $p \ge 1 $ such that $a_{n+p} =a_n $ for all $n \ge 0$.

Define the polymonial sequence $\left \{ f_n\left ( x \right ) \right \}_{n\ge 1}$ with $f_1\left ( x \right )=1$, $$f_{2n}\left ( x \right )=xf_n\left ( x \right ), \; f_{2n+1}\left ( x \right ) = f_n\left ( x \right )+ f_{n+1} \left ( x \right ), \; n\ge 1.$$ Look for all the rational number $a$ which is a root of certain $f_n\left ( x \right ).$

Let ${k}$ be a fixed positive integer. A finite sequence of integers ${x_1,x_2, ..., x_n}$ is written on a blackboard. Pepa and Geoff are playing a game that proceeds in rounds as follows. - In each round, Pepa first partitions the sequence that is currently on the blackboard into two or more contiguous subsequences (that is, consisting of numbers appearing consecutively). However, if the number of these subsequences is larger than ${2}$, then the sum of numbers in each of them has to be divisible by ${k}$. - Then Geoff selects one of the subsequences that Pepa has formed and wipes all the other subsequences from the blackboard. The game finishes once there is only one number left on the board. Prove that Pepa may choose his moves so that independently of the moves of Geoff, the game finishes after at most ${3k}$ rounds. (Poland)

Define a sequence $<x_n>$ by $x_1 = 1, x_2 = x, x_{n+2} = xx_{n+1} + nx_n, n \ge 1$. Consider the polynomial $P_n(x) = x_{n-1}x_{n+1} - x_n^2$, for each $n \ge 2$. Prove or disprove that the coefficients of $P_n(x)$ are all non-negative, except for the constant term when $n$ is odd.

The sequences $a_1, a_2, a_3,...$ and $b_1, b_2, b_3,... $suffices for all positive integers $n$ of the following recursion: $a_{n+1} = a_n - b_n$ and $b_{n+1} = 2b_n$, if $a_n \ge b_n$, $a_{n+1} = 2a_n$ and $b_{n+1} = b_n - a_n$, if $a_n < b_n$. For which pairs $(a_1, b_1)$ of positive real initial terms is there an index $k$ with $a_k = 0$?

Consider a sequence of real numbers defined by: $a_{n + 1} = a_n + \frac{1}{a_n}$ for $n = 0, 1, 2, ...$ Prove that, for any positive real number $a_0$, is true that $a_{1996}$ is greater than $63$.

Let $k$ be an integer and define a sequence $a_0 , a_1 ,a_2 ,\ldots$ by $$ a_0 =0 , \;\; a_1 =k \;\;\text{and} \;\; a_{n+2} =k^{2}a_{n+1}-a_n \; \text{for} \; n\geq 0.$$ Prove that $a_{n+1} a_n +1$ divides $a_{n+1}^{2} +a_{n}^{2}$ for all $n$.

The sequence of real numbers $a_1, a_2, a_3, ...$ is defined as follows: $a_1 = 2019$, $a_2 = 2020$, $a_3 = 2021$ and for all $n \ge 1$ $$a_{n+3} = 5a^6_{n+2} + 3a^3_{n+1} + a^2_n.$$ Show that this sequence does not contain numbers of the form $m^6$ where $m$ is a positive integer.

Let $a_0$ be a positive real number and consider the general term sequence $a_n$ defined by $$a_n =a_{n-1} + \frac{1}{a_{n-1}} \,\,\, n=1,2,3,...$$ Prove that $a_{1998} > 63$.

Let $b$ and $c$ be real numbers not both equal to $1$ such that $1,b,c$ is an arithmetic progression and $1,c,b$ is a geometric progression. What is $100(b-c)$? [i]Proposed by Noah Kravitz[/i]

Let $\{a_n\}^\infty_{n=0}$ be the sequence of integers such that $a_0=1$, $a_1=1$, $a_{n+2}=2a_{n+1}-2a_n$. Decide whether $$a_n=\sum_{k=0}^{\left\lfloor\frac n2\right\rfloor}\binom n{2k}(-1)^k.$$

Let $\{u_n\}_ {n\ge 1}$ be given sequence satisfying the conditions: $u_1 = 0$, $u_2 = 1$, $u_{n+1} = u_{n-1} + 2n - 1$ for $n \ge 2$. 1) Calculate $u_5$. 2) Calculate $u_{100} + u_{101}$.