Found problems: 5923
In the sequence of digits $2,0,2,9,3,...$ any digit it equal to the last digit in the decimal representation of the sum of four previous digits. Do the four numbers $2,0,1,5$ in that order occur in the sequence?
Folklore
Find all infinite integer sequences $a_1,a_2,\ldots$ satisfying
\[a_{n+2}^{a_{n+1}}=a_{n+1}+a_n\] holds for all $n\geq 1$. Define $0^0=1$
The sequence $\{a_n\}_{n\geq 0}$ of real numbers satisfies the relation:
\[ a_{m+n} + a_{m-n} - m + n -1 = \frac12 (a_{2m} + a_{2n}) \]
for all non-negative integers $m$ and $n$, $m \ge n$. If $a_1 = 3$ find $a_{2004}$.
Suppose that the sequence $\{a_n\}$ satisfy $a_1=1$ and $a_{2k}=a_{2k-1}+a_k, \quad a_{2k+1}=a_{2k}$ for $k=1,2, \ldots$ \\Prove that $a_{2^n}< 2^{\frac{n^2}{2}}$ for any integer $n \geq 3$.
Let $\{a_n\}_{n\geq 0}$ be a non-decreasing, unbounded sequence of non-negative integers with $a_0=0$. Let the number of members of the sequence not exceeding $n$ be $b_n$. Prove that \[ (a_0 + a_1 + \cdots + a_m)( b_0 + b_1 + \cdots + b_n ) \geq (m + 1)(n + 1). \]
For a polynomial $ P(x)$ with integer coefficients, $ r(2i \minus{} 1)$ (for $ i \equal{} 1,2,3,\ldots,512$) is the remainder obtained when $ P(2i \minus{} 1)$ is divided by $ 1024$. The sequence
\[ (r(1),r(3),\ldots,r(1023))
\]
is called the [i]remainder sequence[/i] of $ P(x)$. A remainder sequence is called [i]complete[/i] if it is a permutation of $ (1,3,5,\ldots,1023)$. Prove that there are no more than $ 2^{35}$ different complete remainder sequences.
Let $c>2$ and $a_0,a_1, \ldots$ be a sequence of real numbers such that
\begin{align*} a_n = a_{n-1}^2 - a_{n-1} < \frac{1}{\sqrt{cn}} \end{align*}
for any $n$ $\in$ $\mathbb{N}$. Prove, $a_1=0$
Given is the sequence $(a_n)_{n\geq 0}$ which is defined as follows:$a_0=3$ and $a_{n+1}-a_n=n(a_n-1) \ , \ \forall n\geq 0$.
Determine all positive integers $m$ such that $\gcd (m,a_n)=1 \ , \ \forall n\geq 0$.
Positive sequences $\{a_n\},\{b_n\}$ satisfy:$a_1=b_1=1,b_n=a_nb_{n-1}-\frac{1}{4}(n\geq 2)$.
Find the minimum value of $4\sqrt{b_1b_2\cdots b_m}+\sum_{k=1}^m\frac{1}{a_1a_2\cdots a_k}$,where $m$ is a given positive integer.
Prove that for every $n \in N$ there exists exactly one sequence of $2n + 1$ consecutive numbers, such that the sum of the squares of the first $n+1$ numbers is equal to the sum of the squares of the last $n$ numbers. Also express the smallest number of that sequence in terms of $n$.
Is there sequence $(a_n)$ of natural numbers, such that differences $\{a_{n+1}-a_n\}$ take every natural value and only one time and differences $\{a_{n+2}-a_n\}$ take every natural value greater $2015$ and only one time ?
[i]A. Golovanov[/i]
Let $\{a_n\}_{n=1}^{\infty}$ be a sequence of positive integers for which
\[ a_{n+2} = \left[\frac{2a_n}{a_{n+1}}\right]+\left[\frac{2a_{n+1}}{a_n}\right]. \]
Prove that there exists a positive integer $m$ such that $a_m=4$ and $a_{m+1} \in\{3,4\}$.
[b]Note.[/b] $[x]$ is the greatest integer not exceeding $x$.
The sequence $a_1,a_2,\dots$ of positive integers obeys the following two conditions:
[list]
[*] For all positive integers $m,n$, it happens that $a_m\cdot a_n=a_{mn}$
[*] There exist infinite positive integers $n$ such that $(a_1,a_2,\dots,a_n)$ is a permutation of $(1,2,\dots,n)$
[/list]
Prove that $a_n=n$ for all positive integers $n$.
[i]Proposed by José Alejandro Reyes González[/i]
A sequence $ \left( x_n\right)_{n\ge 0} $ of real numbers satisfies $ x_0>1=x_{n+1}\left( x_n-\left\lfloor x_n\right\rfloor\right) , $ for each $ n\ge 1. $
Prove that if $ \left( x_n\right)_{n\ge 0} $ is periodic, then $ x_0 $ is a root of a quadratic equation. Study the converse.
Compute the sum of the squares of the first $100$ terms of an arithmetic progression, given that their sum is $-1$ and that the sum of those among them having an even index is $1$.
Let $b$ be an odd positive integer. The sequence $a_1, a_2, a_3, a_4$, is definedin the next way: $a_1$ and $a_2$ are positive integers and for all $k \ge 2$,
$$a_{k+1}= \begin{cases} \frac{a_k + a_{k-1}}{2} \,\,\, if \,\,\, a_k + a_{k-1} \,\,\, is \,\,\, even \\ \frac{a_k + a_{k-1+b}}{2}\,\,\, if \,\,\, a_k + a_{k-1}\,\,\, is \,\,\,odd\end{cases}$$
a) Prove that if $b = 1$, then after a certain term, the sequence will become constant.
b) For each $b \ge 3$ (odd), prove that there exist values of $a_1$ and $a_2$ for which the sequence will become constant after a certain term.
Let $A = (a_1, a_2, \cdots ,a_{2000})$ be a sequence of integers each lying in the interval $[-1000,1000]$. Suppose that the entries in A sum to $1$. Show that some nonempty subsequence of $A$ sums to zero.
Let $a_1, a_2, ...$ a sequence of integers such that for every $n \in N$ we have:
$$\sum_{d | n} a_d = 2^n.$$
Show for every $n \in N$ that $n$ divides $a_n$.
Remark: For $n = 6$ the equation is $a_1 + a_2 + a_3 + a_6 = 2^6.$
Each girl among $100$ girls has $100$ balls; there are in total $10000$ balls in $100$ colors, from each color there are $100$ balls. On a move, two girls can exchange a ball (the first gives the second one of her balls, and vice versa). The operations can be made in such a way, that in the end, each girl has $100$ balls, colored in the $100$ distinct colors. Prove that there is a sequence of operations, in which each ball is exchanged no more than 1 time, and at the end, each girl has $100$ balls, colored in the $100$ colors.
Does there exist a a sequence $a_{0},a_{1},a_{2},\dots$ in $\mathbb N$, such that for each $i\neq j, (a_{i},a_{j})=1$, and for each $n$, the polynomial $\sum_{i=0}^{n}a_{i}x^{i}$ is irreducible in $\mathbb Z[x]$?
[i]By Omid Hatami[/i]
Let $(a_n)_{n \ge 1}$ be a sequence of real numbers satisfying the properties: [list=1]
[*] the sequence $x_n=\sum\limits_{k=1}^n a_k^2$ is convergent;
[*] the sequence $y_n=\sum\limits_{k=1}^n a_k$ is unbounded.
[/list]
Prove that the sequence $(b_n)_{n \ge 1}$ given by $b_n=\{y_n\}$ is divergent.
Note: $\{ x \}$ denotes the fractional part of $x.$
Let $x>1$ be a real number which is not an integer. For each $n\in\mathbb{N}$, let $a_n=\lfloor x^{n+1}\rfloor - x\lfloor x^n\rfloor$. Prove that the sequence $(a_n)$ is not periodic.
A [i]labyrinth[/i] is a system of $2024$ caves and $2023$ non-intersecting (bidirectional) corridors, each of which connects exactly two caves, where each pair of caves is connected through some sequence of corridors. Initially, Erik is standing in a corridor connecting some two caves. In a move, he can walk through one of the caves to another corridor that connects that cave to a third cave. However, when doing so, the corridor he was just in will magically disappear and get replaced by a new one connecting the end of his new corridor to the beginning of his old one (i.e., if Erik was in a corridor connecting caves $a$ and $b$ and he walked through cave $b$ into a corridor that connects caves $b$ and $c$, then the corridor between caves $a$ and $b$ will disappear and a new corridor between caves $a$ and $c$ will appear).
Since Erik likes designing labyrinths and has a specific layout in mind for his next one, he is wondering whether he can transform the labyrinth into that layout using these moves. Prove that this is in fact possible, regardless of the original layout and his starting position there.
Suppose that $a_1,...,a_{15}$ are prime numbers forming an arithmetic progression with common difference $d > 0$ if $a_1 > 15$ show that $d > 30000$
[b]2.[/b] Show that the series
$\sum_{n=1}^{\infty}\frac{1}{n}sin(asin(\frac{2n\pi}{N}))e^{bcos(\frac{2n\pi}{N})}$
is convergent for every positive integer N and any real numbers a and b. [b](S. 25)[/b]