Found problems: 89
A $\pm 1$-[i]sequence[/i] is a sequence of $2022$ numbers $a_1, \ldots, a_{2022},$ each equal to either $+1$ or $-1$. Determine the largest $C$ so that, for any $\pm 1$-sequence, there exists an integer $k$ and indices $1 \le t_1 < \ldots < t_k \le 2022$ so that $t_{i+1} - t_i \le 2$ for all $i$, and $$\left| \sum_{i = 1}^{k} a_{t_i} \right| \ge C.$$
Let $ a_1 \equal{} 11^{11}, \, a_2 \equal{} 12^{12}, \, a_3 \equal{} 13^{13}$, and $ a_n \equal{} |a_{n \minus{} 1} \minus{} a_{n \minus{} 2}| \plus{} |a_{n \minus{} 2} \minus{} a_{n \minus{} 3}|, n \geq 4.$ Determine $ a_{14^{14}}$.
For an infinite sequence $a_1<a_2<a_3<...$ of positive integers we say that it is [i]nice[/i] if for every positive integer $n$ holds $a_{2n}=2a_n$. Prove the following statements:
$a)$ If there is given a [i]nice[/i] sequence and prime number $p>a_1$, there exist some term of the sequence which is divisible by $p$.
$b)$ For every prime number $p>2$, there exist a [i]nice[/i] sequence such that no terms of the sequence are divisible by $p$.
Define the sequence $ a_1, a_2, a_3, ...$ as follows. $ a_1$ and $ a_2$ are coprime positive integers and $ a_{n \plus{} 2} \equal{} a_{n \plus{} 1}a_n \plus{} 1$. Show that for every $ m > 1$ there is an $ n > m$ such that $ a_m^m$ divides $ a_n^n$. Is it true that $ a_1$ must divide $ a_n^n$ for some $ n > 1$?
Determine how many $100$-positive integer sequences satisfy the two conditions following:
- At least one term of the sequence is equal to $4$ or $5$.
- Any two adjacent terms differ as a maximum in $2$.
Let $({{x}_{n}})$ be an integer sequence such that $0\le {{x}_{0}}<{{x}_{1}}\le 100$ and
$${{x}_{n+2}}=7{{x}_{n+1}}-{{x}_{n}}+280,\text{ }\forall n\ge 0.$$
a) Prove that if ${{x}_{0}}=2,{{x}_{1}}=3$ then for each positive integer $n,$ the sum of divisors of the following number is divisible by $24$ $${{x}_{n}}{{x}_{n+1}}+{{x}_{n+1}}{{x}_{n+2}}+{{x}_{n+2}}{{x}_{n+3}}+2018.$$
b) Find all pairs of numbers $({{x}_{0}},{{x}_{1}})$ such that ${{x}_{n}}{{x}_{n+1}}+2019$ is a perfect square for infinitely many nonnegative integer numbers $n.$
A $\pm 1$-[i]sequence[/i] is a sequence of $2022$ numbers $a_1, \ldots, a_{2022},$ each equal to either $+1$ or $-1$. Determine the largest $C$ so that, for any $\pm 1$-sequence, there exists an integer $k$ and indices $1 \le t_1 < \ldots < t_k \le 2022$ so that $t_{i+1} - t_i \le 2$ for all $i$, and $$\left| \sum_{i = 1}^{k} a_{t_i} \right| \ge C.$$
A $\pm 1$-[i]sequence[/i] is a sequence of $2022$ numbers $a_1, \ldots, a_{2022},$ each equal to either $+1$ or $-1$. Determine the largest $C$ so that, for any $\pm 1$-sequence, there exists an integer $k$ and indices $1 \le t_1 < \ldots < t_k \le 2022$ so that $t_{i+1} - t_i \le 2$ for all $i$, and $$\left| \sum_{i = 1}^{k} a_{t_i} \right| \ge C.$$
A sequence of integers is constructed as follows: $a_1$ is an arbitrary three-digit number, $a_2$ is the sum of squares of the digits of $a_1, a_3$ is the sum of squares of the digits of $a_2$, etc. Prove that either $1$ or $4$ must occur in the sequence $a_1, a_2, a_3, ....$
For each positive integer $n$, set $x_n=\binom{2n}{n}$.
a. Prove that if $\frac{2017^k}{2}<n<2017^k$ for some positive integer $k$ then $2017$ divides $x_n$.
b. Find all positive integer $h>1$ such that there exists positive integers $N,T$ such that $(x_n)_{n>N}$ is periodic mod $h$ with period $T$.
Prove that there exists two strictly increasing sequences $(a_{n})$ and $(b_{n})$ such that $a_{n}(a_{n}+1)$ divides $b^{2}_{n}+1$ for every natural n.
Call a sequence of positive integers $(a_n)_{n \ge 1}$ a "CGMO sequence" if $(a_n)_{n \ge 1}$ strictly increases, and for all integers $n \ge 2022$, $a_n$ is the smallest integer such that there exists a non-empty subset of $\{a_{1}, a_{2}, \cdots, a_{n-1} \}$ $A_n$ where $a_n \cdot \prod\limits_{a \in A_n} a$ is a perfect square.
Proof: there exists $c_1, c_2 \in \mathbb{R}^{+}$ s.t. for any "CGMO sequence" $(a_n)_{n \ge 1}$ , there is a positive integer $N$ that satisfies any $n \ge N$, $c_1 \cdot n^2 \le a_n \le c_2 \cdot n^2$.
A sequence of $N$ consecutive positive integers is called [i]good [/i] if it is possible to choose two of these numbers so that their product is divisible by the sum of the other $N-2$ numbers. For which $N$ do there exist infinitely many [i]good [/i] sequences?
Suppose that the sequence $\{a_n\}$ of positive integers satisfies the following conditions:
[list]
[*]For an integer $i \geq 2022$, define $a_i$ as the smallest positive integer $x$ such that $x+\sum_{k=i-2021}^{i-1}a_k$ is a perfect square.
[*]There exists infinitely many positive integers $n$ such that $a_n=4\times 2022-3$.
[/list]
Prove that there exists a positive integer $N$ such that $\sum_{k=n}^{n+2021}a_k$ is constant for every integer $n \geq N$.
And determine the value of $\sum_{k=N}^{N+2021}a_k$.
Let $f(n) = n + \lfloor \sqrt{n} \rfloor$. Prove that for every positive integer $m$, the integer sequence $m, f(m), f(f(m)), \dots$ contains at least one square of an integer.
Consider infinite sequences $a_1,a_2,\dots$ of positive integers satisfying $a_1=1$ and $$a_n \mid a_k+a_{k+1}+\dots+a_{k+n-1}$$ for all positive integers $k$ and $n.$ For a given positive integer $m,$ find the maximum possible value of $a_{2m}.$
[i]Proposed by Krit Boonsiriseth[/i]
Consider infinite sequences $a_1,a_2,\dots$ of positive integers satisfying $a_1=1$ and $$a_n \mid a_k+a_{k+1}+\dots+a_{k+n-1}$$ for all positive integers $k$ and $n.$ For a given positive integer $m,$ find the maximum possible value of $a_{2m}.$
[i]Proposed by Krit Boonsiriseth[/i]
Let $a$ and $b$ be positive integers not divisible by $5$. A sequence of integers is constructed as follows: the first term is $5$, and every consequent term is obtained by multiplying its precedent by $a$ and adding $b$. (For example, if $a = 2$ and $b = 4$, the first three terms are $5,14,32$.) What is the maximum possible number of primes that can occur before encoutering the first composite term?
A capricious mathematician writes a book with pages numbered from $2$ to $400$. The pages are to be read in the following order. Take the last unread page ($400$), then read (in the usual order) all pages which are not relatively prime to it and which have not been read before. Repeat until all pages are read. So, the order would be $2, 4, 5, ... , 400, 3, 7, 9, ... , 399, ...$. What is the last page to be read?
A $\pm 1$-[i]sequence[/i] is a sequence of $2022$ numbers $a_1, \ldots, a_{2022},$ each equal to either $+1$ or $-1$. Determine the largest $C$ so that, for any $\pm 1$-sequence, there exists an integer $k$ and indices $1 \le t_1 < \ldots < t_k \le 2022$ so that $t_{i+1} - t_i \le 2$ for all $i$, and $$\left| \sum_{i = 1}^{k} a_{t_i} \right| \ge C.$$
Given a sequence of numbers $a_1, a_2, ..., a_{15}$, one can always construct a new sequence $b_1,b_2, ..., b_{15}$, where $b_i$ is equal to the number of terms in the sequence $\{a_k\}^{15}_{k=1}$ less than $a_i$ ($i = 1, 2,..., 15$). Is there a sequence $\{a_k\}^{15}_{k=1}$ for which the sequence $\{b_k\}^{15}_{k=1}$ is $$1, 0, 3, 6, 9, 4, 7, 2, 5, 8, 8, 5, 10, 13, 13 \,?$$
Prove that there exists a sequence of positive integers $a_1,a_2,a_3, ...$ such that $a_1^2+a_2^2+...+a_n^2$ is a perfect square for all positive integers $n$.
Let be a sequence $ \left( b_n \right)_{n\ge 1} $ of integers, having the following properties:
$ \text{(i)} $ the sequence $ \left( \frac{b_n}{n} \right)_{n\ge 1} $ is convergent.
$ \text{(ii)} m-n|b_m-b_n, $ for any natural numbers $ m>n. $
Prove that there exists an index from which the sequence $ \left( b_n \right)_{n\ge 1} $ is an arithmetic one.
[i]Cristinel Mortici[/i]
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$
Determine all sequences of integers $a_1, a_2,. . .,$ such that:
(i) $1 \le a_i \le n$ for all $1 \le i \le n$.
(ii) $| a_i - a_j| = | i - j |$ for any $1 \le i, j \le n$