Found problems: 573
Find all $7$-digit numbers which are multiples of $21$ and which have each digit $3$ or $7$.
Juan wrote a natural number and Maria added a digit $ 1$ to the left and a digit $ 1$ to the right. Maria's number exceeds to the number of Juan in $14789$. Find the number of Juan.
How many positive integers less than $10,000$ have an even number of even digits and an odd number of odd digits ?
(Assume no number starts with zero.)
Find $5$ last digits of the number $M = 5^{2010}$ .
(A): $65625$, (B): $45625$, (C): $25625$, (D): $15625$, (E) None of the above.
Given five $n$-digit binary numbers. For each two numbers their digits coincide exactly on $m$ places. There is no place with the common digit for all the five numbers. Prove that $$2/5 \le m/n \le 3/5$$
How many numbers $\overline{abcd}$ with different digits satisfy the following property:
if we replace the largest digit with the digit $1$ results in a multiple of $30$?
The numbers $25$ and $76$ have the property that when squared in base $10$, their squares also end in the same two digits. A positive integer is called [i]amazing [/i] if it has at most $3$ digits when expressed in base $21$ and also has the property that its square expressed in base $21$ ends in the same $3$ digits. (For this problem, the last three digits of a one-digit number b are 00b, and the last three digits of a two-digit number $\underline{ab}$ are $0\underline{ab}$.) Compute the sum of all amazing numbers. Express your answer in base $21$.
It is possible to write the numbers $111$, $112$, $121$, $122$, $211$, $212$, $221$ and $222$ at the vertices of a cube, so that the numbers written in adjacent vertices match at most in one digit?
Let $a$, $b$ $c$ be the natural numbers, such that every digit occurs exactly the same number of times in each of the numbers $a$, $b$, $c$. Is it possible that $a + b + c = 10^{1001}$? Justify your answer.
Find all positive integers $n$ which are divisible by 11 and satisfy the following condition: all the numbers which are generated by an arbitrary rearrangement of the digits of $n$, are also divisible by 11.
Each positive integer number $n \ ge 1$ is assigned the number $p_n$ which is the product of all its non-zero digits. For example, $p_6 = 6$, $p_ {32} = 6$, $p_ {203} = 6$. Let $S = p_1 + p_2 + p_3 + \dots + p_ {999}$. Find the largest prime that divides $S $.
The last three digits of $ N$ are $ x25$. For how many values of $ x$ can $ N$ be the square of an integer?
Find all positive integers $n$ for which there exists an integer multiple of $2022$ such that the sum of the squares of its digits is equal to $n$.
Consider the number $\left(101^2-100^2\right)\cdot\left(102^2-101^2\right)\cdot\left(103^2-102^2\right)\cdot...\cdot\left(200^2-199^2\right)$.
[list=a]
[*] Determine its units digit.
[*] Determine its tens digit.
[/list]
Find all $10$ digit numbers $a_0a_1...a_9$ such that for each $k, a_k$ is the number of times that the digit $k$ appears in the number.
Consider the integer $30x070y03$ where $x, y$ are unknown digits. Find all possible values of $x, y$ so that the given integer is a multiple of $37$.
Find how many are the numbers of $2013$ digits $d_1d_2…d_{2013}$ with odd digits $d_1,d_2,…,d_{2013}$ such that the sum of $1809$ terms $$d_1 \cdot d_2+d_2\cdot d_3+…+d_{1809}\cdot d_{1810}$$ has remainder $1$ when divided by $4$ and the sum of $203$ terms $$d_{1810}\cdot d_{1811}+d_{1811}\cdot d_{1812}+…+d_{2012}\cdot d_{2013}$$ has remainder $1$ when dividing by $4$.
Two people write a $2k$-digit number, using only the numbers $1, 2, 3, 4$ and $5$. The first number on the left is written by the first of them, the second - the second, the third - the first, etc. Can the second one achieve this so that the resulting number is divisible by $9$, if the first seeks to interfere with it? Consider the cases $k = 10$ and $k = 15$.
Let $P(x)$ denote the product of all (decimal) digits of a natural number $x$. For any positive integer $x_1$, define the sequence $(x_n)$ recursively by $x_{n+1} = x_n + P(x_n)$. Prove or disprove that the sequence $(x_n)$ is necessarily bounded.
Find all natural numbers $ n$ for which every natural number whose decimal representation has $ n \minus{} 1$ digits $ 1$ and one digit $ 7$ is prime.
Let $A = \overline{abcd}$ be a $4$-digit positive integer, such that $a\ge 7$ and $a > b >c > d > 0$. Let us consider a positive integer $B = \overline{dcba}$. If all digits of $A+B$ are odd, determine all possible values of $A$.
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$.
Find the largest integer such that every number after the first is one less than the previous one and is divisible by each of its own numbers.
Prove that there are at most three primes between $10$ and $10^{10}$ all of whose decimal digits are $1$.
Let $P(x)$ denote the product of all (decimal) digits of a natural number $x$. For any positive integer $x_1$, define the sequence $(x_n)$ recursively by $x_{n+1} = x_n + P(x_n)$. Prove or disprove that the sequence $(x_n)$ is necessarily bounded.