Found problems: 766
There are $2022$ numbers arranged in a circle $a_1, a_2, . . ,a_{2022}$. It turned out that for any three consecutive $a_i$, $a_{i+1}$, $a_{i+2}$ the equality $a_i =\sqrt2 a_{i+2} - \sqrt3 a_{i+1}$. Prove that $\sum^{2022}_{i=1} a_ia_{i+2} = 0$, if we know that $a_{2023} = a_1$, $a_{2024} = a_2$.
a) Determine all 4-tuples $(x_0,x_1,x_2,x_3)$ of pairwise distinct intergers such that each $x_k$ is coprime to $x_{k+1}$(indices reduces modulo 4) and the cyclic sum $\frac{x_0}{x_1}+\frac{x_1}{x_2}+\frac{x_2}{x_3}+\frac{x_3}{x_1}$ is an interger.
b)Show that there are infinitely many 5-tuples $(x_0,x_1,x_2,x_3,x_4)$ of pairwise distinct intergers such that each $x_k$ is coprime to $x_{k+1}$(indices reduces modulo 5) and the cyclic sum $\frac{x_0}{x_1}+\frac{x_1}{x_2}+\frac{x_2}{x_3}+\frac{x_3}{x_4}+\frac{x_4}{x_0}$ is an interger.
Consider the sequences $(a_n), (b_n)$ defined by
\[a_1=3, \quad b_1=100 , \quad a_{n+1}=3^{a_n} , \quad b_{n+1}=100^{b_n} \]
Find the smallest integer $m$ for which $b_m > a_{100}.$
Let it \(k \geq 1\) be an integer. Define the sequence \((a_n)_{n \geq 1}\) by \(a_0=0,a_1=1\) and
\[ a_{n+2} = ka_{n+1}+a_n \]
for \(n \geq 0\).
Let it \(p\) an odd prime number.
Denote \(m(p)\) as the smallest positive integer \(m\) such that \(p | a_m\).
Denote \(T(p)\) as the smallest positive integer \(T\) such that for every natural \(j\) we gave \(p | (a_{T+j}-a_j)\).
[list='i']
[*] Show that \(T(p) \leq (p-1) \cdot m(p)\).
[*] Show that if \(T(p) = (p-1) \cdot m(p)\) then
\[ \prod_{1 \leq j \leq T(p)-1}^{j \not \equiv 0 \pmod{m(p)}}{a_j} \equiv (-1)^{m(p)-1} \pmod{p} \]
[/list]
Let $c$ be a positive integer. The sequence $\{f_n\}$ is defined as follows:
\[f_1 = 1, f_2 = c, f_{n+1} = 2f_n - f_{n-1} + 2 \quad (n \geq 2).\]
Show that for each $k \in \mathbb N$ there exists $r \in \mathbb N$ such that $f_kf_{k+1}= f_r.$
Let $\, a$, and $b \,$ be odd positive integers. Define the sequence $\{f_n\}_{n\ge 1}$ by putting $\, f_1 = a,$ $f_2 = b, \,$ and by letting $\, f_n \,$ for $\, n \geq 3 \,$ be the greatest odd divisor of $\, f_{n-1} + f_{n-2}$. Show that $\, f_n \,$ is constant for sufficiently large $\, n \,$ and determine the eventual value as a function of $\, a \,$ and $\, b$.
Show that there do not exist positive integers $m$ and $n$ such that \[ \dfrac{m}{n} + \dfrac{n+1}{m} = 4 . \]
Let $n$ be a natural number. We define sequences $\langle a_i\rangle$ and $\langle b_i\rangle$ of integers as follows. We let $a_0=1$ and $b_0=n$. For $i>0$, we let $$\left( a_i,b_i\right)=\begin{cases} \left(2a_{i-1}+1,b_{i-1}-a_{i-1}-1\right) & \text{if } a_{i-1}<b_{i-1},\\
\left( a_{i-1}-b_{i-1}-1,2b_{i-1}+1\right) & \text{if } a_{i-1}>b_{i-1},\\
\left(a_{i-1},b_{i-1}\right) & \text{if } a_{i-1}=b_{i-1}.\end{cases}$$
Given that $a_k=b_k$ for some natural number $k$, prove that $n+3$ is a power of two.
Consider the sequence of integers $0, 1, 2, 4, 6, 9, 12,...$ obtained by starting with zero, adding $1$, then adding $1$ again, then adding $2$, and adding $2$ again, then adding $3$, and adding $3$ again, and so on. If we call the subsequent terms of this sequence $a_0, a_1, a_2, ...$, then we have $a_0 = 0$, and $a_{2n-1} = a_{2n-2} + n$ , $a_{2n} = a_{2n-1} + n$ for all integers $n \ge 1$.
Find all integers $k \ge 0$ for which $a_k$ is the square of an integer.
Let $n$ be an integer greater than $1$. Define
\[x_1 = n, y_1 = 1, x_{i+1} =\left[ \frac{x_i+y_i}{2}\right] , y_{i+1} = \left[ \frac{n}{x_{i+1}}\right], \qquad \text{for }i = 1, 2, \ldots\ ,\]
where $[z]$ denotes the largest integer less than or equal to $z$. Prove that
\[ \min \{x_1, x_2, \ldots, x_n \} =[ \sqrt n ]\]
Let $x_0=a, x_1= b, x_2 = c$ be given real numbers and let $x_{n+2} = \frac{x_n + x_{n-1}}{2}$ for all $n\geq 1$. Show that the sequence $(x_n)_{n\geq 0}$ converges and find its limit.
The Sequence $\{a_{n}\}_{n \geqslant 0}$ is defined by $a_{0}=1, a_{1}=-4$ and $a_{n+2}=-4a_{n+1}-7a_{n}$ , for $n \geqslant 0$. Find the number of positive integer divisors of $a^2_{50}-a_{49}a_{51}$.
The sequence $\{a_n\}$ satisfies $a_0=1, a_1=2011,$ and $a_n=2a_{n-1}+a_{n-2}$ for all $n \geq 2$. Let
\[ S = \sum_{i=1}^{\infty} \frac{a_{i-1}}{a_i^2-a_{i-1}^2} \]
What is $\frac{1}{S}$?
[i]Author: Ray Li[/i]
Determine all sequences $(x_1,x_2,\ldots,x_{2011})$ of positive integers, such that for every positive integer $n$ there exists an integer $a$ with \[\sum^{2011}_{j=1} j x^n_j = a^{n+1} + 1\]
[i]Proposed by Warut Suksompong, Thailand[/i]
Let $ S \equal{}\{1,2,3, \ldots, 2n\}$ ($ n \in \mathbb{Z}^\plus{}$). Ddetermine the number of subsets $ T$ of $ S$ such that there are no 2 element in $ T$ $ a,b$ such that $ |a\minus{}b|\equal{}\{1,n\}$
Let the sequence $ a(n), n \equal{} 1,2,3, \ldots$ be generated as follows with $ a(1) \equal{} 0,$ and for $ n > 1:$
\[ a(n) \equal{} a\left( \left \lfloor \frac{n}{2} \right \rfloor \right) \plus{} (\minus{}1)^{\frac{n(n\plus{}1)}{2}}.\]
1.) Determine the maximum and minimum value of $ a(n)$ over $ n \leq 1996$ and find all $ n \leq 1996$ for which these extreme values are attained.
2.) How many terms $ a(n), n \leq 1996,$ are equal to 0?
Prove that there exists no in nite sequence of prime numbers $p_0, p_1, p_2,...$ such that for all positive integers $k$:
$p_k = 2p_{k-1} + 1$ or $p_k = 2p_{k-1} - 1$.
For a finite non empty set of primes $P$, let $m(P)$ denote the largest possible number of consecutive positive integers, each of which is divisible by at least one member of $P$.
(i) Show that $|P|\le m(P)$, with equality if and only if $\min(P)>|P|$.
(ii) Show that $m(P)<(|P|+1)(2^{|P|}-1)$.
(The number $|P|$ is the size of set $P$)
[i]Dan Schwarz, Romania[/i]
Let $x_n = \sqrt[2]{2+\sqrt[3]{3+\cdots+\sqrt[n]{n}}}.$ Prove that
\[x_{n+1}-x_n <\frac{1}{n!} \quad n=2,3,\cdots\]
Let $m$ be a fixed integer greater than $1$. The sequence $x_0$, $x_1$, $x_2$, $\ldots$ is defined as follows:
\[x_i = \begin{cases}2^i&\text{if }0\leq i \leq m - 1;\\\sum_{j=1}^mx_{i-j}&\text{if }i\geq m.\end{cases}\]
Find the greatest $k$ for which the sequence contains $k$ consecutive terms divisible by $m$ .
[i]Proposed by Marcin Kuczma, Poland[/i]
Sir Alex plays the following game on a row of 9 cells. Initially, all cells are empty. In each move, Sir Alex is allowed to perform exactly one of the following two operations:
[list=1]
[*] Choose any number of the form $2^j$, where $j$ is a non-negative integer, and put it into an empty cell.
[*] Choose two (not necessarily adjacent) cells with the same number in them; denote that number by $2^j$. Replace the number in one of the cells with $2^{j+1}$ and erase the number in the other cell.
[/list]
At the end of the game, one cell contains $2^n$, where $n$ is a given positive integer, while the other cells are empty. Determine the maximum number of moves that Sir Alex could have made, in terms of $n$.
[i]Proposed by Warut Suksompong, Thailand[/i]
Let a sequence $(a_n)$ satisfy: $a_1=5,a_2=13$ and $a_{n+1}=5a_n-6a_{n-1},\forall n\ge2$
a) Prove that $(a_n, a_{n+1})=1,\forall n\ge1$
b) Prove that: $2^{k+1}|p-1\forall k\in\mathbb{N}$, if p is a prime factor of $a_{2^k}$
In a sports meeting a total of $m$ medals were awarded over $n$ days. On the first day one medal and $\frac{1}{7}$ of the remaining medals were awarded. On the second day two medals and $\frac{1}{7}$ of the remaining medals were awarded, and so on. On the last day, the remaining $n$ medals were awarded. How many medals did the meeting last, and what was the total number of medals ?
Let $\{u_n\}_{n \ge 1}$ be a sequence of real numbers defined as $u_1 = 1$ and
\[ u_{n+1} = u_n + \frac{1}{u_n} \text{ for all $n \ge 1$.}\]
Prove that $u_n \le \frac{3\sqrt{n}}{2}$ for all $n$.
A [i]string of length $n$[/i] is a sequence of $n$ characters from a specified set. For example, $BCAAB$ is a string of length 5 with characters from the set $\{A,B,C\}$. A [i]substring[/i] of a given string is a string of characters that occur consecutively and in order in the given string. For example, the string $CA$ is a substring of $BCAAB$ but $BA$ is not a substring of $BCAAB$.
[list=a][*]List all strings of length 4 with characters from the set $\{A,B,C\}$ in which both the strings $AB$ and $BA$ occur as substrings. (For example, the string $ABAC$ should appear in your list.)
[*]Determine the number of strings of length 7 with characters from the set $\{A,B,C\}$ in which $CC$ occures as a substring.
[*]Let $f(n)$ be the number of strings of length $n$ with characters from the set $\{A,B,C\}$ such that [list][*]$CC$ occurs as a substring, and[*]if either $AB$ or $BA$ occurs as a substring then there is an occurrence of the substring $CC$ to its left.[/list]
(for example, when $n\;=\;6$, the strings $CCAABC$ and $ACCBBB$ and $CCABCC$ satisfy the requirements, but the strings $BACCAB$ and $ACBBAB$ and $ACBCAC$ do not). Prove that $f(2097)$ is a multiple of $97$.[/list]