Found problems: 128
Let $a$ and $b$ be two natural numbers that have an equal number $n$ of digits in their decimal expansions. The first $m$ digits (from left to right) of the numbers $a$ and $b$ are equal. Prove that if $m >\frac{n}{2},$ then $a^{\frac{1}{n}} -b^{\frac{1}{n}} <\frac{1}{n}$
Let $ m$ and $ n$ be positive integers such that $ 1 \le m < n$. In their decimal representations, the last three digits of $ 1978^m$ are equal, respectively, to the last three digits of $ 1978^n$. Find $ m$ and $ n$ such that $ m \plus{} n$ has its least value.
Determine all three-digit numbers $N$ having the property that $N$ is divisible by 11, and $\dfrac{N}{11}$ is equal to the sum of the squares of the digits of $N$.
Find, with proof, the least positive integer $n$ having the following property: in the binary representation of $\frac 1n$, all the binary representations of $1, 2, \ldots, 1990$ (each consist of consecutive digits) are appeared after the decimal point.
For the positive integer $k$ we denote by the $a_n$ , the $k$ from the left digit in the decimal notation of the number $2^n$ ($a_n = 0$ if in the notation of the number $2^n$ less than the digits). Consider the infinite decimal fraction $a = \overline{0, a_1a_2a_3...}$. Prove that the number $a$ is irrational.
Determine whether there exist 2024 distinct positive integers satisfying the following: if we consider every possible ratio between two distinct numbers (we include both $a/b$ and $b/a$), we will obtain numbers with finite decimal expansions (after the decimal point) of mutually distinct non-zero lengths.
Call a rational number [i]short[/i] if it has finitely many digits in its decimal expansion. For a positive integer $m$, we say that a positive integer $t$ is $m-$[i]tastic[/i] if there exists a number $c\in \{1,2,3,\ldots ,2017\}$ such that $\dfrac{10^t-1}{c\cdot m}$ is short, and such that $\dfrac{10^k-1}{c\cdot m}$ is not short for any $1\le k<t$. Let $S(m)$ be the set of $m-$tastic numbers. Consider $S(m)$ for $m=1,2,\ldots{}.$ What is the maximum number of elements in $S(m)$?
Show that for any $n \not \equiv 0 \pmod{10}$ there exists a multiple of $n$ not containing the digit $0$ in its decimal expansion.
Determine whether there exists an infinite sequence of nonzero digits $a_1 , a_2 , a_3 , \cdots $ and a positive integer $N$ such that for every integer $k > N$, the number $\overline{a_k a_{k-1}\cdots a_1 }$ is a perfect square.
Find digits $x, y, z$ such that the equality
\[\sqrt{\underbrace{\overline{xx\cdots x}}_{2n \text{ times}}-\underbrace{\overline{yy\cdots y}}_{n \text{ times}}}=\underbrace{\overline{zz\cdots z}}_{n \text{ times}}\]
holds for at least two values of $n \in \mathbb N$, and in that case find all $n$ for which this equality is true.
In the decimal expansion of a fraction $\frac{m}{n}$ with positive integers $m$ and $n$ you can find a string of numbers $7143$ after the comma.
Show $n>1250$.
[i]Example:[/i] I mean something like $0.7143$.
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$.
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]
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.)
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.)
Prove that $5^n$ has a block of $1976$ consecutive $0's$ in its decimal representation.
For a given positive integer $ k$ denote the square of the sum of its digits by $ f_1(k)$ and let $ f_{n\plus{}1}(k) \equal{} f_1(f_n(k)).$ Determine the value of $ f_{1991}(2^{1990}).$
Let $s(n)$ denote the sum of digits of a positive integer $n$ in base $10$. If $s(m)=20$ and $s(33m)=120$, what is the value of $s(3m)$?
Let $ m$ and $ n$ be positive integers such that $ 1 \le m < n$. In their decimal representations, the last three digits of $ 1978^m$ are equal, respectively, to the last three digits of $ 1978^n$. Find $ m$ and $ n$ such that $ m \plus{} n$ has its least value.
Determine whether there exists an infinite sequence of nonzero digits $a_1 , a_2 , a_3 , \cdots $ and a positive integer $N$ such that for every integer $k > N$, the number $\overline{a_k a_{k-1}\cdots a_1 }$ is a perfect square.
Let $d_n$ be the last nonzero digit of the decimal representation of $n!$. Prove that $d_n$ is aperiodic; that is, there do not exist $T$ and $n_0$ such that for all $n \geq n_0, d_{n+T} = d_n.$
Find the digits left and right of the decimal point in the decimal form of the number \[ (\sqrt{2} + \sqrt{3})^{1980}. \]
For every non-negative integer $k$ let $S(k)$ denote the sum of decimal digits of $k$. Let $P(x)$
and $Q(x)$ be polynomials with non-negative integer coecients such that $S(P(n)) = S(Q(n))$ for
all non-negative integers $n$. Prove that there exists an integer $t$ such that $P(x) - 10^tQ(x)$ is a constant polynomial.
Positive integer $m$ shall be called [i]anagram [/i] of positive $n$ if every digit $a$ appears as many times in the decimal representation of $m$ as it appears in the decimal representation of $n$ also. Is it possible to find $4$ different positive integers such that each of the four to be [i]anagram [/i] of the sum of the other $3$?
(Bulgaria)
Find the smallest possible natural number $n = \overline{a_m ...a_2a_1a_0} $ (in decimal system) such that the number $r = \overline{a_1a_0a_m ..._20} $ equals $2n$.