Found problems: 788
A wobbly number is a positive integer whose digits are alternately zero and non-zero with the last digit non-zero (for example, 201). Find all positive integers which do not divide any wobbly number.
We call a positive integer [i]alternating[/i] if every two consecutive digits in its decimal representation are of different parity.
Find all positive integers $n$ such that $n$ has a multiple which is alternating.
Prove that there is no positive integer $n$ such that, for $k = 1,2,\ldots,9$, the leftmost digit (in decimal notation) of $(n+k)!$ equals $k$.
Determine the digits $0\leqslant c\leqslant 9$ such that for any positive integer $k{}$ there exists a positive integer $n$ such that the last $k{}$ digits of $n^9$ are equal to $c{}.$
What is the last digit of $4^{3^{2019}}$?
[b]A.[/b] $0$ [b]B.[/b] $2$ [b]C.[/b] $4$ [b]D.[/b] $6$ [b]E.[/b] $8$
Let $a_1 < a_2 < ... < a_n$ be a sequence of natural numbers such that for $i < j$ the decimal representation of $a_i$ does not occur as the leftmost digits of the decimal representation of $a_j$ . (For example, $137$ and $13729$ cannot both occur in the sequence.) Prove that $\sum_{i=1}^n \frac{1}{a_i} \le 1+\frac12 +\frac13 +...+\frac19$
.
A positive integer $A_k...A_1A_0$ is called monotonic if $A_k \le ..\le A_1 \le A_0$.
Show that for any $n \in N$ there is a monotonic perfect square with $n$ digits.
Two $10$-digit integers are called neighbours if they differ in exactly one digit (for example, integers $1234567890$ and $1234507890$ are neighbours). Find the maximal number of elements in the set of $10$-digit integers with no two integers being neighbours.
We say that a positive integer N is [i]nice[/i] if it satisfies the following conditions:
$\bullet$ All of its digits are $1$ or $2$
$\bullet$ All numbers formed by $3$ consecutive digits of $N$ are distinct.
For example, $121222$ is nice, because the $4$ numbers formed by $3$ consecutive digits of $121222$, which are $121,212,122$ and $222$, are distinct. However, $12121$ is not nice. What is the largest quantity possible number of numbers that a nice number can have? What is the greatest nice number there is?
For each integer $n \ge 100$ we define $T(n)$ to be the number obtained from $n$ by moving the two leading digits to the end. For example, $T(12345) = 34512$ and $T(100) = 10$. Find all integers $n \ge 100$ for which $n + T(n) = 10n$.
Let $X = 123456789$. Find the sum of the tens digits of all integral multiples of $11$ that can be obtained by interchanging two digits of $X$.
$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 $?$
Each positive integer $a$ undergoes the following procedure in order to obtain the number $d = d\left(a\right)$:
(i) move the last digit of $a$ to the first position to obtain the numb er $b$;
(ii) square $b$ to obtain the number $c$;
(iii) move the first digit of $c$ to the end to obtain the number $d$.
(All the numbers in the problem are considered to be represented in base $10$.) For example, for $a=2003$, we get $b=3200$, $c=10240000$, and $d = 02400001 = 2400001 = d(2003)$.)
Find all numbers $a$ for which $d\left( a\right) =a^2$.
[i]Proposed by Zoran Sunic, USA[/i]
$15.$ Let $n$ be the largest integer that is the product of exactly $3$ distinct prime numbers, $x,y,$ and $10x+y,$ where $x$ and $y$ are digits. What is the sum of digits of $n ?$
Which is the largest four-digit number that has all four of its digits among its divisors and its digits are all different?
Consider all the $7$-digit numbers formed by the digits $1,2 , 3,...,7$ each digit being used exactly once in all the $7! $ numbers. Prove that no two of them have the property that one divides the other.
Suppose that $n > m \geq 1$ are integers such that the string of digits $143$ occurs somewhere in the decimal representation of the fraction $\frac{m}{n}$. Prove that $n > 125.$
We have an integer $A$ such that $A^2$ is a four digit number, with $5$ in the ten's place . Find all possible values of $A$.
Which number we need to substract from numerator and add to denominator of $\frac{\overline{28a3}}{7276}$ such that we get fraction equal to $\frac{2}{7}$
Find all positive integers $n$ for which there exists a positive integer $k$ such that the decimal representation of $n^k$ starts and ends with the same digit.
[b]1.[/b] For each real number $r$ between $0$ and $1$ we can represent $r$ as an infinite decimal $r = 0.r_1r_2r_3\dots$ with $0 \leq r_i \leq 9$. For example, $\frac{1}{4} = 0.25000\dots$, $\frac{1}{3} = 0.333\dots$ and $\frac{1}{\sqrt{2}} = 0.707106\dots$.
a) Show that we can choose two rational numbers $p$ and $q$ between $0$ and $1$ such that, from their decimal representations $p = 0.p_1p_2p_3\dots$ and $q = 0.q_1q_2q_3\dots$, it's possible to construct an irrational number $\alpha = 0.a_1a_2a_3\dots$ such that, for each $i = 1, 2, 3, \dots$, we have $a_i = p_1$ or $a_1 = q_i$.
b) Show that there's a rational number $s = 0.s_1s_2s_3\dots$ and an irrational number $\beta = 0.b_1b_2b_3\dots$ such that, for all $N \geq 2017$, the number of indexes $1 \leq i \leq N$ satisfying $s_i \neq b_i$ is less than or equal to $\frac{N}{2017}$.
How many positive integers of $n$ digits exist such that each digit is $1, 2$, or $3$? How many of these contain all three of the digits $1, 2$, and $3$ at least once?
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 every four-digit number, we take the product of its four digits. Then we add all of these products together . What is the result?
( G Galperin)
If there is a natural number $n$ such that the number $n!$ has exactly $11$ zeros at the end?
(With $n!$ is denoted the number $1\cdot 2\cdot 3 \cdot ... (n - )1 \cdot n$).