Found problems: 5923
Let $\{fn\}$ be the Fibonacci sequence $\{1, 1, 2, 3, 5, \dots.\}. $
(a) Find all pairs $(a, b)$ of real numbers such that for each $n$, $af_n +bf_{n+1}$ is a member of the sequence.
(b) Find all pairs $(u, v)$ of positive real numbers such that for each $n$, $uf_n^2 +vf_{n+1}^2$ is a member of the sequence.
Find all integer sequences $a_1 , a_2 , \ldots , a_{2024}$ such that $1\le a_i \le 2024$ for $1\le i\le 2024$ and
$$i+j|ia_i-ja_j$$
for each pair $1\le i,j \le 2024$.
A finite sequence of three-digit integers has the property that the tens and units digits of each terms are, respectively, the hundreds and tens digits of the next term, and the tens and units digits of the last term are, respectively, the hundreds and tens digits of the first term. For example, such a sequence might begin with terms $ 247$, $ 475$, and $ 756$ and end with the term $ 824$. Let $ S$ be the sum of all the terms in the sequence. What is the largest prime number that always divides $ S$?
$ \textbf{(A)}\ 3 \qquad \textbf{(B)}\ 7 \qquad \textbf{(C)}\ 13 \qquad \textbf{(D)}\ 37 \qquad \textbf{(E)}\ 43$
In the non-decreasing sequence of odd integers $\{a_1,a_2,a_3,\ldots \}=\{1,3,3,3,5,5,5,5,5,\ldots \}$ each odd positive integer $k$ appears $k$ times. It is a fact that there are integers $b$, $c$, and $d$ such that for all positive integers $n$,
\[ a_n=b\lfloor \sqrt{n+c} \rfloor +d, \]
where $\lfloor x \rfloor$ denotes the largest integer not exceeding $x$. The sum $b+c+d$ equals
$\text{(A)} \ 0 \qquad \text{(B)} \ 1 \qquad \text{(C)} \ 2 \qquad \text{(D)} \ 3 \qquad \text{(E)} \ 4$
A permutation of a set is a bijection from the set to itself. For example, if $\sigma$ is the permutation $1 7\mapsto 3$, $2 \mapsto 1$, and $3 \mapsto 2$, and we apply it to the ordered triplet $(1, 2, 3)$, we get the reordered triplet $(3, 1, 2)$. Let $\sigma$ be a permutation of the set $\{1, ... , n\}$. Let
$$\theta_k(m) = \begin{cases} m + 1 & \text{for} \,\, m < k\\
1 & \text{for} \,\, m = k\\
m & \text{for} \,\, m > k\end{cases}$$
Call a finite sequence $\{a_i\}^{j}_{i=1}$ a disentanglement of $\sigma$ if $\theta_{a_j} \circ ...\circ \theta_{a_j} \circ \sigma$ is the identity permutation. For example, when $\sigma = (3, 2, 1)$, then $\{2, 3\}$ is a disentaglement of $\sigma$. Let $f(\sigma)$ denote the minimum number $k$ such that there is a disentanglement of $\sigma$ of length $k$. Let $g(n)$ be the expected value for $f(\sigma)$ if $\sigma$ is a random permutation of $\{1, ... , n\}$. What is $g(6)$?
Let $(P_n(X))_{n\in\mathbb{N}}$ be a sequence of polynomials defined as: $P_1(X)=X-1, P_2(X)=X^2-X-1, P_n(X)=XP_{n-1}(X)-P_{n-2}(X), \forall n>2$. For every nonnegative integer $n{}$ find all roots of the polynomial $P_n(X)$.
Let $ \left(x_{n}\right)$ be a real sequence satisfying $ x_{0}=0$, $ x_{2}=\sqrt[3]{2}x_{1}$, and $ x_{n+1}=\frac{1}{\sqrt[3]{4}}x_{n}+\sqrt[3]{4}x_{n-1}+\frac{1}{2}x_{n-2}$ for every integer $ n\geq 2$, and such that $ x_{3}$ is a positive integer. Find the minimal number of integers belonging to this sequence.
Choose arbitrarily $n$ vertices of a regular $2n-$gon and colour them red. The remaining vertices are coloured blue. We arrange all red-red distances into a nondecreasing sequence and do the same with the blue-blue distances. Prove that the two sequences thus obtained are identical.
A $\textit{cubic sequence}$ is a sequence of integers given by $a_n =n^3 + bn^2 + cn + d$, where $b, c$ and $d$ are integer constants and $n$ ranges over all integers, including negative integers.
$\textbf{(a)}$ Show that there exists a cubic sequence such that the only terms
of the sequence which are squares of integers are $a_{2015}$ and $a_{2016}$.
$\textbf{(b)}$ Determine the possible values of $a_{2015} \cdot a_{2016}$ for a cubic sequence
satisfying the condition in part $\textbf{(a)}$.
The set $G$ is defined by the points $(x,y)$ with integer coordinates, $1 \le x \le 5$ and $1 \le y \le 5$. Determine the number of five-point sequences $(P_1, P_2, P_3, P_4, P_5)$ such that for $1 \le i \le 5$, $P_i = (x_i,i)$ is in $G$ and $|x_1 - x_2| = |x_2 - x_3| = |x_3 - x_4|=|x_4 - x_5| = 1$.
Suppose that $a_{ij}$ are real numbers in such a way that for each $i$, the series $\sum_{j=1}^{\infty}a_{ij}$ is absolutely convergent. In fact we have a series of absolutely convergent serieses. Also we know that for each bounded sequence $\{b_j\}_j$ we have $\lim_{i\to \infty} \sum_{j=1}^{\infty}a_{ij}b_j=0$. Prove that
$\lim_{i\to \infty}\sum_{j=1}^{\infty}|a_{ij}|=0$.
Let $f: \mathbb{N} \rightarrow \mathbb{N}$ be a function, and let $f^m$ be $f$ applied $m$ times. Suppose that for every $n \in \mathbb{N}$ there exists a $k \in \mathbb{N}$ such that $f^{2k}(n)=n+k$, and let $k_n$ be the smallest such $k$. Prove that the sequence $k_1,k_2,\ldots $ is unbounded.
[i]Proposed by Palmer Mebane, United States[/i]
Let be two sequences $ \left( a_n \right)_{n\ge 0} , \left( b_n \right)_{n\ge 0} $ satisfying the following system:
$$ \left\{ \begin{matrix} a_0>0,& \quad a_{n+1} =a_ne^{-a_n} , &\quad\forall n\ge 0 \\ b_{0}\in (0,1) ,& \quad b_{n+1} =b_n\cos \sqrt{b_n} ,& \quad\forall n\ge 0 \end{matrix} \right. $$
Calculate $ \lim_{n\to\infty} \frac{a_n}{b_n} . $
[i]Florian Dumitrel[/i]
Define the sequence of positive prime numbers. $p_1,p_2,p_3,...$. Let set $A$ be the infinite set of positive integers whose prime divisor does not exceed $p_n$. How many at least members must be selected from the set $A$ , such that we ensures that there are $2$ numbers whose products are perfect squares?
[i](PP-nine)[/i]
Define the function $f:\mathbb N_{>1}\to\mathbb N_{>1}$ such that $f(x)$ is the greatest prime factor of $x$. A sequence of positive integers $\{a_n\}$ satisfies $a_1=M>1$ and
$$a_{n+1}=\begin{cases}a_n-f(a_n)&\text{if }a_n\text{ is composite.}\\a_n+k&\text{otherwise.}\end{cases}$$
Show that for any positive integers $M,k$, the sequence $\{a_n\}$ is bounded.
(TAN768092100853)
Suppose $x_1,x_2,x_3,\dotsc$ is a strictly decreasing sequence of positive real numbers such that the series $x_1+x_2+x_3+\cdots$ diverges.
Is it necessary true that the series $\sum_{n=2}^{\infty}{\min \left\{ x_n,\frac{1}{n\log (n)}\right\} }$ diverges?
A pupil is writing on a board positive integers $x_0,x_1,x_2,x_3...$ after the following algorithm which implies arithmetic progression $3,5,7,9...$.Each term of rank $k\ge2$ is a difference between the product of the last number on the board and the term of arithmetic progression of rank $k$ and the last but one term on the bord with the sum of the terms of the arithemtic progression with ranks less than $k$.If $x_0=0 $ and $x_1=1$ find $x_n$ according to n.
The Fibonacci sequence $f_1,f_2,f_3,\dots$ is defined by $f_1=f_2=1$, $f_{n+2}=f_{n+1}+f_n$. Find all $n$ such that $f_n = n^2$.
Which of the followings is false for the sequence $9,99,999,\dots$?
$\textbf{(A)}$ The primes which do not divide any term of the sequence are finite.
$\textbf{(B)}$ Infinitely many primes divide infinitely many terms of the sequence.
$\textbf{(C)}$ For every positive integer $n$, there is a term which is divisible by at least $n$ distinct prime numbers.
$\textbf{(D)}$ There is an inteter $n$ such that every prime number greater than $n$ divides infinitely many terms of the sequence.
$\textbf{(E)}$ None of above
Let $\left \{ c_i \right \}_{i=0}^{\infty}$ be a sequence of non-negative real numbers with $c_{2017}>0$. A sequence of polynomials is defined as
$$P_{-1}(x)=0 \ , \ P_0(x)=1 \ , \ P_{n+1}(x)=xP_n(x)+c_nP_{n-1}(x).$$
Prove that there doesn't exist any integer $n>2017$ and some real number $c$ such that
$$P_{2n}(x)=P_n(x^2+c).$$
[i]Proposed by Navid Safaei[/i]
Determine all positive integers $M$ such that the sequence $a_0, a_1, a_2, \cdots$ defined by \[ a_0 = M + \frac{1}{2} \qquad \textrm{and} \qquad a_{k+1} = a_k\lfloor a_k \rfloor \quad \textrm{for} \, k = 0, 1, 2, \cdots \] contains at least one integer term.
$a)$ Let $m$ and $n$ be positive integers. If $m>1$ prove that $ n \mid \phi(m^n-1)$ where $\phi$ is Euler function
$b)$ Prove that number of elements in sequence $1,2,...,n$ $(n \in \mathbb{N})$, which greatest common divisor with $n$ is $d$, is $\phi\left(\frac{n}{d}\right)$
We define a sequence $a_n$ so that $a_0=1$ and
\[a_{n+1} = \begin{cases} \displaystyle \frac{a_n}2 & \textrm { if } a_n \equiv 0 \pmod 2, \\ a_n + d & \textrm{ otherwise. } \end{cases} \]
for all postive integers $n$.
Find all positive integers $d$ such that there is some positive integer $i$ for which $a_i=1$.
Consider a sequence whose first term is a given positive integer \( N > 1 \). Consider the prime factorization of \( N \). If \( N \) is a power of 2, the sequence consists of a single term: \( N \). Otherwise, the second term of the sequence is obtained by replacing the largest prime factor \( p \) of \( N \) with \( p + 1 \) in the prime factorization. If the new number is not a power of 2, we repeat the same procedure with it, remembering to factor it again into primes. If it is a power of 2, the numerical sequence ends. And so on.
For example, if the first term of the sequence is \( N = 300 = 2^2 \cdot 3 \cdot 5^2 \), since its largest prime factor is \( p = 5 \), the second term is \( 2^2 \cdot 3 \cdot (5 + 1)^2 = 2^4 \cdot 3^3 \). Repeating the procedure, the largest prime factor of the second term is \( p = 3 \), so the third term is \( 2^4 \cdot (3 + 1)^3 = 2^{10} \). Since we obtained a power of 2, the sequence has 3 terms: \( 2^2 \cdot 3 \cdot 5^2 \), \( 2^4 \cdot 3^3 \), and \( 2^{10} \).
a) How many terms does the sequence have if the first term is \( N = 2 \cdot 3 \cdot 5 \cdot 7 \cdot 11 \cdot 13 \cdot 17 \cdot 19 \cdot 23 \)?
b) Show that if a prime factor \( p \) leaves a remainder of 1 when divided by 3, then \( \frac{p+1}{2} \) is an integer that also leaves a remainder of 1 when divided by 3.
c) Present an initial term \( N \) less than 1,000,000 (one million) such that the sequence starting from \( N \) has exactly 11 terms.
Let $(a_n)_{n\ge 1}$ and $(b_n)_{n\ge 1}$ be two sequences of natural numbers such that $a_{n+1} = na_n + 1, b_{n+1} = nb_n - 1$ for every $n\ge 1$. Show that these two sequences can have only a finite number of terms in common.