Found problems: 1239
let n,m be positive integers st $m>n\geq 5$ with m depending on n.
consider the sequence $a_1,a_2,...a_m$ where
$a_i=i$ for $i=1,...,n$
$a_{n+j}=a_{3j}+a_{3j-1}+a_{3j-2}$ for $j=1,..,m-n$
with $m-3(m-n)=$1 or 2, ie $a_m=a_{m-k}+a_{m-k-1}+a_{m-k-2}$ where k=1 or 2
(Thus if $n=5$, the sequence is 1,2,3,4,5,6,15
and if $n=8$, the sequence is 1,2,3,4,5,6,7,8,6,15,21)
Find $S=a_1+...+a_m$ if (i) $n=2007$ (ii) $n=2008$
Define the sequence ($x_n$) as follows: the first term is $1$, the next two are $2,4$, the next three are $5,7,9$, the next four are $10,12,14,16$, and so on. Express $x_n$ as a function of $n$.
Let $ a_1$, $ a_2$, $ \ldots$, $ a_n$ be distinct positive integers, $ n\ge 3$. Prove that there exist distinct indices $ i$ and $ j$ such that $ a_i \plus{} a_j$ does not divide any of the numbers $ 3a_1$, $ 3a_2$, $ \ldots$, $ 3a_n$.
[i]Proposed by Mohsen Jamaali, Iran[/i]
Let be the sequence $ \left( x_n \right)_{n\ge 1} $ defined as
$$ x_n= \frac{4009}{4018020} x_{n-1} -\frac{1}{4018020} x_{n-2} + \left( 1+\frac{1}{n} \right)^n. $$
Prove that $ \left( x_n \right)_{n\ge 1} $ is convergent and determine its limit.
Let bet a sequence $\left( a_n \right)_{n\ge 1} $ with $ a_1=1 $ and defined as $ a_n=\sqrt[n]{1+na_{n-1}} . $
Show that $ \left( a_n \right)_{n\ge 1} $ is convergent and determine its limit.
[i]Florian Dumitrel[/i]
A sequence of real numbers $ a_{0},\ a_{1},\ a_{2},\dots$ is defined by the formula
\[ a_{i \plus{} 1} \equal{} \left\lfloor a_{i}\right\rfloor\cdot \left\langle a_{i}\right\rangle\qquad\text{for}\quad i\geq 0;
\]here $a_0$ is an arbitrary real number, $\lfloor a_i\rfloor$ denotes the greatest integer not exceeding $a_i$, and $\left\langle a_i\right\rangle=a_i-\lfloor a_i\rfloor$. Prove that $a_i=a_{i+2}$ for $i$ sufficiently large.
[i]Proposed by Harmel Nestra, Estionia[/i]
Let $T_k = k - 1$ for $k = 1, 2, 3,4$ and
\[T_{2k-1} = T_{2k-2} + 2^{k-2}, T_{2k} = T_{2k-5} + 2^k \qquad (k \geq 3).\]
Show that for all $k$,
\[1 + T_{2n-1} = \left[ \frac{12}{7}2^{n-1} \right] \quad \text{and} \quad 1 + T_{2n} = \left[ \frac{17}{7}2^{n-1} \right],\]
where $[x]$ denotes the greatest integer not exceeding $x.$
1. A finite sequence of integers $a_0,a_1,...,a_n$ is called quadratic if $|a_k -a_{k-1}| = k^2$
for $n\geq k\geq1$.
(a) Prove that for any two integers $b$ and $c$, there exist a natural number $n$ and a quadratic sequence
with $a_0 = b$ and $a_n =c$.
(b) Find the smallest natural number $n$ for which there exists a quadratic sequence
with $a_0 = 0$ and $a_n = 1997$
Given four numbers $x, y, z, t$, let $(a, b, c, d)$ be a permutation of $(x, y, z, t)$ and set $x_1 =|a- b|$, $y_1 = |b-c|$, $z_1 = |c-d|$, and $t_1 = |d -a|$. From $x_1, y_1, z_1, t_1$, form in the same fashion the numbers $x_2, y_2, z_2, t_2$, and so on. It is known that $x_n = x, y_n = y, z_n = z, t_n = t$ for some $n$. Find all possible values of $(x, y, z, t)$.
Sequence ${u_n}$ is defined with $u_0=0,u_1=\frac{1}{3}$ and
$$\frac{2}{3}u_n=\frac{1}{2}(u_{n+1}+u_{n-1})$$ $\forall n=1,2,...$
Show that $|u_n|\leq1$ $\forall n\in\mathbb{N}.$
The sequence of natural numbers is based on the following rule: each term, starting with the second, is obtained from the previous addition works of all its various simple divisors (for example, after the number $12$ should be the number $18$, and after the number $125$ , the number $130$).
Prove that any two sequences constructed in this way have a common member.
Find the number of strictly increasing sequences of nonnegative integers with the first term $0$ and the last term $15$, and among any two consecutive terms, exactly one of them is even.
Lê Anh Vinh
Let $a_0 = 1998$ and $a_{n+1} =\frac{a_n^2}{a_n +1}$ for each nonnegative integer $n$.
Prove that $[a_n] = 1994- n$ for $0 \le n \le 1000$
Let $a_1,a_2,a_3,\ldots$ be the sequence of real numbers defined by $a_1=1$ and
$$a_m=\frac1{a_1^2+a_2^2+\ldots+a_{m-1}^2}\qquad\text{for }m\ge2.$$
Determine whether there exists a positive integer $N$ such that
$$a_1+a_2+\ldots+a_N>2017^{2017}.$$
We define the following sequences:
• Sequence $A$ has $a_n = n$.
• Sequence $B$ has $b_n = a_n$ when $a_n \not\equiv 0$ (mod 3) and $b_n = 0$ otherwise.
• Sequence $C$ has $c_n =\sum_{i=1}^{n} b_i$
.• Sequence $D$ has $d_n = c_n$ when $c_n \not\equiv 0$ (mod 3) and $d_n = 0$ otherwise.
• Sequence $E$ has $e_n =\sum_{i=1}^{n}d_i$
Prove that the terms of sequence E are exactly the perfect cubes.
Given a sequence $\{a_n\}$ of real numbers such that $|a_{k+m} - a_k - a_m| \leq 1$ for all positive integers $k$ and $m$, prove that, for all positive integers $p$ and $q$, \[|\frac{a_p}{p} - \frac{a_q}{q}| < \frac{1}{p} + \frac{1}{q}.\]
Given a segment $AB$ of the length 1, define the set $M$ of points in the
following way: it contains two points $A,B,$ and also all points obtained from $A,B$ by iterating the following rule: With every pair of points $X,Y$ the set $M$ contains also the point $Z$ of the segment $XY$ for which $YZ = 3XZ.$
A coin is tossed $n$ times, and the outcome is written in the form ($a_1,a_2,...,a_n$), where $a_i = 1$ or $2$ depending on whether the result of the $i$-th toss is the head or the tail, respectively. Set $b_j = a_1 +a_2 +...+a_j$ for $j = 1,2,...,n$, and let $p(n)$ be the probability that the sequence $b_1,b_2,...,b_n$ contains the number $n$. Express $p(n)$ in terms of $p(n-1)$ and $p(n-2)$.
Consider the sequence $(x_n)_{n\in\mathbb{N^*}}$ such that $$x_0=0,\quad x_1=2024,\quad x_n=x_{n-1}+x_{n-2}, \forall n\geq2.$$ Prove that there is an infinity of terms in this sequence that end with $2024.$
Let $S = \{0, 1, 2, .., 1994\}$. Let $a$ and $b$ be two positive numbers in $S$ which are relatively prime. Prove that the elements of $S$ can be arranged into a sequence $s_1, s_2, s_3,... , s_{1995}$ such that $s_{i+1} - s_i \equiv \pm a$ or $\pm b$ (mod $1995$) for $i = 1, 2, ... , 1994$
Let $m$ be a positive integer. We say that a sequence of positive integers written on a circle is [i] good [/i], if the sum of any $m$ consecutive numbers on this circle is a power of $m$.
1. Let $n \geq 2$ be a positive integer. Prove that for any [i] good [/i] sequence with $mn$ numbers, we can remove $m$ numbers such that the remaining $mn-m$ numbers form a [i] good [/i] sequence.
2. Prove that in any [i] good [/i] sequence with $m^2$ numbers, we can always find a number that was repeated at least $m$ times in the sequence.
For any odd prime $p$ and any integer $n,$ let $d_p (n) \in \{ 0,1, \dots, p-1 \}$ denote the remainder when $n$ is divided by $p.$ We say that $(a_0, a_1, a_2, \dots)$ is a [i]p-sequence[/i], if $a_0$ is a positive integer coprime to $p,$ and $a_{n+1} =a_n + d_p (a_n)$ for $n \geqslant 0.$
(a) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_n >b_n$ for infinitely many $n,$ and $b_n > a_n$ for infinitely many $n?$
(b) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_0 <b_0,$ but $a_n >b_n$ for all $n \geqslant 1?$
[I]United Kingdom[/i]
In a finite sequence of real numbers the sum of any seven successive terms is negative and the sum of any eleven successive terms is positive. Determine the maximum number of terms in the sequence.
Define the sequence sequence $a_0,a_1, a_2,....,a_{2018}, a_{2019}$ of real numbers as follows:
$\bullet$ $a_0 = 1$.
$\bullet$ $a_{n + 1} = a_n - \frac{a_n^2}{2019}$ for $n = 0, 1, ...,2018$.
Prove that $a_{2019} < \frac12 <a_{2018}$.
Suppose that the sequence $\{a_n\}$ of positive reals satisfies the following conditions:
[list]
[*]$a_i \leq a_j$ for every positive integers $i <j$.
[*]For any positive integer $k \geq 3$, the following inequality holds:
$$(a_1+a_2)(a_2+a_3)\cdots(a_{k-1}+a_k)(a_k+a_1)\leq (2^k+2022)a_1a_2\cdots a_k$$
[/list]
Prove that $\{a_n\}$ is constant.