Given a finite sequence of zeros and ones, which has two properties: a) if in some arbitrary place in the sequence we select five digits in a row and also select five digits in any other place in a row, then these fives will be different (they may overlap); b) if you add any digit to the right of the sequence, then property (a) will no longer hold true. Prove that the first four digits of our sequence coincide with the last four

Given a sequence $a_n$: \[ 1, 2, 2, 3, 3, 3, 4, 4, 4, 4, \dots \] (one '1', two '2' and so on) and another sequence $b_n$ such that $a_{b_n}=b_{a_n}$ for all positive integers $n$. It is known that $b_k=1$ for some $k>100$. Prove that $b_m=1$ for all $m>k$.

Let $a_1$, $a_2$, $\ldots$ be an infinite sequence of (positive) integers such that $k$ divides $\gcd(a_{k-1},a_k)$ for all $k\geq 2$. Compute the smallest possible value of $a_1+a_2+\cdots+a_{10}$.

Let positive integer $k$ satisfies $1<k<100$. For the permutation of $1,2,...,100$ be $a_1,a_2,...,a_{100}$, take the minimum $m>k$ such that $a_m$ is at least less than $(k-1)$ numbers of $a_1,a_2,...,a_k$. We know that the number of sequences satisfies $a_m=1$ is $\frac{100!}{4}$. Find the all possible values of $k$.

An [i]$n$-type triangle[/i] where $n\geqslant 2$ is formed by the cells of a $(2n+1)\times(2n+1)$ board, situated under both main diagonals. For instance, a $3$-type triangle looks like this:[img]https://i.ibb.co/k4fmwWY/Screenshot-2024-07-31-153932.png[/img]Determine the maximal length of a sequence with pairwise distinct cells in an $n$-type triangle, such that, beggining with the second one, any cell of the sequence has a common side with the previous one. [i]Cristi Săvescu[/i]

The sequences $(x_n)$ and $(y_n)$ are defined as follows: $$ x_{n+1} = \frac{x_n+2}{x_n+1},\quad y_{n+1}=\frac{y_n^2+2}{2y_n} \quad \text{ for } n= 0,1,2,\ldots.$$ Prove that for every integer $ n\geq 0 $ the equality $ y_n = x_{2^n-1} $ holds.

An increasing arithmetic sequence with infinitely many terms is determined as follows. A single die is thrown and the number that appears is taken as the first term. The die is thrown again and the second number that appears is taken as the common difference between each pair of consecutive terms. Determine with proof how many of the 36 possible sequences formed in this way contain at least one perfect square.

For each positive integer $n$ we consider the sequence of $2004$ integers$$\left [n+\sqrt{n}\right ],\left [n+1+\sqrt{n+1}\right ],\left [n+2+\sqrt{n+2}\right ],\ldots ,\left [n+2003+\sqrt{n+2003}\right ]$$Determine the smallest integer $n$ such that the $2004$ numbers in the sequence are $2004$ consecutive integers. Clarification: The brackets indicate the integer part.

Let $ S $ be a nonempty subset of a finite group $ G, $ and $ \left( S^j \right)_{j\ge 1} $ be a sequence of sets defined as $ S^j=\left.\left\{\underbrace{xy\cdots z}_{\text{j terms}} \right| \underbrace{x,y,\cdots ,z}_{\text{j terms}} \in S \right\} . $ Prove that: [b]a)[/b] $ \exists i_0\in\mathbb{N}^*\quad i\ge i_0\implies \left| S^i\right| =\left| S^{1+i}\right| $ [b]b)[/b] $ S^{|G|}\le G $

A sequence of squares is made of identical square tiles. The edge of each square is one tile length longer than the edge of the previous square. The first three squares are shown. How many more tiles does the seventh square require than the sixth? [asy] path p=origin--(1,0)--(1,1)--(0,1)--cycle; draw(p); draw(shift(3,0)*p); draw(shift(3,1)*p); draw(shift(4,0)*p); draw(shift(4,1)*p); draw(shift(7,0)*p); draw(shift(7,1)*p); draw(shift(7,2)*p); draw(shift(8,0)*p); draw(shift(8,1)*p); draw(shift(8,2)*p); draw(shift(9,0)*p); draw(shift(9,1)*p); draw(shift(9,2)*p); [/asy] $ \text{(A)}\ 11\qquad\text{(B)}\ 12\qquad\text{(C)}\ 13\qquad\text{(D)}\ 14\qquad\text{(E)}\ 15 $

Let $ a $ and $ b $ be different real numbers. Prove that for any real numbers $ c_1, c_2, \ldots,c_n $ there exists a sequence of $ n $-elements $ (x_i) $, each term of which is equal to one of the numbers $ a $ or $ b $ such that $$ |x_1c_1 + x_2c_2 + \ldots + x_nc_n| \geq \frac{|b-a|}{2}(|c_1|+|c_2|+\ldots+|c_n|).$$

In the sequence $ (a_n)$ with general term $ a_n \equal{} n^3 \minus{} (2n \plus{} 1)^2$, does there exist a term that is divisible by 2006?

Consider the set $E$ of all natural numbers $n$ such that whenn divided by $11, 12, 13$, respectively, the remainders, int that order, are distinct prime numbers in an arithmetic progression. If $N$ is the largest number in $E$, find the sum of digits of $N$.

Denote by $a_n$ the last digit of the number $n^{(n^n)}$ (let $n\ne 0$ be a natural number ). Prove that the numbers $a_n$ form a periodic sequence and state this period!

$\{a_{n}\}_{n\geq 0}$ and $\{b_{n}\}_{n\geq 0}$ are two sequences of positive integers that $a_{i},b_{i}\in \{0,1,2,\cdots,9\}$. There is an integer number $M$ such that $a_{n},b_{n}\neq 0$ for all $n\geq M$ and for each $n\geq 0$ $$(\overline{a_{n}\cdots a_{1}a_{0}})^{2}+999 \mid(\overline{b_{n}\cdots b_{1}b_{0}})^{2}+999 $$ prove that $a_{n}=b_{n}$ for $n\geq 0$.\\ (Note that $(\overline{x_nx_{n-1}\dots x_0}) = 10^n\times x_n + \dots + 10\times x_1 + x_0$.) [i]Proposed by Yahya Motevassel[/i]

Let $a_1,a_2,\ldots,a_n$ be a finite sequence of non negative integers, its subsequences are the sequences of the form $a_i,a_{i+1},\ldots,a_j$ with $1\le i\le j \le n$. Two subsequences are said to be equal if they have the same length and have the same terms, that is, two subsequences $a_i,a_{i+1},\ldots,a_j$ and $a_u,a_{u+1},\ldots a_v$ are equal iff $j-i=u-v$ and $a_{i+k}=a_{u+k}$ forall integers $k$ such that $0\le k\le j-1$. Finally, we say that a subsequence $a_i,a_{i+1},\ldots,a_j$ is palindromic if $a_{i+k}=a_{j-k}$ forall integers $k$ such that $0\le k \le j-i$ What is the greatest number of different palindromic subsequences that can a palindromic sequence of length $n$ contain?