Found problems: 1239
Let $(a_n)_{n\geq 0}$ be a sequence defined by $a_0\geq 0$ and the recurrence relation $$a_{n+1}=\frac{a_n^2-1}{n+1},$$ for all $n\geq 0$. Prove that here exists a real number $a> 0$ such that:
[list]
[*] if $a_0\geq a,$ $\lim_{n\rightarrow\infty}a_n = \infty$;
[*] if $a_0\in [0,a),$ $\lim_{n\rightarrow\infty}a_n = 0$.
We are given the sequence $a_1,a_2,a_3,\ldots$, for which:
$$a_n=\frac{a^2_{n-1}+c}{a_{n-2}}\enspace\text{for all }n>2.$$
Prove that the numbers $a_1$, $a_2$ and $\frac{a_1^2+a_2^2+c}{a_1a_2}$ are whole numbers.
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$.
Let $p$ be an odd prime number and suppose that $2^h \not \equiv 1 \text{ (mod } p\text{)}$ for all integer $1 \leq h \leq p-2$. Let $a$ be an even number such that $\frac{p}{2} < a < p$. Define the sequence $a_0, a_1, a_2, \ldots$ as $$a_0 = a, \qquad a_{n+1} = p -b_n, \qquad n = 0,1,2, \ldots,$$ where $b_n$ is the greatest odd divisor of $a_n$. Show that the sequence is periodic and determine its period.
Find all positive integers $n$ and sequence of integers $a_0,a_1,\ldots, a_n$ such that the following hold:
1. $a_n\neq 0$;
2. $f(a_{i-1})=a_i$ for all $i=1,\ldots, n$, where $f(x) = a_nx^n+a_{n-1}x^{n-1}+\cdots +a_0$.
[i]
Proposed by usjl[/i]
Let $n$ be a positive integer, and define $f(n)=1!+2!+\ldots+n!$. Find polynomials $P$ and $Q$ such that
$$f(n+2)=P(n)f(n+1)+Q(n)f(n)$$for all $n\ge1$.
The infinite sequence \( a_1, a_2, \ldots \) is defined by \( a_1 = 1 \) and, for each \( n \geq 1 \), the number \( a_{n+1} \) is the smallest positive integer greater than \( a_n \) that has the following property: for each \( k \in \{1, 2, \ldots, n\} \), the number \( a_{n+1} + a_k \) is not a perfect square. Prove that, for all \( n \), it holds that \( a_n \leq (n - 1)^2 + 1 \).
Let $L_1=1$, $L_2=3$, and $L_{n+2}=L_{n+1}+L_n$ for $n\geq1$. How many terms in the sequence $L_1, L_2, L_3, \dots, L_{2023}$ are even?
$\textbf{(A) }673\qquad\textbf{(B) }1011\qquad\textbf{(C) }675\qquad\textbf{(D) }1010\qquad\textbf{(E) }674$
(a) Prove that for every natural number $k$, there are positive integers $a_1<a_2<\ldots <a_k$ such that $a_i-a_j$ divides $a_i$ for all $1\leq i, j\leq k, i\neq j$.
(b) Show that there is an absolute constant $C>0$ such that $a_1>k^{Ck}$ for every sequence $a_1,\ldots, a_k$ of numbers that satisfy the above divisibility condition.
[A. Balogh, I. Z. Ruzsa]
Define the sequences $(a_n),(b_n)$ by
\begin{align*}
& a_n, b_n > 0, \forall n\in\mathbb{N_+} \\
& a_{n+1} = a_n - \frac{1}{1+\sum_{i=1}^n\frac{1}{a_i}} \\
& b_{n+1} = b_n + \frac{1}{1+\sum_{i=1}^n\frac{1}{b_i}}
\end{align*}
1) If $a_{100}b_{100} = a_{101}b_{101}$, find the value of $a_1-b_1$;
2) If $a_{100} = b_{99}$, determine which is larger between $a_{100}+b_{100}$ and $a_{101}+b_{101}$.
Consider the sequence of rational numbers defined by $x_1=\frac{4}{3}$, and $x_{n+1}=\frac{x_n^2}{x_n^2-x_n+1}$. Show that the nu,erator of the lowest term expression of each sum $x_1+x_2+...+x_k$ is a perfect square.
Let $(a_n)_{n\geq 1}$ be a sequence of positive real numbers with the property that
$$(a_{n+1})^2 + a_na_{n+2} \leq a_n + a_{n+2}$$
for all positive integers $n$. Show that $a_{2022}\leq 1$.
The sequence $ \{x_{n}\}$ is defined by $ x_{1} \equal{} 2,x_{2} \equal{} 12$, and $ x_{n \plus{} 2} \equal{} 6x_{n \plus{} 1} \minus{} x_{n}$, $ (n \equal{} 1,2,\ldots)$. Let $ p$ be an odd prime number, let $ q$ be a prime divisor of $ x_{p}$. Prove that if $ q\neq2,3,$ then $ q\geq 2p \minus{} 1$.
Let $\{a_n\}$ be a monotonically decreasing sequence of positive real numbers with limit $0$. Let $\{b_n\}$ be a rearrangement of the sequence such that for every non-negative integer $m$, the terms $b_{3m+1}$, $b_{3m+2}$, $b_{3m+3}$ are a rearrangement of the terms $a_{3m+1}$, $a_{3m+2}$, $a_{3m+3}$. Prove or give a counterexample to the following statement: the series $\sum_{n=1}^\infty(-1)^nb_n$ is convergent.
Let $(a_n)_{n\geq 1}$ be a (not necessarily strictly) increasing sequence of positive integers, such that $a_n \leq 1000n^{0.999}$ for every positive integer $n$. Prove that there exist infinitely many positive integers $n$ for which $a_n$ divides $n$.
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.$
Find all functions $f:(0,\infty)\to(0,\infty)$ such that
$$f(f(f(x)))+4f(f(x))+f(x)=6x.$$
(a) Does there exist an infinite sequence of real numbers such that the sum of every ten successive numbers is positive, while for every $n$ the sum of the first $10n + 1$ successive numbers is negative?
(b) Does there exist an infinite sequence of integers with the same properties?
(AK Tolpygo)
Let $F(n)$ be the set of polynomials $P(x) = a_0+a_1x+\cdots+a_nx^n$, with $a_0, a_1, . . . , a_n \in \mathbb R$ and $0 \leq a_0 = a_n \leq a_1 = a_{n-1 } \leq \cdots \leq a_{[n/2] }= a_{[(n+1)/2]}.$ Prove that if $f \in F(m)$ and $g \in F(n)$, then $fg \in F(m + n).$
Show that there is an infinite sequence $a_1,a_2,...$ of natural numbers such that $a^2_1+a^2_2+ ...+a^2_N$ is a perfect square for all $N$. Give a recurrent formula for one such sequence.
Given $7$ distinct positive integers, prove that there is an infinite arithmetic progression of positive integers $a, a + d, a + 2d,..$ with $a < d$, that contains exactly $3$ or $4$ of the $7$ given integers.
Given the sequence
$f_1(a)=sin(0,5\pi a)$
$f_2(a)=sin(0,5\pi (sin(0,5\pi a)))$
$...$
$f_n(a)=sin(0,5\pi (sin(...(sin(0,5\pi a))...)))$ , where $a$ is any real number.
What limit aspire the members of this sequence as $n \to \infty$?
Let $\sum_{n=1}^\infty a_n$ be a divergent series with positive nonincreasing terms. Prove that the series
$$\sum_{n=1}^\infty\frac{a_n}{1+na_n}$$diverges.
Define Fibonacci sequence $\{F\}_{n=0}^{\infty}$ as $F_0 = 0, F_1 = 1$ and $F_{n+1} = F_n +F_{n-1}$ for every integer $n > 1$. Determine all quadruples $(a, b, c,n)$ of positive integers with a $< b < c$ such that each of $a, b,c,a + n, b + n,c + 2n$ is a term of the Fibonacci sequence.
There is no sequence $x_n$ strictly increasing with terms natural numbers such that : $$ x_n+x_{k}=x_{nk}, \ \ for \, any \,\,\, n, k \in \mathbb{N}^*$$