Found problems: 1239
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.
Let $a, b$, and $c$ be positive integers such that $gcd(a, b) = 1$. Sequence $\{u_k\}$, is given such that $u_0 = 0$, $u_1 = 1$, and u$_{k+2} = au_{k+1} + bu_k$ for all $k \ge 0$. Let $m$ be the least positive integer such that $c | u_m$ and $n$ be an arbitrary positive integer such that $c | u_n$. Show that $m | n$.
[hide=PS.] There was a typo in the last line, as it didn't define what n does. Wording comes from [b]tst-2011-1.pdf[/b] from [url=https://sites.google.com/site/imoidn/idntst/2011tst]here[/url]. Correction was made according to #2[/hide]
$p > 3$ is a prime number such that $p|2^{p-1} - 1$ and $p \nmid 2^x - 1$ for $x = 1, 2,...,p-2$. Let $p = 2k + 3$. Now we define sequence $\{a_n\}$ as $$a_i = a_{i+k} = 2^i \,\, (1 \le i \le k ), \,\,\,\, a_{j+2k} = a_ja_{j+k} \,\, (j \le 1)$$
Prove that there exist $2k$ consecutive terms of sequence $a_{x+1},a_{x+2},..., a_{x+2k}$ such that $a_{x+i } \not\equiv a_{x+j}$ (mod $p$) for all $1 \le i < j \le 2k$ .
[b]a)[/b] Let $ \left( x_n \right)_{n\ge 1} $ be a sequence of real numbers having the property that $ \left| x_{n+1} -x_n \right|\leqslant 1/2^n, $ for any $ n\geqslant 1. $
Show that $ \left( x_n \right)_{n\ge 1} $ is convergent.
[b]b)[/b] Create a sequence $ \left( y_n \right)_{n\ge 1} $ of real numbers that has the following properties:
$ \text{(i) } \lim_{n\to\infty } \left( y_{n+1} -y_n \right) = 0 $
$ \text{(ii) } $ is bounded
$ \text{(iii) } $ is divergent
[i]Eugen Popa[/i]
A circle $K_1$ of radius $r_1 = 1\slash 2$ is inscribed in a semi-circle $H$ with diameter $AB$ and radius $1.$ A sequence of different circles $K_2, K_3, \ldots$ with radii $r_2, r_3, \ldots$ respectively are drawn so that for each $n\geq 1$, the circle $K_{n+1}$ is tangent to $H$, $K_n$ and $AB.$ Prove that $a_n = 1\slash r_n$ is an integer for each $n$, and that it is a perfect square for $n$ even and twice a perfect square for $n$ odd.
Let $a, b$, and $c$ be positive integers such that $gcd(a, b) = 1$. Sequence $\{u_k\}$, is given such that $u_0 = 0$, $u_1 = 1$, and u$_{k+2} = au_{k+1} + bu_k$ for all $k \ge 0$. Let $m$ be the least positive integer such that $c | u_m$ and $n$ be an arbitrary positive integer such that $c | u_n$. Show that $m | n$.
[hide=PS.] There was a typo in the last line, as it didn't define what n does. Wording comes from [b]tst-2011-1.pdf[/b] from [url=https://sites.google.com/site/imoidn/idntst/2011tst]here[/url]. Correction was made according to #2[/hide]
Let be a surjective function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ that has the property that if the sequence $ \left( f\left( x_n \right) \right)_{n\ge 1} $ is convergent, then the sequence $ \left( x_n \right)_{n\ge 1} $ is convergent. Prove that it is continuous.
Let ${a_n}$ be a non-increasing sequence of positive numbers. Prove that if for $n \ge 2001$, $na_{n} \le 1$, then for any positive integer $m \ge 2001$ and $x \in \mathbb{R}$, the following inequality holds:
$\left | \sum_{k=2001}^{m} a_{k} \sin kx \right | \le 1 + \pi$
Suppose that $ n \geq 2$ and $ x_1, x_2, \ldots, x_n$ are real numbers between 0 and 1 (inclusive). Prove that for some index $ i$ between $ 1$ and $ n \minus{} 1$ the
inequality
\[ x_i (1 \minus{} x_{i\plus{}1}) \geq \frac{1}{4} x_1 (1 \minus{} x_{n})\]
The sequence of integers $ a_1 $, $ a_2 $, $ \dots $ is defined as follows:
$ a_1 = 1 $ and $ n> 1 $, $ a_ {n + 1} $ is the smallest integer greater than $ a_n $ and such, that $ a_i + a_j \neq 3a_k $ for any $ i, j $ and $ k $ from $ \{1, 2, \dots, n + 1 \} $ are not necessarily different.
Define $ a_ {2004} $.
For a positive integer $n$, let $y_n$ be the number of $n$-digit positive integers containing only the digits $2,3,5, 7$ and which do not have a $5$ directly to the right of a $2.$ If $r\geq 1$ and $m\geq 2$ are integers, prove that $y_{m-1}$ divides $y_{rm-1}.$
Let $x_0, x_1, x_2 \dots$ be a sequence of positive real numbers such that for all $n \geq 0$, $$x_{n+1} = \dfrac{(n^2+1)x_n^2}{x_n^3+n^2}$$ For which values of $x_0$ is this sequence bounded?
Given a sequence $\{x_k\}$ such that $x_1 = 1$, $x_{n+1} = n \sin x_n+ 1$. Prove that the sequence is non-periodic.
Let $x_n$ the sequence defined by any nonnegatine integer $x_0$ and $x_{n+1}=1+\prod_{0 \leq i \leq n}{x_i}$
Show that there exists prime $p$ such that $p\not|x_n$ for any $n$.
Find the number of sequences $a_1,a_2,\dots,a_{100}$ such that
$\text{(i)}$ There exists $i\in\{1,2,\dots,100\}$ such that $a_i=3$, and
$\text{(ii)}$ $|a_i-a_{i+1}|\leq 1$ for all $1\leq i<100$.
Given the sequence $(t_n)$ defined as $t_0 = 0$, $t_1 = 6$, $t_{n + 2} = 14t_{n + 1} - t_n$.
Prove that for every number $n \ge 1$, $t_n$ is the area of a triangle whose lengths are all numbers integers.
Dang Hung Thang, University of Natural Sciences, Hanoi National University.
$\{a_{n}\}$ is a sequence of natural numbers satisfying the following inequality for all natural number $n$:
$$(a_{1}+\cdots+a_{n})\left(\frac{1}{a_{1}}+\cdots+\frac{1}{a_{n}}\right)\le{n^{2}}+2019$$
Prove that $\{a_{n}\}$ is constant.
Let $n$ be a positive integer.
Consider sequences $a_0, a_1, ..., a_k$ and $b_0, b_1,,..,b_k$ such that $a_0 = b_0 = 1$ and $a_k = b_k = n$ and such that for all $i$ such that $1 \le i \le k $, we have that $(a_i, b_i)$ is either equal to $(1 + a_{i-1}, b_{i-1})$ or $(a_{i-1}; 1 + b_{i-1})$.
Consider for $1 \le i \le k$ the number $c_i = \begin{cases} a_i \,\,\, if \,\,\, a_i = a_{i-1} \\
b_i \,\,\, if \,\,\, b_i = b_{i-1}\end{cases}$
Show that $c_1 + c_2 + ... + c_k = n^2 - 1$.
The sequence $a_0,a_1,a_2,\dots$ is recursively defined by \[ a_0 = 1 \quad \text{and} \quad a_n = a_{n-1} \cdot \left(4-\frac{2}{n} \right) \quad \text{for } n \geq 1. \] Prove for each integer $n \geq 1$:
(a) The number $a_n$ is a positive integer.
(b) Each prime $p$ with $n < p \leq 2n$ is a divisor of $a_n$.
(c) If $n$ is a prime, then $a_n-2$ is divisible by $n$.
A natural number is called a [i]prime power[/i] if that number can be expressed as $p^n$ for some prime $p$ and natural number $n$.
Determine the largest possible $n$ such that there exists a sequence of prime powers $a_1, a_2, \dots, a_n$ such that $a_i = a_{i - 1} + a_{i - 2}$ for all $3 \le i \le n$.
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$.
Let \(n\) be a non-negative integer and define \(a_n = 2^n - n\). Determine all non-negative integers \(m\) such that \(s_m = a_0 + a_1 + \dots + a_m\) is a power of 2.
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]
The positive sequence $\{a_n\}$ satisfies:$a_1=1$ and $$a_n=2+\sqrt{a_{n-1}}-2 \sqrt{1+\sqrt{a_{n-1}}}(n\geq 2)$$
Let $S_n=\sum\limits_{k=1}^{n}{2^ka_k}$. Find the value of $S_{2023}$.
Consider the set of all strictly decreasing sequences of $n$ natural numbers having the property that in each sequence no term divides any other term of the sequence. Let $A = (a_j)$ and $B = (b_j)$ be any two such sequences. We say that $A$ precedes $B$ if for some $k$, $a_k < b_k$ and $a_i = b_i$ for $i < k$. Find the terms of the first sequence of the set under this ordering.