Found problems: 788
The digits of a $3$-digit number are interchanged so that none of the digits retain their original position. The difference of the two numbers is a $2$-digit number and is a perfect square. Find the difference.
Nils has a telephone number with eight different digits.
He has made $28$ cards with statements of the type “The digit $a$ occurs earlier than the digit $b$ in my telephone number” – one for each pair of digits appearing in his number.
How many cards can Nils show you without revealing his number?
Prove that there exists a prime number $p$, such that the sum of digits of $p$ is a composite odd integer. Find the smallest such $p$.
For every $n \in N $, let $d(n)$ denote the sum of digits of $n$. It is easy to see that the sequence $d(n), d(d(n))$, $d(d(d(n))), ... $ will eventually become a constant integer between $1$ and $9$ (both inclusive). This number is called the digital root of $n$ . Denote it by $b(n)$. Then for how many natural numbers $k<1000 , \lim_{n \to \infty} b(k^n)$ exists.
Find the exponent of $37$ in the representation of the number $111...... 11$ with $3\cdot 37^{2000}$ digits equals to $1$, as product of prime powers
Determine all positive integers $n$ such that $n$ equals the square of the sum of the digits of $n$.
Tireless Thomas and Jeremy construct a sequence. At the beginning there is one positive integer in the sequence. Then they successively write new numbers in the sequence in the following way: Thomas obtains the next number by adding to the previous number one of its (decimal) digits, while Jeremy obtains the next number by subtracting from the previous number one of its digits. Prove that there is a number in this sequence which will be repeated at least $100$ times.
(A Shapovalov)
Let $n$ be a positive integer. Find as many as possible zeros as last digits the following expression: $1^n + 2^n + 3^n + 4^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$
Let $f(x) = x^n$ where $n$ is a fixed positive integer and $x =1, 2, \cdots .$ Is the decimal expansion $a = 0.f (1)f(2)f(3) . . .$ rational for any value of $n$ ?
The decimal expansion of a is defined as follows: If $f(x) = d_1(x)d_2(x) \cdots d_{r(x)}(x)$ is the decimal expansion of $f(x)$, then $a = 0.1d_1(2)d_2(2) \cdots d_{r(2)}(2)d_1(3) . . . d_{r(3)}(3)d_1(4) \cdots .$
Find a $10$-digit number, in which no digit is zero, that is divisible by the sum of their digits.
$a$ is a $2000$ digit natural number of the form
$$a=2(A)99…99(B)(C)$$
expressed in base $10$. $a$ is not a multiple of $10$, and $2(A)+(B)(C)=99$. $a=2899..9971$ is a possible example of $a$. $b$ is a number you earn when you write the digits of $a$ in a reverse order(Writing the digits of some number in a reverse order means like reordering $1234$ into $4321$). Find every positive integer $a$ that makes $ab$ a square number.
Certain tickets are numbered as follows: $1, 2, 3, \dots, N $. Exactly half of the tickets have the digit $ 1$ on them. If $N$ is a three-digit number, determine all possible values of $N $.
Three different digits were used to create three different three-digit numbers forming an arithmetic progression. (In each number, all the digits are different.) What is the largest difference in this progression?
Show that there exists a unique sequence of decimal digits $p_0=5,p_1,p_2,\ldots$ such that, for any $k$, the square of any positive integer ending with $\overline{p_kp_{k-1}\cdots p_0}$ ends with the same digits.
When $4444^{4444}$ is written in decimal notation, the sum of its digits is $ A.$ Let $B$ be the sum of the digits of $A.$ Find the sum of the digits of $ B.$ ($A$ and $B$ are written in decimal notation.)
An ancient Inca legend tells that a monster lives among the mountains that when wakes up, eats everyone who read this issue. After such a task, the monster returns to the mountains and sleeps for a number of years equal to the sum of its digits of the year in which you last woke up. The monster woke up for the first time in the year $234$.
a) Would the monster have woken up between the years $2005$ and $2015$?
b) Will we be safe in the next $10$ years?
You have a $4$-digit whole number that is a perfect square. Another number is built adding $ 1$ to the unit's digit, subtracting $ 1$ from the ten's digit, adding $ 1$ to the hundred's digit and subtracting $ 1$ from the ones digit of one thousand. If the number you get is also a perfect square, find the original number. It's unique?
For any natural number $n$, expressed in base $10$, let $S(n)$ denote the sum of all digits of $n$. Find all natural numbers $n$ such that $n=2S(n)^2$.
Natural number $k$ has $n$ digits in its decimal notation. It was rounded up to tens, then the obtained number was rounded up to hundreds, and so on $(n-1)$ times. Prove that the obtained number $m$ satisfies inequality $m < \frac{18k}{13}$.
(Examples of rounding: $191\to190\to 200, 135\to140\to 100$.)
Determine, with proof, the smallest positive multiple of $99$ all of whose digits are either $1$ or $2$.
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.$
Determine the last digit of $5^5+6^6+7^7+8^8+9^9$.
Let $n$ be a positive integer. Prove that the numbers $n^2(n^2 + 2)^2$ and $n^4(n^2 + 2)^2$ are written in base $n^2 +1$ with the same digits but in opposite order.
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?