Alice and Bob determine a number with $2018$ digits in the decimal system by choosing digits from left to right. Alice starts and then they each choose a digit in turn. They have to observe the rule that each digit must differ from the previously chosen digit modulo $3$. Since Bob will make the last move, he bets that he can make sure that the final number is divisible by $3$. Can Alice avoid that? [i](Proposed by Richard Henner)[/i]

Find the least natural number such that if the first digit (in the decimal system) is placed last, the new number is $7/2 $ times as large as the original number.

Show that if a $6n$-digit number is divisible by $7$, then the number that results from moving the ones digit to the beginning of the number is also a multiple of $7$.

Find all real numbers $a>0$ for which the series $$\sum_{n=1}^\infty\frac{a^{f(n)}}{n^2}$$is convergent; $f(n)$ denotes the number of $0$'s in the decimal expansion of $f$.

In a bank, only the manager knows the safe's combination, which is a five-digit number. To support this combination, each of the bank's ten employees is given a five-digit number. Each of these backup numbers has in one of the five positions the same digit as the combination and in the other four positions a different digit than the one in that position in the combination. Backup numbers are: $07344$, $14098$, $27356$, $36429$, $45374$, $52207$, $63822$, $70558$, $85237$, $97665$. What is the combination to the safe?

For each positive integer $n$, let $s(n)$ be the sum of the squares of the digits of $n$. For example, $s(15)=1^2+5^2=26$. Determine all integers $n\geq 1$ such that $s(n)=n$.

A natural number $N$ is written in its decimal representation . It is known that for each digit in this representation , this digit divides exactly into the number $N$ (the digit $0$ is not encountered). What is the maximum number of different digits which there can be in such a representation of $N$? (S . Fomin, Leningrad)

In a game, a participant chooses a nine-digit positive integer $\overline{ABCDEFGHI}$ with distinct non-zero digits. The score of the participant is $A^{B^{C^{D^{E^{F^{G^{H^{I}}}}}}}}$. Which nine-digit number should be chosen in order to maximise the score?

Does there exist a positive integer that is divisible by $2020$ and has equal numbers of digits $0, 1, 2, . . . , 9$ ? Mikhail Evdokimov

Let $a$ and $b$ be 2019-digit numbers. Exactly 12 digits of $a$ are non-zero: the five leftmost and seven rightmost, and exactly 14 digits of $b$ are non-zero: the five leftmost and nine rightmost. Prove that the largest common divisor of $a$ and $b$ has no more than 14 digits. [i]Proposed by L. Samoilov[/i]

Let $S$ be a set of $49$-digit numbers $n$, with the property that each of the digits $1, 2, 3, \dots, 7$ appears in the decimal expansion of $n$ seven times (and $8, 9$ and $0$ do not appear). Show that no two distinct elements of $S$ divide each other.

Let $ \alpha(n)$ be the number of digits equal to one in the binary representation of a positive integer $ n.$ Prove that: (a) the inequality $ \alpha(n) (n^2 ) \leq \frac{1}{2} \alpha(n)(\alpha(n) + 1)$ holds; (b) the above inequality is an equality for infinitely many positive integers, and (c) there exists a sequence $ (n_i )^{\infty}_1$ such that $ \frac{\alpha ( n^2_i )}{\alpha (n_i }$ goes to zero as $ i$ goes to $ \infty.$ [i]Alternative problem:[/i] Prove that there exists a sequence a sequence $ (n_i )^{\infty}_1$ such that $ \frac{\alpha ( n^2_i )}{\alpha (n_i )}$ (d) $ \infty;$ (e) an arbitrary real number $ \gamma \in (0,1)$; (f) an arbitrary real number $ \gamma \geq 0$; as $ i$ goes to $ \infty.$

On blackboard is written $3$ digit number so all three digits are distinct than zero. Out of it, we made three $2$ digit numbers by crossing out first digit of original number, crossing out second digit of original number and crossing out third digit of original number. Sum of those three numbers is $293$. Which number is written on blackboard?

Let's call a pair of positive integers $\overline{a_1a_2\ldots a_k}$ and $\overline{b_1b_2\ldots b_k}$ $k$-similar if all digits $a_1, a_2, \ldots, a_k , b_1 , b_2, \ldots, b_k$ are distinct, and there exist distinct positive integers $m, n$, for which the following equality holds: $$a_1^m + a_2^m + \ldots + a_k^m = b_1^n + b_2^n + \ldots + b_k^n$$ For which largest $k$ do there exist $k$-similar numbers? [i]Proposed by Oleksiy Masalitin[/i]

Prove that every integer $ k$ greater than 1 has a multiple that is less than $ k^4$ and can be written in the decimal system with at most four different digits.

Find (with proof) all natural numbers $n$ such that, for some natural numbers $a$ and $b$, $a\ne b$, the digits in the decimal representations of the two numbers $n^a+1$ and $n^b+1$ are in reverse order.