Olympiad problems

2004 Germany Team Selection Test, 3

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]

2012 Danube Mathematical Competition, 2

Tags: number theory , decimal representation , decimal , coprime

Consider the natural number prime $p, p> 5$. From the decimal number $\frac1p$, randomly remove $2012$ numbers, after the comma. Show that the remaining number can be represented as $\frac{a}{b}$ , where $a$ and $b$ are coprime numbers , and $b$ is multiple of $p$.

1989 Bundeswettbewerb Mathematik, 1

Tags: rational , decimal representation , periodic , number theory

For a given positive integer $n$, let $f(x) =x^{n}$. Is it possible for the decimal number $$0.f(1)f(2)f(3)\ldots$$ to be rational? (Example: for $n=2$, we are considering $0.1491625\ldots$)

1982 Bundeswettbewerb Mathematik, 1

Tags: divisor , decimal representation , algebra

Max divided a natural number $p$ by a natural number $q \leq 100$. In the decimal representation of the quotient he calculated, the sequence of digits $1982$ occurs somewhere after the decimal point. Show that Max made a computational mistake.

2004 IMO Shortlist, 5

Tags: induction , modular arithmetic , number theory , decimal representation

We call a positive integer [i]alternating[/i] if every two consecutive digits in its decimal representation are of different parity. Find all positive integers $n$ such that $n$ has a multiple which is alternating.

1951 Moscow Mathematical Olympiad, 193

Tags: decimal representation , algebra

Prove that the first 3 digits after the decimal point in the decimal expression of the number $\frac{0.123456789101112 . . . 495051}{0.515049 . . . 121110987654321}$ are $239$.

2018 Federal Competition For Advanced Students, P1, 3

Tags: combinatorics , game , number theory , decimal representation , digit

Alice and Bob determine a number with $2018$ digits in the decimal system by choosing digits from left to right. Alice starts and then they each choose a digit in turn. They have to observe the rule that each digit must differ from the previously chosen digit modulo $3$. Since Bob will make the last move, he bets that he can make sure that the final number is divisible by $3$. Can Alice avoid that? [i](Proposed by Richard Henner)[/i]

1991 IMO Shortlist, 15

Tags: factorial , modular arithmetic , periodic sequence , decimal representation , digit

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?

2016 Bundeswettbewerb Mathematik, 1

Tags: prime number , decimal representation , number theory

A number with $2016$ zeros that is written as $101010 \dots 0101$ is given, in which the zeros and ones alternate. Prove that this number is not prime.

1990 IMO Shortlist, 20

Tags: pigeonhole principle , number theory , decimal representation , divisibility , multiple , digit

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.

1978 IMO, 1

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

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.

1980 IMO Shortlist, 6

Tags: modular arithmetic , decimal representation , digit , combinatorics

Find the digits left and right of the decimal point in the decimal form of the number \[ (\sqrt{2} + \sqrt{3})^{1980}. \]

1966 IMO Shortlist, 12

Tags: number theory , decimal representation , equation

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.

1962 IMO, 1

Tags: number theory , decimal representation , divisibility

Find the smallest natural number $n$ which has the following properties: a) Its decimal representation has a 6 as the last digit. b) If the last digit 6 is erased and placed in front of the remaining digits, the resulting number is four times as large as the original number $n$.

2012 Ukraine Team Selection Test, 6

Tags: irrational number , irrational , digit , decimal representation , algebra

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.

1970 IMO Shortlist, 2

Tags: inequalities , algebra , decimal representation , digit

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

1999 IMO Shortlist, 5

Tags: number theory , decimal representation , sum of digits

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

2003 IMO Shortlist, 2

Tags: number theory , decimal representation , algorithm , combinatorics

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]

2023 CIIM, 2

Tags: combinatorics , dice , decimal representation

A toymaker has $k$ dice at his disposal, each with $6$ blank sides. On each side of each of these dice, the toymaker must draw one of the digits $0, 1, 2, \ldots , 9$. Determine (in terms of $k$) the largest integer $n$ such that the toymaker can draw digits on the $k$ dice such that, for any positive integer $r \leq n$, it is possible to choose some of the $k$ dice and form with them the decimal representation of $r$. [b]Note:[/b] The digits 6 and 9 are distinguishable: they appear as [u]6[/u] and [u]9[/u].

1940 Moscow Mathematical Olympiad, 056

Tags: decimal representation , number theory , factorial

How many zeros does $100!$ have at its end in the usual decimal representation?

1986 China Team Selection Test, 3

Tags: algebra , number theoretic functions , decimal representation , digit

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