In an infinite arithmetic progression of positive integers there are two integers with the same sum of digits. Will there necessarily be one more integer in the progression with the same sum of digits? [i]Proposed by A. Shapovalov[/i]

We consider the sum of the digits of a positive integer. For example, the sum of the digits of $2007$ is equal to $9$, since $2 + 0 + 0 + 7 = 9$. (a) How many integers $n$, where $0 < n < 100 000$, have an even sum of digits? (b) How many integers $n$, where $0 < n < 100 000$, have a sum of digits that is less than or equal to $22$?

The sum of the digits of a natural number is $k{}.$ What is the largest possible sum of digits for[list=a] [*] the square of this number; [*]the fourth power of this number, [/list] given that $k\geqslant 4.$ [i]From the folklore[/i]

Denote by $S(n)$ the sum of digits of $n$. Given a positive integer $N$, we consider the following process: We take the sum of digits $S(N)$, then take its sum of digits $S(S(N))$, then its sum of digits $S(S(S(N)))$... We continue this until we are left with a one-digit number. We call the number of times we had to activate $S(\cdot)$ the [b]depth[/b] of $N$. For example, the depth of 49 is 2, since $S(49)=13\rightarrow S(13)=4$, and the depth of 45 is 1, since $S(45)=9$. [list=a] [*] Prove that every positive integer $N$ has a finite depth, that is, at some point of the process we get a one-digit number. [*] Define $x(n)$ to be the [u]minimal[/u] positive integer with depth $n$. Find the residue of $x(5776)\mod 6$. [*] Find the residue of $x(5776)-x(5708)\mod 2016$. [/list]

For any positive integer $k$, denote the sum of digits of $k$ in its decimal representation by $S(k)$. Find all polynomials $P(x)$ with integer coefficients such that for any positive integer $n \geq 2016$, the integer $P(n)$ is positive and $$S(P(n)) = P(S(n)).$$ [i]Proposed by Warut Suksompong, Thailand[/i]

Is there any numbber $n$, such that the sum of its digits in the decimal notation is $1000$, and the sum of its square digits in the decimal notation is $1000000$?

Denote by $T(n)$ the sum of the digits of the decimal representation of a positive integer $n$. a) Find an integer $N$, for which $T(k \cdot N)$ is even for all $k, 1 \le k \le 1992, $ but $T(1993 \cdot N)$ is odd. b) Show that no positive integer $N$ exists such that $T(k \cdot N)$ is even for all positive integers $k$.

Let $k$ be a positive integer, and let $s(n)$ denote the sum of the digits of $n$. Show that among the positive integers with $k$ digits, there are as many numbers $n$ satisfying $s(n) < s(2n)$ as there are numbers $n$ satisfying $s(n) > s(2n)$.

Let $N$ be the number of ways of distributing $8$ chocolates of different brands among $3$ children such that each child gets at least one chocolate, and no two children get the same number of chocolates. Find the sum of the digits of $N$.

Let $n$ be the number that is produced by concatenating the numbers $1, 2,... , 4022$, that is, $n = 1234567891011...40214022$. a. Show that $n$ is divisible by $3$. b. Let $a_1 = n^{2011}$, and let $a_i$ be the sum of the digits of $a_{i-1}$ for $i > 1$. Find $a_4$

Prove that for every positive integer $n$ there is an $n$-digit number $z$ with none of its digits $0$ and such that $z$ is divisible by its sum of digits.

Let $S(a)$ denote the sum of the digits of the number $a$. Given a natural $R$ can one find a natural $n$ such that $\frac{S (n^2)}{S (n)}= R$?

Find all two-digit numbers $x$ the sum of whose digits is the same as that of $2x$, $3x$, ... , $9x$.

For any positive integer $k$, denote the sum of digits of $k$ in its decimal representation by $S(k)$. Find all polynomials $P(x)$ with integer coefficients such that for any positive integer $n \geq 2016$, the integer $P(n)$ is positive and $$S(P(n)) = P(S(n)).$$ [i]Proposed by Warut Suksompong, Thailand[/i]

A natural number is called [i]chaotigal [/i] if it and its successor both have the sum of their digits divisible by $2021$. How many digits are in the smallest chaotigal number?

Prove that among $18$ consecutive three digit numbers there must be at least one which is divisible by the sum of its digits.

Determine all natural numbers $m$ and $n$ such that \[ n \cdot (n + 1) = 3^m + s(n) + 1182, \] where $s(n)$ represents the sum of the digits of the natural number $n$.

Let's call a natural number a palindrome, the decimal notation of which is equally readable from left to right and right to left (decimal notation cannot start from zero; for example, the number $1221$ is a palindrome, but the numbers $1231, 1212$ and $1010$ are not). Which palindromes among the numbers from $10,000$ to $999,999$ have an odd sum of digits, which have an one even, and how many times are the ones with odd sum more than the ones with the even sum?

For every natural number $n$, let $Q(n)$ denote the sum of the decimal digits of $n$. Prove that there are infinitely many positive integers $k$ with $Q(3^k) \ge Q(3^{k+1})$.

For any positive integer $k$, denote the sum of digits of $k$ in its decimal representation by $S(k)$. Find all polynomials $P(x)$ with integer coefficients such that for any positive integer $n \geq 2016$, the integer $P(n)$ is positive and $$S(P(n)) = P(S(n)).$$ [i]Proposed by Warut Suksompong, Thailand[/i]

Prove that there is no $1989$-digit natural number at least three of whose digits are equal to $5$ and such that the product of its digits equals their sum.

$6.$ How many two digit positive integers $N$ have the property that the sum of $N$ and the number obtained by reversing the order of the digits of $N$ is a perfect square $?$

A box contains $900$ cards, labeled from $100$ to $999$. Cards are removed one at a time without replacement. What is the smallest number of cards that must be removed to guarantee that the labels of at least three removed cards have equal sums of digits?

Determine all the positive integers with more than one digit, all distinct, such that the sum of its digits is equal to the product of its digits.

We say that a number is [i]superstitious [/i] when it is equal to $13$ times the sum of its digits . Find all superstitious numbers.