Found problems: 573
Let us call the [i]distance [/i] between the numbers $\overline{a_1a_2a_3a_4a_5}$ and $\overline{b_1b_2b_3b_4b_5}$ the maximum $i$ for which $a_i \ne b_i$. All five-digit numbers are written out one after another in some order. What is the minimum possible sum of distances between adjacent numbers?
Nine positive integers $a_1,a_2,...,a_9$ have their last $2$-digit part equal to $11,12,13,14,15,16,17,18$ and $19$ respectively. Find the last $2$-digit part of the sum of their squares.
Pedro writes all the numbers with four different digits that can be made with digits $a, b, c, d$, that meet the following conditions: $$ a\ne 0 \, , \, b=a+2 \, , \, c=b+2 \, , \, d=c+2$$
Find the sum of all the numbers Pedro wrote.
Find the sum of all $4$-digit numbers using the digits $2,3,4,5,6$ without a repetition of any of those digits.
Find the smallest multiple of $81$ that only contains the digit $1$. How many $ 1$’s does it contain?
Sara wrote on the board an integer with less than thirty digits and ending in $2$. Celia erases the $2$ from the end and writes it at the beginning. The number that remains written is equal to twice the number that Sara had written. What number did Sara write?
Let $S(n)$ denote the sum of digits of $n \in N$. Find all $n$ such that $S(n) = S(2n) = S(3n) =... = S(n^2)$
Suppose $N$ is any positive integer. Add the digits of $N$ to obtain a smaller integer. Repeat this process of digit-addition till you get a single digit numbem. Find the number of positive integers $N \le 1000$, such that the final single-digit number $n$ is equal to $5$.
Example: $N = 563\to (5 + 6 + 3) = 14 \to(1 + 4) = 5$ will be counted as one such integer.
Find all positive integers $\overline{xyz}$ ($x$, $y$ and $z$ are digits) such that
$\overline{xyz} = x+y+z+xy+yz+zx+xyz$
Let $a$ and $b$ be positive integers, $a < b$, such that in the decimal expansion of the fraction $\dfrac{a}{b} $ the five digits $1,4,2,8,6$ appear somewhere, in that order and consecutively. Determine the lowest possible value $b$ can take .
Is there a positive integer $n$ such that when we write the decimal digits of $2^n$ in opposite order, we get another integer power of $2$?
For each positive integer n, the number $R(n) = 11 ... 1$ is defined, which is made up of exactly $n$ digits equal to $1$. For example, $R(5) = 11111$. Let $n > 4$ be an integer for which, by writing all the positive divisors of $R(n)$, it is true that each written digit belongs to the set $\{0, 1\}$. Show that $n$ is a power of an odd prime number.
Clarification: A power of an odd prime number is a number of the form $p^a$, where $p$ is an odd prime number and $a$ is a positive integer.
Find unknown digits $a$ and $b$ such that number $\overline{a783b}$ is divisible with $56$
Let's call a ticket with a number from $000000$ to $999999$ [i]excellent [/i] if the difference between some two adjacent digits is $5$. Find the number of excellent tickets.
A bus ticket is considered to be lucky if the sum of the first three digits equals to the sum of the last three ($6$ digits in Russian buses). Prove that the sum of all the lucky numbers is divisible by $13$.
Every officially published book used to have an ISBN code (International Standard Book Number) which consisted of $10$ symbols. Such code looked like this: $$a_1a_2 . . . a_9a_{10}$$ with $a_1, . . . , a_9 \in \{0, 1, . . . , 9\}$ and $a_{10} \in \{0, 1, . . . , 9, X\}$. The symbol $X$ stood for the number $10$. With a valid ISBN code was
$$a_1 + 2a2 + . . . + 9a_9 + 10a_{10}$$ a multiple of $11$. Prove the following statements.
(a) If one symbol is changed in a valid ISBN code, the result is no valid ISBN code.
(b) When two different symbols swap places in a valid ISBN code then the result is not a valid ISBN.
Consider positive integers $m$ and $n$ for which $m> n$ and the number $22 220 038^m-22 220 038^n$ has are eight zeros at the end. Show that $n> 7$.
Consider all $6$-digit numbers of the form $abccba$ where $b$ is odd. Determine the number of all such $6$-digit numbers that are divisible by $7$.
Find all integers of the form $2^n$ (where $n$ is a natural number) such that after deleting the first digit of its decimal representation we again get a power of $2$.
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 $k$ and $d$ be integers such that $k>1$ and $0\leq d<9$. Prove that there exists some integer $n$ such that the $k$th digit from the right of $2^n$ is $d$.
[i](tatari/nightmare)[/i]
Find the last two digits of $11^{1998}$
Determine all ten-digit numbers whose decimal $\overline{a_0a_1a_2a_3a_4a_5a_6a_7a_8a_9}$ is given by such that for each integer $j$ with $0\le j \le 9, a_j$ is equal to the number of digits equal to $j$ in this representation.
That is: the first digit is equal to the amount of "$0$" in the writing of that number, the second digit is equal to the amount of "$1$" in the writing of that number, the third digit is equal to the amount of "$2$" in the writing of that number, ... , the tenth digit is equal to the number of "$9$" in the writing of that number.
Find the sum of all non-zero digits that can repeat at the end of a perfect square. (For example, if $811$ were a perfect square, $1$ would be one of these non-zero digits.)
The distance between towns $A$ and $B$ is $999$ km.
At every kilometer of the road that connects $A$ and $B$ a sign shows the distances to $A$ and $B$ as follows:
$\fbox{0-999}$ , $\fbox{1-998}$ ,$\fbox{2-997}$ , $ . . . $ , $\fbox{998-1}$ , $\fbox{999-0}$
How many signs are there, with both distances written with the help of only two distinct digits?