Found problems: 159
$w(x)$ is a polynomial with integer coefficients. Let $p_n$ be the sum of the digits of the number $w(n)$. Show that some value must occur infinitely often in the sequence $p_1, p_2, p_3, ...$ .
Find the smallest positive integer that ends in $56$, is a multiple of $56$, and has the sum of its digits equal to $56$.
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 \ge 2017$, the integer $P(n)$ is positive and $S(P(n)) = P(S(n))$.
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]
The natural numbers $M$ and $K$ are represented by different permutations of the same digits. Prove that
(a) The sum of the digits of $2M$ equals the sum of the digits of $2K$.
(b) The sum of the digits of $M/2$ equals the sum of the digits of $K/2$ ($M, K$ both even).
(c) The sum of the digits of $5M$ equals the sum of the digits of $5 K$.
(AD Lisitskiy)
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?
Find any two consecutive natural numbers, each of which is divisible by the square of the sum of its digits.
Given $k \in \mathbb{Z}$ prove that there exist infinite pairs of distinct natural numbers such that
\begin{align*}
n+s(2n)=m+s(2m) \\
kn+s(n^2)=km+s(m^2).
\end{align*}
($s(n)$ denotes the sum of digits of $n$.)
[i]Proposed by Mohammadamin Sharifi[/i]
Find the least positive integer such that the sum of its digits is $2011$ and the product of its digits is a power of $6$.
Given $k \in \mathbb{Z}$ prove that there exist infinite pairs of distinct natural numbers such that
\begin{align*}
n+s(2n)=m+s(2m) \\
kn+s(n^2)=km+s(m^2).
\end{align*}
($s(n)$ denotes the sum of digits of $n$.)
[i]Proposed by Mohammadamin Sharifi[/i]
For every positive integer $n$, let $S (n)$ be the sum of the digits of $n$. Find, if any, a $171$-digit positive integer $n$ such that $7$ divides $S (n)$ and $7$ divides $S (n + 1)$.
Find all functions $f$ from positive integers to themselves, such that the followings hold.
$1)$.for each positive integer $n$ we have $f(n)<f(n+1)<f(n)+2020$.
$2)$.for each positive integer $n$ we have $S(f(n))=f(S(n))$ where $S(n)$ is the sum of digits of $n$ in base $10$ representation.
A sequence $a_0,a_1,a_2,...,a_n,...$ is such that $a_0=1$ and, for each $n\ge 0$ , $a_{n+1}=m \cdot a_n$ , where $m$ is an integer between $2$ and $9$ inclusive. Also, every integer between $2$ and $9$ has even been used at least once to get $a_{n+1} $ from $a_n$ . Let $Sn$ the sum of the digits of $a_n$ , $n=0,1,2,...$ . Prove that $S_n \ge S_{n+1}$ for infinite values of $n$.
$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 $?$
Find all positive integer $n(\ge 2)$ and rational $\beta \in (0,1)$ satisfying the following:
There exist positive integers $a_1,a_2,...,a_n$, such that for any set $I \subseteq \{1,2,...,n\}$ which contains at least two elements,
$$ S(\sum_{i\in I}a_i)=\beta \sum_{i\in I}S(a_i). $$
where $S(n)$ denotes sum of digits of decimal representation of $n$.
For each positive integer $n$ let $s(n)$ denote the sum of the decimal digits of $n$. Find all pairs of positive integers $(a, b)$ with $a > b$ which simultaneously satisfy the following two conditions
$$a \mid b + s(a)$$
$$b \mid a + s(b)$$
[i]Proposed by Victor Domínguez[/i]
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.
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)$.
For $m = 1, 2, 3, ...$ denote $S(m)$ the sum of the digits of $m$, and let $f(m)=m+S(m)$.
Show that for each positive integer $n$, there exists a number that appears exactly $n$ times in the sequence $f(1),f(2),...,f(m),...$
Show that for every polynomial $f(x)$ with integer coefficients, there exists a integer $C$ such that the set
$\{n \in Z :$ the sum of digits of $f(n)$ is $C\}$ is not finite.
Let $m$ and $n$ be positive integers, where $m < 2^n.$ Determine the smallest possible number of not necessarily pairwise distinct powers of two that add up to $m\cdot(2^n- 1).$
[i]The Problem Selection Committee[/i]
On the $2004$ iTest, we defined an [i]optimus [/i] prime to be any prime number whose digits sum to a prime number. (For example, $83$ is an optimus prime, because it is a prime number and its digits sum to $11$, which is also a prime number.) Given that you select a prime number under $100$, find the probability that is it not an optimus prime.
Writing $1989$ in base $b$, we obtain a three-digit number: $xyz$. It is known that the sum of the digits is the same in base $10$ and in base $b$, that is, $1 + 9 + 8 + 9 = x + y + z$. Determine $x,y,z,b.$
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]