Olympiad problems

PEN A Problems, 103

When $4444^{4444}$ is written in decimal notation, the sum of its digits is $ A.$ Let $B$ be the sum of the digits of $A.$ Find the sum of the digits of $ B.$ ($A$ and $B$ are written in decimal notation.)

1989 Chile National Olympiad, 1

Tags: number theory , sum of digits , digit

Writing $1989$ in base $b$, we obtain a three-digit number: $xyz$. It is known that the sum of the digits is the same in base $10$ and in base $b$, that is, $1 + 9 + 8 + 9 = x + y + z$. Determine $x,y,z,b.$

2018 Junior Regional Olympiad - FBH, 2

Tags: blackboard , digit , original number

On blackboard is written $3$ digit number so all three digits are distinct than zero. Out of it, we made three $2$ digit numbers by crossing out first digit of original number, crossing out second digit of original number and crossing out third digit of original number. Sum of those three numbers is $293$. Which number is written on blackboard?

2011 Portugal MO, 1

Tags: number theory , digit

A nine-digit telephone number [i]abcdefghi [/i] is called [i]memorizable [/i] if the sequence of four initial digits [i]abcd [/i] is repeated in the sequence of the final five digits [i]efghi[/i]. How many [i]memorizable [/i] numbers of nine digits exist?

1972 All Soviet Union Mathematical Olympiad, 168

Tags: digit , game strategy

A game for two. One gives a digit and the second substitutes it instead of a star in the following difference: $$**** - **** = $$ Then the first gives the next digit, and so on $8$ times. The first wants to obtain the greatest possible difference, the second -- the least. Prove that: 1. The first can operate in such a way that the difference would be not less than $4000$, not depending on the second's behaviour. 2. The second can operate in such a way that the difference would be not greater than $4000$, not depending on the first's behaviour.

1993 Czech And Slovak Olympiad IIIA, 4

Tags: sum of powers , digit , sum , number theory , sequence

The sequence ($a_n$) of natural numbers is defined by $a_1 = 2$ and $a_{n+1}$ equals the sum of tenth powers of the decimal digits of $a_n$ for all $n \ge 1$. Are there numbers which appear twice in the sequence ($a_n$)?

1999 Cono Sur Olympiad, 4

Tags: number theory , coloring , multiple , digit

Let $A$ be a six-digit number, three of which are colored and equal to $1, 2$, and $4$. Prove that it is always possible to obtain a number that is a multiple of $7$, by performing only one of the following operations: either delete the three colored figures, or write all the numbers of $A$ in some order.

2017 Hanoi Open Mathematics Competitions, 4

Tags: digit , number theory , last

Put $S = 2^1 + 3^5 + 4^9 + 5^{13} + ... + 505^{2013} + 506^{2017}$. The last digit of $S$ is (A): $1$ (B): $3$ (C): $5$ (D): $7$ (E): None of the above.

2017 May Olympiad, 1

Tags: number theory , digit

We shall call a positive integer [i]ascending [/i] if its digits read from left to right they are in strictly increasing order. For example, $458$ is ascending and $2339$ is not. Find the largest ascending number that is a multiple of $56$.

1956 Putnam, A2

Tags: number theory , digit

Prove that every positive integer has a multiple whose decimal representation involves all ten digits.

2013 Flanders Math Olympiad, 1

Tags: number theory , digit , divisible , sum

A six-digit number is [i]balanced [/i] when all digits are different from zero and the sum of the first three digits is equal to the sum of the last three digits. Prove that the sum of all six-digit balanced numbers is divisible by $13$.

1994 Tournament Of Towns, (403)

Tags: number theory , digit

A schoolgirl forgot to write a multiplication sign between two $3$-digit numbers and wrote them as one number. This $6$-digit result proved to be $3$ times greater than the product (obtained by multiplication). Find these numbers. (A Kovaldzhi,

2013 Argentina National Olympiad, 3

Tags: digit , number theory , remainder

Find how many are the numbers of $2013$ digits $d_1d_2…d_{2013}$ with odd digits $d_1,d_2,…,d_{2013}$ such that the sum of $1809$ terms $$d_1 \cdot d_2+d_2\cdot d_3+…+d_{1809}\cdot d_{1810}$$ has remainder $1$ when divided by $4$ and the sum of $203$ terms $$d_{1810}\cdot d_{1811}+d_{1811}\cdot d_{1812}+…+d_{2012}\cdot d_{2013}$$ has remainder $1$ when dividing by $4$.

1974 Swedish Mathematical Competition, 3

Tags: number theory , recurrence relation , last digit , digit

Let $a_1=1$, $a_2=2^{a_1}$, $a_3=3^{a_2}$, $a_4=4^{a_3}$, $\dots$, $a_9 = 9^{a_8}$. Find the last two digits of $a_9$.

2016 India PRMO, 3

Tags: number theory , sum of digits , digit , algebra

Suppose $N$ is any positive integer. Add the digits of $N$ to obtain a smaller integer. Repeat this process of digit-addition till you get a single digit numbem. Find the number of positive integers $N \le 1000$, such that the final single-digit number $n$ is equal to $5$. Example: $N = 563\to (5 + 6 + 3) = 14 \to(1 + 4) = 5$ will be counted as one such integer.

2015 May Olympiad, 1

Tags: number theory , digit

The teacher secretly thought of a three-digit $S$ number. Students $A, B, C$ and $D$ tried to guess, saying, respectively, $541$, $837$, $291$ and $846$. The teacher told them, “Each of you got it right exactly one digit of $S$ and in the correct position ”. What is the number $S$?

1968 Leningrad Math Olympiad, 8.6*

Tags: number theory , combinatorics , digit

All $10$-digit numbers consisting of digits $1, 2$ and $3$ are written one under the other. Each number has one more digit added to the right. $1$, $2$ or $3$, and it turned out that to the number $111. . . 11$ added $1$ to the number $ 222. . . 22$ was assigned $2$, and the number $333. . . 33$ was assigned $3$. It is known that any two numbers that differ in all ten digits have different digits assigned to them. Prove that the assigned column of numbers matches with one of the ten columns written earlier.

2010 Saudi Arabia Pre-TST, 1.3

Tags: number theory , divide , digit , divisible

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

Kvant 2019, M2543

Tags: number theory , digit

Let $a$ and $b$ be 2019-digit numbers. Exactly 12 digits of $a$ are non-zero: the five leftmost and seven rightmost, and exactly 14 digits of $b$ are non-zero: the five leftmost and nine rightmost. Prove that the largest common divisor of $a$ and $b$ has no more than 14 digits. [i]Proposed by L. Samoilov[/i]

2009 Tournament Of Towns, 3

Tags: minimum , digit , number theory , combinatorics

Alex is going to make a set of cubical blocks of the same size and to write a digit on each of their faces so that it would be possible to form every $30$-digit integer with these blocks. What is the minimal number of blocks in a set with this property? (The digits $6$ and $9$ do not turn one into another.)

2020 Colombia National Olympiad, 1

Tags: number theory , digit , perfect square

A positive integer is called [i]sabroso [/i]if when it is added to the number obtained when its digits are interchanged from one side of its written form to the other, the result is a perfect square. For example, $143$ is sabroso, since $143 + 341 =484 = 22^2$. Find all two-digit sabroso numbers.

1955 Poland - Second Round, 2

Tags: number theory , digit

Find the natural number $ n $ knowing that the sum $$ 1 + 2 + 3 + \ldots + n$$ is a three-digit number with identical digits.

2025 Bundeswettbewerb Mathematik, 2

Tags: factorial , digit , number theory

For each integer $n \ge 2$ we consider the last digit different from zero in the decimal expansion of $n!$. The infinite sequence of these digits starts with $2,6,4,2,2$. Determine all digits which occur at least once in this sequence, and show that each of those digits occurs in fact infinitely often.

1999 All-Russian Olympiad Regional Round, 9.1

Tags: number theory , digit

All natural numbers from $1$ to $N$, $ N \ge 2$ are written out in a certain order in a circle. Moreover, for any pair of neighboring numbers there is at least one digit appearing in the decimal notation of each of them. Find the smallest possible value of $N$.

2013 Tournament of Towns, 2

Tags: digit , number theory , composite

Does there exist a ten-digit number such that all its digits are different and after removing any six digits we get a composite four-digit number?