Tiham is trying to find [b]6[/b] digit positive integers$ PQRSTU$ (where $PQRSTU $are not necessarily distinct). But he only wants the numbers where the sum of the [b]3[/b] digit number$ PQR$, and the [b]3[/b] digit number $STU$ is divisible by [b]37[/b]. How many such numbers Tiham can find?

The numbers from $1$ through $100$ are written in some order on a circle. We call a pair of numbers on the circle [i]good [/i] if the two numbers are not neighbors on the circle and if at least one of the two arcs they determine on the circle only contains numbers smaller then both of them. What may be the total number of good pairs on the circle.

A [i]figuric [/i] is a convex polyhedron with $26^{5^{2019}}$ faces. On every face of a figuric we write down a number. When we throw two figurics (who don't necessarily have the same set of numbers on their sides) into the air, the figuric which falls on a side with the greater number wins; if this number is equal for both figurics, we repeat this process until we obtain a winner. Assume that a figuric has an equal probability of falling on any face. We say that one figuric rules over another if when throwing these figurics into the air, it has a strictly greater probability to win than the other figuric (it can be possible that given two figurics, no figuric rules over the other). Milisav and Milojka both have a blank figuric. Milisav writes some (not necessarily distinct) positive integers on the faces of his figuric so that they sum up to $27^{5^{2019}}$. After this, Milojka also writes positive integers on the faces of her figuric so that they sum up to $27^{5^{2019}}$. Is it always possible for Milojka to create a figuric that rules over Milisav's? [i]Proposed by Bojan Basic[/i]

What is the largest factor of $130000$ that does not contain the digit $0$ or $5$?

A beetle crawls along the edges of an $n$-lateral pyramid, starting and ending at the midpoint $A$ of a base edge and passing through each point at most once. How many ways are there for the beetle to do this (two ways are said to be equal if they go through the same vertices)? Show that the sum of the numbers of passed vertices (over all these ways) equals $1^2 +2^2 +\ldots +n^2. $

Determine the number of real solutions to the equation $\sqrt{2 -x^2} = \sqrt[3]{3 -x^3}.$

Let $n$ be a positive integer and $M=\{1,2,\ldots, n\}.$ A subset $T\subset M$ is called [i]heavy[/i] if each of its elements is greater or equal than $|T|.$ Let $f(n)$ denote the number of heavy subsets of $M.$ Describe a method for finding $f(n)$ and use it to calculate $f(32).$

A nine-digit number has the form $\overline{6ABCDEFG3}$, where every three consecutive digits sum to $13$. Find $D$. [i]Proposed by Levi Iszler[/i]

For each positive integer $n$ and non-negative integer $k$, define $W(n,k)$ recursively by \[ W(n,k) = \begin{cases} n^n & k = 0 \\ W(W(n,k-1), k-1) & k > 0. \end{cases} \] Find the last three digits in the decimal representation of $W(555,2)$.

You have 2020 piles of coins in front Of you. The first pile contains 1 coin, the second pile contains 2 coins, the third pile contains 3 coins and so on. So, the 2020th pile contains 2020 coins. Guess a positive integer[b] k[/b], in which piles contain at least[b] k [/b]coins, take away exact[b] k[/b] coins from these piles. Find the [b]minimum number of turns[/b] you need to take way all of these coins?

The numbers $0, 1, 2, . . . , 9$ are written (in some order) on the circumference. Prove that a) there are three consecutive numbers with the sum being at least $15$, b) it is not necessarily the case that there exist three consecutive numbers with the sum more than $15$.

Find the number of positive integer $x$ that has $ {a}_{1},{a}_{2},\cdot \cdot \cdot {a}_{20} $ which follows the following ($x \ge 1000$) 1) $ {a}_{1}=2, {a}_{2}=1, {a}_{3}=x $ 2) for positive integer $n$, ($ 4 \le n \le 20 $), $ {a}_{n}={a}_{n-3}+\frac{(-2)^n}{{a}_{n-1}{a}_{n-2}} $

For a positive integer $n$, let $f(n)$ be the number obtained by writing $n$ in binary and replacing every 0 with 1 and vice versa. For example, $n=23$ is 10111 in binary, so $f(n)$ is 1000 in binary, therefore $f(23) =8$. Prove that \[\sum_{k=1}^n f(k) \leq \frac{n^2}{4}.\] When does equality hold? (Proposed by Stephan Wagner, Stellenbosch University)

On circle there are $2009$ positive integers which sum is $7036$. Show that it is possible to find two pairs of neighboring numbers such that sum of both pairs is greater or equal to $8$

Let $p>2$ be a prime and $a,b$ positive integers such that \[\frac ab=1+\frac12+\frac13+\cdots+\frac{1}{p-1}.\] Show that $p$ is a divisor of $a.$

Determine how many two-digit numbers satisfy the following property: when the number is added to the number obtained by reversing its digits, the sum is $132.$ $\textbf{(A) }5\qquad\textbf{(B) }7\qquad\textbf{(C) }9\qquad\textbf{(D) }11\qquad \textbf{(E) }12$

What is the largest factor of $130000$ that does not contain the digit $0$ or $5$?

A board $n \times n$ is divided into $n^2$ unit squares and a number is written in each unit square. Such a board is called [i] interesting[/i] if the following conditions hold: $\circ$ In all unit squares below the main diagonal, the number $0$ is written; $\circ$ Positive integers are written in all other unit squares. $\circ$ When we look at the sums in all $n$ rows, and the sums in all $n$ columns, those $2n$ numbers are actually the numbers $1,2,...,2n$ (not necessarily in that order). $a)$ Determine the largest number that can appear in a $6 \times 6$ [i]interesting[/i] board. $b)$ Prove that there is no [i]interesting[/i] board of dimensions $7\times 7$.