Found problems: 788
Given a polynomial $P(x)$ with
a) natural coefficients;
b) integer coefficients;
Let us denote with $a_n$ the sum of the digits of $P(n)$ value. Prove that there is a number encountered in the sequence $a_1, a_2, ... , a_n, ...$ infinite times.
Let $n,k$ be positive integers such that n is not divisible by 3 and $k \geq n$. Prove that there exists a positive integer $m$ which is divisible by $n$ and the sum of its digits in decimal representation is $k$.
Prove that every integer $ k$ greater than 1 has a multiple that is less than $ k^4$ and can be written in the decimal system with at most four different digits.
Find two three-digit numbers $x$ and $y$ such that the sum of all other three digit numbers is equal to $600x$.
We say that a positive integer is [i]quad-divi[/i] if it is divisible by the sum of the squares of its digits, and also none of its digits is equal to zero.
a) Find a quad-divi number such that the sum of its digits is $24$.
b) Find a quad-divi number such that the sum of its digits is $1001$.
For each positive integer $n$, a new number $t_n$ is formed from the numbers $2^n$ and $5^n$ which consists of the digits from $2^n$ followed by the digits from $5^n$. For example, $t_4$ is $16625$. How many digits does the number $t_{2008}$ have?
Find a multiple of $2018$ whose decimal expansion's first four digits are $2017$.
We will call a positive integer [i]good [/i] if all its digits are nonzero. A good integer will be called [i]special [/i] if it has at least $k$ digits and their values strictly increase from left to right. Let a good integer be given. At each move, one may either add some special integer to its digital expression from the left or from the right, or insert a special integer between any two its digits, or remove a special number from its digital expression.What is the largest $k$ such that any good integer can be turned into any other good integer by such moves?
* Prove that a number of the form $2^n$ for a positive integer $n$ may begin with any given combination of digits.
Determine the last two digits of the number $2^5 + 2^{5^{2}} + 2^{5^{3}} +... + 2^{5^{1991}}$ , written in decimal notation.
Find digits $a,b,c,x$ ($a>0$) such that $\overline{abc}+\overline{acb}=\overline{199x}$
Prove that among $18$ consecutive three digit numbers there must be at least one which is divisible by the sum of its digits.
When the natural numbers are written one after another in an increasing way, you get an infinite succession of digits $123456789101112 ....$ Denote $A_k$ the number formed by the first $k$ digits of this sequence . Prove that for all positive integer $n$ there is a positive integer $m$ which simultaneously verifies the following three conditions:
(i) $n$ divides $A_m$,
(ii) $n$ divides $m$,
(iii) $n$ divides the sum of the digits of $A_m$.
We consider positive integers written down in the (usual) decimal system. Within such an integer, we number the positions of the digits from left to right, so the leftmost digit (which is never a $0$) is at position $1$.
An integer is called [i]even-steven[/i] if each digit at an even position (if there is one) is greater than or equal to its neighbouring digits (if these exist).
An integer is called [i]oddball[/i] if each digit at an odd position is greater than or equal to its neighbouring digits (if these exist).
For example, $3122$ is [i]oddball[/i] but not [i]even-steven[/i], $7$ is both [i]even-steven[/i] and [i]oddball[/i], and $123$ is neither [i]even-steven[/i] nor [i]oddball[/i].
(a) Prove: every oddball integer greater than $9$ can be obtained by adding two [i]oddball [/i] integers.
(b) Prove: there exists an oddball integer greater than $9$ that cannot be obtained by adding two [i]even-steven[/i] integers.
With the digits $1, 2, 3,. . . . . . , 9$ three-digit numbers are written such that the sum of the three digits is $17$. How many numbers can be written?
Prove that for every prime number $p$ and positive integer $a$, there exists a natural number $n$ such that $p^n$ contains $a$ consecutive equal digits.
Given a positive integer $A$ written in decimal expansion: $(a_{n},a_{n-1}, \ldots, a_{0})$ and let $f(A)$ denote $\sum^{n}_{k=0} 2^{n-k}\cdot a_k$. Define $A_1=f(A), A_2=f(A_1)$. Prove that:
[b]I.[/b] There exists positive integer $k$ for which $A_{k+1}=A_k$.
[b]II.[/b] Find such $A_k$ for $19^{86}.$
Find the largest positive integer with the property that each digit apart from the first and the last one is smaller than the arithmetic mean of her neighbours.
Write using with the floor function: the last, the second last, and the first digit of the number $n$ written in the decimal system.
$(MON 1)$ Find the number of five-digit numbers with the following properties: there are two pairs of digits such that digits from each pair are equal and are next to each other, digits from different pairs are different, and the remaining digit (which does not belong to any of the pairs) is different from the other digits.
A four - digit natural number which is divisible by $7$ is given. The number obtained by writing the digits in reverse order is also divisible by $7$. Furthermore, both the numbers leave the same remainder when divided by $37$. Find the 4-digit number.
1) Let $a$ and $b$ be relatively prime positive integers. Prove that there is a positive integer $n$ such that $1 \le n \le b$ and $b$ divides $a^n - 1$.
2) Prove that there is a multiple of $7^{2010}$ of the form $99... 9$ ($n$ nines), for some positive integer $n$ not exceeding $7^{2010}$.
For each positive integer $n$, let $S(n)$ be the sum of the digits of $n^2 +1$. A sequence $\{a_n\}$ is defined, with $a_0$ an arbitrary positive integer and $a_{n+1} = S(a_n)$. Prove that the sequence $\{a_n\}$ is eventually periodic with period three.
Ana and Banana are playing a game. Initially, Ana secretly picks a number $1\leq A\leq 10^6$. In each subsequent turn of the game, Banana may pick a positive integer $B$, and Ana will reveal to him the most common digit in the product $A\cdot B$ (written in decimal notation). In the case when at least two digits are tied for being the most common, Ana will reveal all of them to Banana. For example, if $A\cdot B=2022$, Ana will tell Banana that the digit $2$ is the most common, while if $A\cdot B=5783783$, Ana will reveal that $3, 7$ and $8$ are the most common. Banana's goal is to determine with certainty the number $A$ after some number of turns. Does he have a winning strategy?
A number is said to be [i]balanced [/i] if one of its digits is average of the others. How many [i]balanced [/i]$3$-digit numbers are there?