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: 573

2015 Saudi Arabia JBMO TST, 1

A $2015$- digit natural number $A$ has the property that any $5$ of it's consecutive digits form a number divisible by $32$. Prove that $A$ is divisible by $2^{2015}$

2013 Dutch Mathematical Olympiad, 5

Tags: digit , sum , number theory
The number $S$ is the result of the following sum: $1 + 10 + 19 + 28 + 37 +...+ 10^{2013}$ If one writes down the number $S$, how often does the digit `$5$' occur in the result?

2015 Singapore Junior Math Olympiad, 1

Consider the integer $30x070y03$ where $x, y$ are unknown digits. Find all possible values of $x, y$ so that the given integer is a multiple of $37$.

1970 IMO Longlists, 42

We have $0\le x_i<b$ for $i=0,1,\ldots,n$ and $x_n>0,x_{n-1}>0$. If $a>b$, and $x_nx_{n-1}\ldots x_0$ represents the number $A$ base $a$ and $B$ base $b$, whilst $x_{n-1}x_{n-2}\ldots x_0$ represents the number $A'$ base $a$ and $B'$ base $b$, prove that $A'B<AB'$.

2018 Estonia Team Selection Test, 6

We call a positive integer $n$ whose all digits are distinct [i]bright[/i], if either $n$ is a one-digit number or there exists a divisor of $n$ which can be obtained by omitting one digit of $n$ and which is bright itself. Find the largest bright positive integer. (We assume that numbers do not start with zero.)

2007 Cuba MO, 5

Prove that there is a unique positive integer formed only by the digits $2$ and $5$, which has $ 2007$ digits and is divisible by $2^{2007}$.

2014 JBMO TST - Macedonia, 3

Find all positive integers $n$ which are divisible by 11 and satisfy the following condition: all the numbers which are generated by an arbitrary rearrangement of the digits of $n$, are also divisible by 11.

2023 Ukraine National Mathematical Olympiad, 10.1

Find all positive integers $k$, for which the product of some consecutive $k$ positive integers ends with $k$. [i]Proposed by Oleksiy Masalitin[/i]

1996 Estonia National Olympiad, 2

Does there exist a positive integer such that its last digit is nonzero and that it becomes exactly two times bigger when the order of its digits is reversed?

2002 May Olympiad, 4

In a bank, only the manager knows the safe's combination, which is a five-digit number. To support this combination, each of the bank's ten employees is given a five-digit number. Each of these backup numbers has in one of the five positions the same digit as the combination and in the other four positions a different digit than the one in that position in the combination. Backup numbers are: $07344$, $14098$, $27356$, $36429$, $45374$, $52207$, $63822$, $70558$, $85237$, $97665$. What is the combination to the safe?

2019 Polish Junior MO First Round, 1

The natural number $n$ was multiplied by $3$, resulting in the number $999^{1000}$. Find the unity digit of $n$.

2017 Hanoi Open Mathematics Competitions, 7

Determine two last digits of number $Q = 2^{2017} + 2017^2$

1983 Bundeswettbewerb Mathematik, 3

A real number is called [i]triplex[/i] if it has a decimal representation in which none of $0$ and $3$ different digit occurs. Prove that every positive real number is the sum of nine triplex numbers.

2024 Polish Junior MO Finals, 5

Let $S=\underbrace{111\dots 1}_{19}\underbrace{999\dots 9}_{19}$. Show that the $2S$-digit number \[\underbrace{111\dots 1}_{S}\underbrace{999\dots 9}_{S}\] is a multiple of $19$.

2016 Czech-Polish-Slovak Junior Match, 2

Find the largest integer $d$ divides all three numbers $abc, bca$ and $cab$ with $a, b$ and $c$ being some nonzero and mutually different digits. Czech Republic

1991 Greece National Olympiad, 3

Find all 2-digit numbers$ n$ having the property: 'Number $n^2$ is 4-digit number of form $\overline{xxyy}$.

2001 Regional Competition For Advanced Students, 1

Let $n$ be an integer. We consider $s (n)$, the sum of the $2001$ powers of $n$ with the exponents $0$ to $2000$. So $s (n) = \sum_{k=0}^{2000}n ^k$ . What is the unit digit of $s (n)$ in the decimal system?

2007 May Olympiad, 2

Let $X= a1b9$ and $Y ab = 51ab$ be two positive integers where $a$ and $b$ are digits. $X$ is known to be multiple of a positive two-digit number $n$ and $Y$ is the next multiple of that number $n$. Find the number $n$ and the digits $a$ and $b$. Justify why there are no other possibilities.

2001 Denmark MO - Mohr Contest, 2

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$).

1970 IMO, 2

We have $0\le x_i<b$ for $i=0,1,\ldots,n$ and $x_n>0,x_{n-1}>0$. If $a>b$, and $x_nx_{n-1}\ldots x_0$ represents the number $A$ base $a$ and $B$ base $b$, whilst $x_{n-1}x_{n-2}\ldots x_0$ represents the number $A'$ base $a$ and $B'$ base $b$, prove that $A'B<AB'$.

2016 May Olympiad, 3

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$.

2018 Brazil EGMO TST, 1

(a) Let $m$ and $n$ be positive integers and $p$ a positive rational number, with $m > n$, such that $\sqrt{m} -\sqrt{n}= p$. Prove that $m$ and $n$ are perfect squares. (b) Find all four-digit numbers $\overline{abcd}$, where each letter $a, b, c$ and $d$ represents a digit, such that $\sqrt{\overline{abcd}} -\sqrt{\overline{acd}}= \overline{bb}$.

1989 Austrian-Polish Competition, 3

Find all natural numbers $N$ (in decimal system) with the following properties: (i) $N =\overline{aabb}$, where $\overline{aab}$ and $\overline{abb}$ are primes, (ii) $N = P_1P_2P_3$, where $P_k (k = 1,2,3)$ is a prime consisting of $k$ (decimal) digits.

2024 Bundeswettbewerb Mathematik, 2

Can a number of the form $44\dots 41$, with an odd number of decimal digits $4$ followed by a digit $1$, be a perfect square?

2004 Tournament Of Towns, 5

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.