This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 788

Is there a nine-digit number without zero digits, the remainder of dividing which on each of its digits is different?
A positive integer is [i]happy[/i] if: 1. All its digits are different and not $0$, 2. One of its digits is equal to the sum of the other digits. For example, 253 is a [i]happy[/i] number. How many [i]happy[/i] numbers are there?
(a) Is there a natural number $n$ such that the number $2^n$ has last digit $6$ and the sum of the other digits is $2$? b) Are there natural numbers $a$ and $m\ge 3$ such that the number $a^m$ has last digit $6$ and the sum of the other digits is 3?
Let $f(x) = x^n$ where $n$ is a fixed positive integer and $x =1, 2, \cdots .$ Is the decimal expansion $a = 0.f (1)f(2)f(3) . . .$ rational for any value of $n$ ? The decimal expansion of a is defined as follows: If $f(x) = d_1(x)d_2(x) \cdots d_{r(x)}(x)$ is the decimal expansion of $f(x)$, then $a = 0.1d_1(2)d_2(2) \cdots d_{r(2)}(2)d_1(3) . . . d_{r(3)}(3)d_1(4) \cdots .$
Let $f(k)$ be the number of integers $n$ satisfying the following conditions: (i) $0\leq n < 10^k$ so $n$ has exactly $k$ digits (in decimal notation), with leading zeroes allowed; (ii) the digits of $n$ can be permuted in such a way that they yield an integer divisible by $11$. Prove that $f(2m) = 10f(2m-1)$ for every positive integer $m$. [i]Proposed by Dirk Laurie, South Africa[/i]
Let $N$ be a positive integer such that $N$ and $N^2$ both end in the same four digits $\overline{abcd}$, where $a \ne 0$. What is the four-digit number $\overline{abcd}$?
What is the number of $4$-digit numbers that contains exactly $3$ different digits that have consecutive value? Such numbers are for instance $5464$ or $2001$. Two digits in base $10$ are consecutive if their difference is $1$.
Let $a$ be number of $n$ digits ($ n > 1$). A number $b$ of $2n$ digits is obtained by writing two copies of $a$ one after the other. If $\frac{b}{a^2}$ is an integer $k$, find the possible values values of $k$.
Prove that for every positive integer $n$ there exists a positive integer $k$, such that each of the numbers $k, k^2, \dots, k^n$ have at least one block of $2022$ in their decimal representation. For example, the numbers 4[b]2022[/b]13 and 544[b]2022[/b]1[b]2022[/b] have at least one block of $2022$ in their decimal representation.
Find the digits left and right of the decimal point in the decimal form of the number \[ (\sqrt{2} + \sqrt{3})^{1980}. \]
Positive integers $a < b < c$ are such that $b + a$ is a multiple of $b - a$ and $c + b$ is a multiple of $c-b$. If $a$ is a $2011$-digit number and $b$ is a $2012$-digit number, exactly how many digits does $c$ have?
Find all prime numbers of the form $10101...01$.
Consider a positive integer, $N = 9 + 99 + 999 + ... +\underbrace{999...9}_{2018}$. How many times does the digit $1$ occur in its decimal representation?
For any natural number $n = \overline{a_i...a_2a_1}$, consider the number $$T(n) =10 \sum_{i \,\, even} a_i+\sum_{i \,\, odd} a_i.$$ Let's find the smallest positive integer $A$ such that is sum of the natural numbers $n_1,n_2,...,n_{148}$ as well as of $m_1,m_2,...,m_{149}$ and matches the pattern: $A=n_1+n_2+...+n_{148}=m_1+m_2+...+m_{149}$ $T(n_1)=T(n_2)=...=T(n_{148})$ $T(m_1)=T(m_2)=...=T(m_{148})$
In a three-digit positive integer $M$, the number of hundreds is less than the number of tenths and the number of tenths is less than the number of ones. The arithmetic mean of the integer three-digit numbers obtained by arranging the number $M$ and its numbers ends with the number $5$. Find all such three-digit numbers $M$.
A positive integer $n$ is [i]Mozart[/i] if the decimal representation of the sequence $1, 2, \ldots, n$ contains each digit an even number of times. Prove that: 1. All Mozart numbers are even. 2. There are infinitely many Mozart numbers.
Let $ a_n$ be the last nonzero digit in the decimal representation of the number $ n!.$ Does the sequence $ a_1, a_2, \ldots, a_n, \ldots$ become periodic after a finite number of terms?
Lucía multiplies some positive one-digit numbers (not necessarily distinct) and obtains a number $n$ greater than 10. Then, she multiplies all the digits of $n$ and obtains an odd number. Find all possible values of the units digit of $n$. $\textit{Proposed by Pablo Serrano, Ecuador}$
Let's call a natural number a palindrome, the decimal notation of which is equally readable from left to right and right to left (decimal notation cannot start from zero; for example, the number $1221$ is a palindrome, but the numbers $1231, 1212$ and $1010$ are not). Which palindromes among the numbers from $10,000$ to $999,999$ have an odd sum of digits, which have an one even, and how many times are the ones with odd sum more than the ones with the even sum?
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}.$
Let $X$ be the sum of all divisors of the number $(3\cdot 2009)^{((2\cdot 2009)^{2009}-1)}$ . Find the last digit of $X$.
Take the number $2^{2004}$ and calculate the sum $S$ of all its digits. Then the sum of all the digits of $S$ is calculated to obtain $R$. Next, the sum of all the digits of $R$is calculated and so on until a single digit number is reached. Find it. (For example if we take $2^7=128$, we find that $S=11,R=2$. So in this case of $2^7$ the searched digit will be $2$).
Find all terms of the arithmetic progression $-1, 18, 37, 56, ...$ whose only digit is $5$.
Find all positive integers that are equal to $700$ times the sum of its digits.
Prove that all numbers of the sequence \[ \frac{107811}{3}, \quad \frac{110778111}{3}, \frac{111077781111}{3}, \quad \ldots \] are exact cubes.