Olympiad problems

2009 May Olympiad, 1

Each two-digit natural number is [i]assigned [/i] a digit as follows: Its digits are multiplied. If the result is a digit, this is the assigned digit. If the result is a two-digit number, these two figures are multiplied, and if the result is a digit, this is the assigned digit. Otherwise, the operation is repeated. For example, the digit assigned to $32$ is $6$ since $3 \times = 6$; the digit assigned to $93$ is $4$ since $9 \times 3 = 27$, $2 \times 7 = 14$, $1 \times 4 = 4$. Find all the two-digit numbers that are assigned $8$.

1991 Tournament Of Towns, (287) 3

Tags: number theory , digit

We are looking for numbers ending with the digit $5$ such that in their decimal expansion each digit beginning with the second digit is no less than the previous one. Moreover the squares of these numbers must also possess the same property. (a) Find four such numbers. (b) Prove that there are infinitely many. (A. Andjans, Riga)

1969 IMO Shortlist, 40

Tags: combinatorics , decimal representation , counting , digit

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

1966 IMO Shortlist, 54

Tags: last digit , number theory , decimal representation , digit , modular arithmetic

We take $100$ consecutive natural numbers $a_{1},$ $a_{2},$ $...,$ $a_{100}.$ Determine the last two digits of the number $a_{1}^{8}+a_{2}^{8}+...+a_{100}^{8}.$

2017 Costa Rica - Final Round, N2

Tags: digit , number theory

A positive integer is said to be "nefelibata" if, upon taking its last digit and placing it as the first digit, keeping the order of all the remaining digits intact (for example, 312 -> 231), the resulting number is exactly double the original number. Find the smallest possible nefelibata number.

2022 Cono Sur, 1

Tags: number theory , digit

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?

2011 May Olympiad, 5

Tags: number theory , digit , divisible

We consider all $14$-digit positive integers, divisible by $18$, whose digits are exclusively $ 1$ and $2$, but there are no consecutive digits $2$. How many of these numbers are there?

2007 Dutch Mathematical Olympiad, 3

Tags: number theory , divisible , digit

Does there exist an integer having the form $444...4443$ (all fours, and ending with a three) that is divisible by $13$? If so, give an integer having that form that is divisible by $13$, if not, prove that such an integer cannot exist.

2018 Ecuador Juniors, 5

Tags: number theory , remainder , digit

We call a positive integer [i]interesting [/i] if the number and the number with its digits written in reverse order both leave remainder $2$ in division by $4$. a) Determine if $2018$ is an interesting number. b) For every positive integer $n$, find how many interesting $n$-digit numbers there are.

1996 Austrian-Polish Competition, 1

Tags: number theory , divide , divisible , digit

Let $k \ge 1$ be a positive integer. Prove that there exist exactly $3^{k-1}$ natural numbers $n$ with the following properties: (i) $n$ has exactly $k$ digits (in decimal representation), (ii) all the digits of $n$ are odd, (iii) $n$ is divisible by $5$, (iv) the number $m = n/5$ has $k$ odd digits

2006 Switzerland - Final Round, 3

Tags: number theory , sum of digits , digit

Calculate the sum of digit of the number $$9 \times 99 \times 9999 \times ... \times \underbrace{ 99...99}_{2^n}$$ where the number of nines doubles in each factor.

1957 Moscow Mathematical Olympiad, 350

Tags: digit , number theory , distance

The distance between towns $A$ and $B$ is $999$ km. At every kilometer of the road that connects $A$ and $B$ a sign shows the distances to $A$ and $B$ as follows: $\fbox{0-999}$ , $\fbox{1-998}$ ,$\fbox{2-997}$ , $ . . . $ , $\fbox{998-1}$ , $\fbox{999-0}$ How many signs are there, with both distances written with the help of only two distinct digits?

1981 Brazil National Olympiad, 2

Tags: number theory , digit , power of 2

Show that there are at least $3$ and at most $4$ powers of $2$ with $m$ digits. For which $m$ are there $4$?

2010 Singapore Junior Math Olympiad, 2

Tags: digit , multiple , number theory

Find the sum of all the $5$-digit integers which are not multiples of $11$ and whose digits are $1, 3, 4, 7, 9$.

1969 All Soviet Union Mathematical Olympiad, 117

Tags: digit , sequence , algebra

Given a finite sequence of zeros and ones, which has two properties: a) if in some arbitrary place in the sequence we select five digits in a row and also select five digits in any other place in a row, then these fives will be different (they may overlap); b) if you add any digit to the right of the sequence, then property (a) will no longer hold true. Prove that the first four digits of our sequence coincide with the last four

2016 Puerto Rico Team Selection Test, 2

Tags: number theory , digit

Determine all $6$-digit numbers $(abcdef)$ such that $(abcdef) = (def)^2$ where $(x_1x_2...x_n)$ is not a multiplication but a number of $n$ digits.

2017 Romania National Olympiad, 4

Tags: number theory , prime , digit , prime number

Find all prime numbers with $n \ge 3$ digits, having the property: for every $k \in \{1, 2, . . . , n -2\}$, deleting any $k$ of its digits leaves a prime number.

1982 Austrian-Polish Competition, 4

Tags: number theory , sequence , recurrence relation , bounded , unbounded , digit , product of digits

Let $P(x)$ denote the product of all (decimal) digits of a natural number $x$. For any positive integer $x_1$, define the sequence $(x_n)$ recursively by $x_{n+1} = x_n + P(x_n)$. Prove or disprove that the sequence $(x_n)$ is necessarily bounded.

1969 IMO Longlists, 40

Tags: combinatorics , decimal representation , counting , digit

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

VMEO IV 2015, 12.4

Tags: binary representation , sum , number theory , digit

We call the [i]tribi [/i] of a positive integer $k$ (denoted $T(k)$) the number of all pairs $11$ in the binary representation of $k$. e.g $$T(1)=T(2)=0,\, T(3)=1, \,T(4)=T(5)=0,\,T(6)=1,\,T(7)=2.$$ Calculate $S_n=\sum_{k=1}^{2^n}T(K)$.

1998 All-Russian Olympiad Regional Round, 8.1

Tags: number theory , digit

Are there $n$-digit numbers M and N such that all digits $M$ are even, all $N$ digits are odd, every digit from $0$ to $9$ occurs in decimal notation M or N at least once, and $M$ is divisible by $N$?

2004 All-Russian Olympiad Regional Round, 11.6

Tags: number theory , digit , combinatorics

Let us call the [i]distance [/i] between the numbers $\overline{a_1a_2a_3a_4a_5}$ and $\overline{b_1b_2b_3b_4b_5}$ the maximum $i$ for which $a_i \ne b_i$. All five-digit numbers are written out one after another in some order. What is the minimum possible sum of distances between adjacent numbers?

2009 Postal Coaching, 4

Tags: digit , remainder , number theory

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.

2004 Austria Beginners' Competition, 1

Tags: number theory , digit

Find the smallest four-digit number that when divided by $3$ gives a four-digit number with the same digits. (Note: Four digits means that the thousand Unit digit must not be $0$.)

2001 Estonia Team Selection Test, 5

Tags: product , power , number theory , digit , prime

Find the exponent of $37$ in the representation of the number $111...... 11$ with $3\cdot 37^{2000}$ digits equals to $1$, as product of prime powers