We are given a positive integer $s \ge 2$. For each positive integer $k$, we define its [i]twist[/i] $k’$ as follows: write $k$ as $as+b$, where $a, b$ are non-negative integers and $b < s$, then $k’ = bs+a$. For the positive integer $n$, consider the infinite sequence $d_1, d_2, \dots$ where $d_1=n$ and $d_{i+1}$ is the twist of $d_i$ for each positive integer $i$. Prove that this sequence contains $1$ if and only if the remainder when $n$ is divided by $s^2-1$ is either $1$ or $s$.

Show that if an infinite arithmetic progression of positive integers contains a square and a cube, it must contain a sixth power.

Given a sequence $\{a_n\}$: $a_1=1, a_{n+1}=\left\{ \begin{array}{lcr} a_n+n,\quad a_n\le n, \\ a_n-n,\quad a_n>n, \end{array} \right. \quad n=1,2,\cdots.$ Find the number of positive integers $r$ satisfying $a_r<r\le 3^{2017}$.

Do there exist distinct positive integers $a$, $b$, $c$ such that $a$, $b$, $c$, $-a+b+c$, $a-b+c$, $a+b-c$, $a+b+c$ form an arithmetic progression (in some order).

Is there an infinite periodic sequence of digits for which the following condition condition is fulfilled: for any natural number $n{}$ a natural number divisible by $2^n{}$ can be cut from this sequence of digits (as a word)? [i]Proposed by P. Kozhevnikov[/i]

Define the sequence $\{a_i\}$ by $a_0=1$, $a_1=4$, and $a_{n+1}=5a_n-a_{n-1}$ for all $n\geq 1$. Show that all terms of the sequence are of the form $c^2+3d^2$ for some integers $c$ and $d$.

[b]p1.[/b] Prove that for every point inside a regular polygon, the average of the distances to the sides equals the radius of the inscribed circle. The distance to a side means the shortest distance from the point to the line obtained by extending the side. [b]p2.[/b] Suppose we are given positive (not necessarily distinct) integers $a_1, a_2,..., a_{1997}$ . Show that it is possible to choose some numbers from this list such that their sum is a multiple of $1997$. [b]p3.[/b] You have Blue blocks, Green blocks and Red blocks. Blue blocks and green blocks are $2$ inches thick. Red blocks are $1$ inch thick. In how many ways can you stack the blocks into a vertical column that is exactly $12$ inches high? (For example, for height $3$ there are $5$ ways: RRR, RG, GR, RB, BR.) [b]p4.[/b] There are $1997$ nonzero real numbers written on the blackboard. An operation consists of choosing any two of these numbers, $a$ and $b$, erasing them, and writing $a+b/2$ and $b-a/2$ instead of them. Prove that if a sequence of such operations is performed, one can never end up with the initial collection of numbers. [b]p5.[/b] An $m\times n$ checkerboard (m and n are positive integers) is covered by nonoverlapping tiles of sizes $2\times 2$ and $1\times 4$. One $2\times 2$ tile is removed and replaced by a $1\times 4$ tile. Is it possible to rearrange the tiles so that they cover the checkerboard? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

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 degree measures of the six interior angles of a convex hexagon form an arithmetic sequence (not necessarily in cyclic order). The common difference of this arithmetic sequence can be any real number in the open interval $(-D, D)$. Compute the greatest possible value of $D$.

We call the sequence $d_1,....,d_n$ of natural numbers, not necessarily distinct, [b]covering[/b] if there exists arithmetic progressions like $c_1+kd_1$,....,$c_n+kd_n$ such that every natural number has come in at least one of them. We call this sequence [b]short[/b] if we can not delete any of the $d_1,....,d_n$ such that the resulting sequence be still covering. [b]a)[/b] Suppose that $d_1,....,d_n$ is a short covering sequence and suppose that we've covered all the natural numbers with arithmetic progressions $a_1+kd_1,.....,a_n+kd_n$, and suppose that $p$ is a prime number that $p$ divides $d_1,....,d_k$ but it does not divide $d_{k+1},....,d_n$. Prove that the remainders of $a_1,....,a_k$ modulo $p$ contains all the numbers $0,1,.....,p-1$. [b]b)[/b] Write anything you can about covering sequences and short covering sequences in the case that each of $d_1,....,d_n$ has only one prime divisor. [i]proposed by Ali Khezeli[/i]

An arbitrary prime $ p$ is given. If an integer sequence $ (n_1 , n_2 , \cdots , n_k )$ satisfying the conditions - For all $ i\equal{} 1, 2, \cdots , k$, $ n_i \geq \frac{p\plus{}1}{2}$ - For all $ i\equal{} 1, 2, \cdots , k$, $ p^{n_i} \minus{} 1$ is divisible by $ n_{i\plus{}1}$, and $ \frac{p^{n_i} \minus{} 1}{n_{i\plus{}1}}$ is coprime to $ n_{i\plus{}1}$. Let $ n_{k\plus{}1} \equal{} n_1$. exists not for $ k\equal{}1$, but exists for some $ k \geq 2$, then call the prime a good prime. Prove that a prime is good iff it is not $ 2$.

The positive sequence $\{a_n\}$ satisfies:$a_1=1+\sqrt 2$ and $(a_n-a_{n-1})(a_n+a_{n-1}-2\sqrt n)=2(n\geq 2).$ (1)Find the general formula of $\{a_n\}$; (2)Find the set of all the positive integers $n$ so that $\lfloor a_n\rfloor=2022$.

To every natural number $k, k \geq 2$, there corresponds a sequence $a_n(k)$ according to the following rule: \[a_0 = k, \qquad a_n = \tau(a_{n-1}) \quad \forall n \geq 1,\] in which $\tau(a)$ is the number of different divisors of $a$. Find all $k$ for which the sequence $a_n(k)$ does not contain the square of an integer.

Determine all positive integers $N$ for which there exists a strictly increasing sequence of positive integers $s_0<s_1<s_2<\cdots$ satisfying the following properties: [list=disc] [*]the sequence $s_1-s_0$, $s_2-s_1$, $s_3-s_2$, $\ldots$ is periodic; and [*]$s_{s_n}-s_{s_{n-1}}\leq N<s_{1+s_n}-s_{s_{n-1}}$ for all positive integers $n$ [/list]

In an $8 \times 8$ grid of squares, each square was colored black or white so that no $2\times 2$ square has all its squares in the same color. A sequence of distinct squares $x_1,\dots, x_m$ is called a [b]snake of length $m$[/b] if for each $1\leq i <m$ the squares $x_i, x_{i+1}$ are adjacent and are of different colors. What is the maximum $m$ for which there must exist a snake of length $m$?