Determine whether there exists an infinite sequence of nonzero digits $a_1 , a_2 , a_3 , \cdots $ and a positive integer $N$ such that for every integer $k > N$, the number $\overline{a_k a_{k-1}\cdots a_1 }$ is a perfect square.

A $6n$-digit number is divisible by $7$. Prove that if its last digit is moved to the beginning of the number then the new number is also divisible by $7$.

Let $a$ and $b$ be positive integers such that the number $b^2 + (b +1)^2 +...+ (b + a)^2-3$ is multiple of $5$ and $a + b$ is odd. Calculate the digit of the units of the number $a + b$ written in decimal notation.

$$Problem1:$$ A two-digit number which is not a multiple of $10$ is given. Assuming it is divisible by the sum of its digits, prove that it is also divisible by $3$. Does the statement hold for three-digit numbers as well?

In the expression $4\cdot\text{RAKEC}=\text{CEKAR}$, each letter represents a (decimal) digit. Replace the letters so that the equality is true.

Which fractions $ \dfrac{p}{q},$ where $p,q$ are positive integers $< 100$, is closest to $\sqrt{2} ?$ Find all digits after the point in decimal representation of that fraction which coincide with digits in decimal representation of $\sqrt{2}$ (without using any table).

How many positive integers $N$ in the segment $\left[10, 10^{20} \right]$ are such that if all their digits are increased by $1$ and then multiplied, the result is $N+1$? [i](F. Bakharev)[/i]

Let $a_1=1$, $a_2=2^{a_1}$, $a_3=3^{a_2}$, $a_4=4^{a_3}$, $\dots$, $a_9 = 9^{a_8}$. Find the last two digits of $a_9$.

Denote by $P(n)$ the product of the digits of a positive integer $n$. For example, $P(1948)=1\cdot9\cdot4\cdot8=288$. [list=a] [*] Evaluate the sum $P(1)+P(2)+\dots+P(2017)$. [*] Determine the maximum value of $\frac{P(n)}{n}$ where $2017\leq n\leq5777$. [/list]

1. Find $N$, the smallest positive multiple of $45$ such that all of its digits are either $7$ or $0$. 2. Find $M$, the smallest positive multiple of $32$ such that all of its digits are either $6$ or $1$. 3. How many elements of the set $\{1,2,3,...,1441\}$ have a positive multiple such that all of its digits are either $5$ or $2$?

Find all $6$ digit natural numbers, which consist of only the digits $1,2,$ and $3$, in which $3$ occurs exactly twice and the number is divisible by $9$.

Oleksiy writes all the digits from $0$ to $9$ on the board, after which Vlada erases one of them. Then he writes $10$ nine-digit numbers on the board, each consisting of all the nine digits written on the board (they don't have to be distinct). It turned out that the sum of these $10$ numbers is a ten-digit number, all of whose digits are distinct. Which digit could have been erased by Vlada? [i]Proposed by Oleksii Masalitin[/i]

Mazo performs the following operation on triplets of non-negative integers: If at least one of them is positive, it chooses one positive number, decreases it by one, and replaces the digits in the units place with the other two numbers. It starts with the triple $x$, $y$, $z$. Find a triple of positive integers $x$, $y$, $z$ such that $xy + yz + zx = 1000$ (*) and the number of operations that Mazo can subsequently perform with the triple $x, y, z$ is (a) maximal (i.e. there is no triple of positive integers satisfying (*) that would allow him to do more operations); (b) minimal (i.e. every triple of positive integers satisfying (*) allows him to perform at least so many operations).

Find the sum of (decimal) digits of the number $(10^{2021} + 2021)^2$?

Define the maximal value of the ratio of a three-digit number to the sum of its digits.