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

2008 Regional Olympiad of Mexico Center Zone, 5

Each positive integer number $n \ ge 1$ is assigned the number $p_n$ which is the product of all its non-zero digits. For example, $p_6 = 6$, $p_ {32} = 6$, $p_ {203} = 6$. Let $S = p_1 + p_2 + p_3 + \dots + p_ {999}$. Find the largest prime that divides $S $.

2018 Bundeswettbewerb Mathematik, 1

Find the largest positive integer with the property that each digit apart from the first and the last one is smaller than the arithmetic mean of her neighbours.

2015 May Olympiad, 4

We say that a number is [i]superstitious [/i] when it is equal to $13$ times the sum of its digits . Find all superstitious numbers.

2021 Polish Junior MO First Round, 1

Is there a six-digit number where every two consecutive digits make up a certain number two-digit number that is the square of an integer? Justify your answer.

2019 Saudi Arabia JBMO TST, 3

Let $6$ pairwise different digits are given and all of them are different from $0$. Prove that there exist $2$ six-digit integers, such that their difference is equal to $9$ and each of them contains all given $6$ digits.

1990 IMO Longlists, 98

Find all natural numbers $ n$ for which every natural number whose decimal representation has $ n \minus{} 1$ digits $ 1$ and one digit $ 7$ is prime.

2000 Czech And Slovak Olympiad IIIA, 6

Find all four-digit numbers $\overline{abcd}$ (in decimal system) such that $\overline{abcd}= (\overline{ac}+1).(\overline{bd} +1)$

1990 IMO Shortlist, 8

For a given positive integer $ k$ denote the square of the sum of its digits by $ f_1(k)$ and let $ f_{n\plus{}1}(k) \equal{} f_1(f_n(k)).$ Determine the value of $ f_{1991}(2^{1990}).$

2011 Tournament of Towns, 5

We will call a positive integer [i]good [/i] if all its digits are nonzero. A good integer will be called [i]special [/i] if it has at least $k$ digits and their values strictly increase from left to right. Let a good integer be given. At each move, one may either add some special integer to its digital expression from the left or from the right, or insert a special integer between any two its digits, or remove a special number from its digital expression.What is the largest $k$ such that any good integer can be turned into any other good integer by such moves?

2009 Tournament Of Towns, 3

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

2008 BAMO, 1

Call a year [i]ultra-even[/i] if all of its digits are even. Thus $2000,2002,2004,2006$, and $2008$ are all [i]ultra-even[/i] years. They are all $2$ years apart, which is the shortest possible gap. $2009$ is not an [i]ultra-even[/i] year because of the $9$, and $2010$ is not an ultra-even year because of the $1$. (a) In the years between the years $1$ and $10000$, what is the longest possible gap between two [i]ultra-even[/i] years? Give an example of two ultra-even years that far apart with no [i]ultra-even[/i] years between them. Justify your answer. (b) What is the second-shortest possible gap (that is, the shortest gap longer than $2$ years) between two [i]ultra-even[/i] years? Again, give an example, and justify your answer.

2024 Malaysian Squad Selection Test, 2

A finite sequence of decimal digits from $\{0,1,\cdots, 9\}$ is said to be [i]common[/i] if for each sufficiently large positive integer $n$, there exists a positive integer $m$ such that the expansion of $n$ in base $m$ ends with this sequence of digits. For example, $0$ is common because for any large $n$, the expansion of $n$ in base $n$ is $10$, whereas $00$ is not common because for any squarefree $n$, the expansion of $n$ in any base cannot end with $00$. Determine all common sequences. [i]Proposed by Wong Jer Ren[/i]

2018 India PRMO, 20

Determine the sum of all possible positive integers $n, $ the product of whose digits equals $n^2 -15n -27$.

2012 Bosnia and Herzegovina Junior BMO TST, 2

Let $\overline{abcd}$ be $4$ digit number, such that we can do transformations on it. If some two neighboring digits are different than $0$, then we can decrease both digits by $1$ (we can transform $9870$ to $8770$ or $9760$). If some two neighboring digits are different than $9$, then we can increase both digits by $1$ (we can transform $9870$ to $9980$ or $9881$). Can we transform number $1220$ to: $a)$ $2012$ $b)$ $2021$

2021 BMT, 5

Tags: counting , Digits , Bmt
How many three-digit numbers $\underline{abc}$ have the property that when it is added to $\underline{cba}$, the number obtained by reversing its digits, the result is a palindrome? (Note that $\underline{cba}$ is not necessarily a three-digit number since before reversing, $c$ may be equal to $0$.)

2002 Germany Team Selection Test, 3

Prove that there is no positive integer $n$ such that, for $k = 1,2,\ldots,9$, the leftmost digit (in decimal notation) of $(n+k)!$ equals $k$.

1996 May Olympiad, 2

Considering the three-digit natural numbers, how many of them, when adding two of their digits, are double of their remainder? Justify your answer.

1968 German National Olympiad, 4

Sixteen natural numbers written in the decimal system may form a geometric sequence, of which the first five members have nine digits, five further members have ten digits, four members have eleven digits and two terms have twelve digits. Prove that there is exactly one sequence with these properties.

2001 May Olympiad, 1

Sara wrote on the board an integer with less than thirty digits and ending in $2$. Celia erases the $2$ from the end and writes it at the beginning. The number that remains written is equal to twice the number that Sara had written. What number did Sara write?

2020 HK IMO Preliminary Selection Contest, 4

Tags: Digits , algebra
In a game, a participant chooses a nine-digit positive integer $\overline{ABCDEFGHI}$ with distinct non-zero digits. The score of the participant is $A^{B^{C^{D^{E^{F^{G^{H^{I}}}}}}}}$. Which nine-digit number should be chosen in order to maximise the score?

1999 Portugal MO, 1

A number is said to be [i]balanced [/i] if one of its digits is average of the others. How many [i]balanced [/i]$3$-digit numbers are there?

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

2000 Tuymaada Olympiad, 1

Given the number $188188...188$ (number $188$ is written $101$ times). Some digits of this number are crossed out. What is the largest multiple of $7$, that could happen?

2000 Greece JBMO TST, 1

a) Prove that the fraction $\frac{3n+5}{2n+3}$ is irreducible for every $n \in N$ b) Let $x,y$ be digits of decimal representation system with $x>0$, and $\frac{\overline{xy}+12}{\overline{xy}-3}\in N$, prove that $x+y=9$. Is the converse true?

2019 Girls in Mathematics Tournament, 3

We say that a positive integer N is [i]nice[/i] if it satisfies the following conditions: $\bullet$ All of its digits are $1$ or $2$ $\bullet$ All numbers formed by $3$ consecutive digits of $N$ are distinct. For example, $121222$ is nice, because the $4$ numbers formed by $3$ consecutive digits of $121222$, which are $121,212,122$ and $222$, are distinct. However, $12121$ is not nice. What is the largest quantity possible number of numbers that a nice number can have? What is the greatest nice number there is?