Find all positive integers $n$ for which there exists an integer multiple of $2022$ such that the sum of the squares of its digits is equal to $n$.

How many three-digit positive integers have an odd number of even digits? $\textbf{(A) }150\qquad\textbf{(B) }250\qquad\textbf{(C) }350\qquad\textbf{(D) }450\qquad\textbf{(E) }550$

John had to solve a math problem in the class. While cleaning the blackboard, he accidentally erased a part of his problem as well: the text that remained on board was $37 \cdot(72 + 3x) = 14**45$, where $*$ marks an erased digit. Show that John can still solve his problem, knowing that $x$ is an integer

Alberto wants to invite Ximena to his house. Since Alberto knows that Ximena is amateur to mathematics, instead of pointing out exactly which Transantiago buses serve him, he tells him: [i]the numbers of the buses that take me to my house have three digits, where the leftmost digit is not null, furthermore, these numbers are multiples of $13$, and the second digit of them is the average of the other two.[/i] What are the bus lines that go to Alberto's house?

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.

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

For some positive integer $n$, Katya wrote on the board next to each other numbers $2^n$ and $14^n$ (in this order), thus forming a new number $A$. Can the number $A - 1$ be prime? [i]Proposed by Oleksii Masalitin[/i]

How many different numbers with $6$ digits and multiples of $45$ can be written by adding one digit to the left and one to the right of $2008$?

Sunny wants to send some secret message to usjl. The secret message is a three digit number, where each digit is one digit from $0$ to $9$ (so $000$ is also possibly the secret message). However, when Sunny sends the message to usjl, at most one digit might be altered. Therefore, Sunny decides to send usjl a longer message so that usjl can decipher the message to get the original secret message Sunny wants to send. Sunny and usjl can communicate the strategy beforehand. Show that sending a $4$-digit message does not suffice. Also show that sending a $6$-digit message suffices. If it is deduced that sending a $c$-digit message suffices for some $c>6$, then partial credits may be awarded.

We have an integer $A$ such that $A^2$ is a four digit number, with $5$ in the ten's place . Find all possible values of $A$.

Consider the number $\left(101^2-100^2\right)\cdot\left(102^2-101^2\right)\cdot\left(103^2-102^2\right)\cdot...\cdot\left(200^2-199^2\right)$. [list=a] [*] Determine its units digit. [*] Determine its tens digit. [/list]

A clue “$k$ digits, sum is $n$” gives a number k and the sum of $k$ distinct, nonzero digits. An answer for that clue consists of $k$ digits with sum $n$. For example, the clue “Three digits, sum is $23$” has only one answer: $6,8,9$. The clue “Three digits, sum is $8$” has two answers: $1,3,4$ and $1,2,5$. If the clue “Four digits, sum is $n$” has the largest number of answers for any four-digit clue, then what is the value of $n$? How many answers does this clue have? Explain why no other four-digit clue can have more answers.

The set of three-digit natural numbers formed from digits $1,2, 3, 4, 5, 6$ is called [i]nice [/i] if it satisfies the following condition: for any two different digits from $1, 2, 3, 4, 5, 6$ there exists a number from the set which contains both of them. For any nice set we calculate the sum of all its elements. Determine the smallest possible value of these sums. (E. Barabanov)

A natural number of five digits is called [i]Ecuadorian [/i]if it satisfies the following conditions: $\bullet$ All its digits are different. $\bullet$ The digit on the far left is equal to the sum of the other four digits. Example: $91350$ is an Ecuadorian number since $9 = 1 + 3 + 5 + 0$, but $54210$ is not since $5 \ne 4 + 2 + 1 + 0$. Find how many Ecuadorian numbers exist.

For every three-digit number, we take the product of its three digits. Then we add all of these products together. What is the result? (G Galperin)

What is the smallest positive multiple of $225$ that can be written using digits $0$ and $1$ only?

Find the sum of all distinct four-digit numbers that contain only the digits $1, 2, 3, 4,5$, each at most once.

Find the smallest multiple of $81$ that only contains the digit $1$. How many $ 1$’s does it contain?

Determine the number of positive integers $N = \overline{abcd}$, with $a, b, c, d$ nonzero digits, which satisfy $(2a -1) (2b -1) (2c- 1) (2d - 1) = 2abcd -1$.

Is there such a natural number that the product of all its natural divisors (including $1$ and the number itself) ends exactly in $2001$ zeros?

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

Let $x, y$ be two positive integers, with $x> y$, such that $2n = x + y$, where n is a number two-digit integer. If $\sqrt{xy}$ is an integer with the digits of $n$ but in reverse order, determine the value of $x - y$

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

For a fixed $k$ with $4 \le k \le 9$ consider the set of all positive integers with $k$ decimal digits such that each of the digits from $1$ to $k$ occurs exactly once. Show that it is possible to partition this set into two disjoint subsets such that the sum of the cubes of the numbers in the first set is equal to the sum of the cubes in the second set.

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.