Paul starts with the number $19$. In one step, he can add $1$ to his number, divide his number by $2$, or divide his number by $3$. What is the minimum number of steps Paul needs to get to $1$?

[b]p1.[/b] A Slavic dragon has three heads. A knight fights the dragon. If the knight cuts off one dragon’s head three new heads immediately grow. Is it possible that the dragon has $2018$ heads at some moment of the fight? [b]p2.[/b] Peter has two squares $3\times 3$ and $4\times 4$. He must cut one of them or both of them in no more than four parts in total. Is Peter able to assemble a square using all these parts? [b]p3.[/b] Usually, dad picks up Constantine after his music lessons and they drive home. However, today the lessons have ended earlier and Constantine started walking home. He met his dad $14$ minutes later and they drove home together. They arrived home $6$ minutes earlier than usually. Home many minutes earlier than usual have the lessons ended? Please, explain your answer. [b]p4.[/b] All positive integers from $1$ to $2018$ are written on a blackboard. First, Peter erased all numbers divisible by $7$. Then, Natalie erased all remaining numbers divisible by $11$. How many numbers did Natalie remove? Please, explain your answer. [b]p5.[/b] $30$ students took part in a mathematical competition consisting of four problems. $25$ students solved the first problem, $24$ students solved the second problem, $22$ students solved the third, and, finally, $21$ students solved the fourth. Show that there are at least two students who solved all four problems. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A positive integer is called simple if its ordinary decimal representation consists entirely of zeroes and ones. Find the least positive integer $k$ such that each positive integer $n$ can be written as $n = a_1 \pm a_2 \pm a_3 \pm \cdots \pm a_k$ where $a_1, \dots , a_k$ are simple.

A possitive integer is called [i]special[/i] if all its decimal digits are equal and it can be represented as the sum of squares of three consecutive odd integers. (a) Find all $4$-digit [i]special[/i] numbers (b) Are there $2000$-digit [i]special[/i] numbers?

Let $S$ be the set of integers between $1$ and $2^{40}$ whose binary expansions have exactly two $1$'s. If a number is chosen at random from $S$, the probability that it is divisible by $9$ is $p/q$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$.

Find all perfect squares $n$ such that if the positive integer $a\ge 15$ is some divisor $n$ then $a+15$ is a prime power. [i]Proposed by Saudi Arabia[/i]

For a positive integer $n,$ let $f(n)$ be the number of integers $m$ satisfying $0 \le m \le n - 1$ such that there exists an integer solution to the congruence $x^2 \equiv m \pmod{n}.$ It is given that as $k$ goes to $\infty,$ the value of $f(225^k)/225^k$ converges to some rational number $p/q,$ where $p,q$ are relatively prime positive integers. Find $p + q.$

It is given a graph whose vertices are positive integers and an edge between numbers $a$ and $b$ exists if and only if $a + b + 1 | a^2 + b^2 + 1$. Is this graph connected?

Find minimum number $n$ that: 1) $80|n$ 2) we can permute 2 different numbers in $n$ to get $m$ and $80|m$

Prove that among any $16$ perfect cubes we can always find two cubes whose difference is divisible by $91$.

Petro and Vasyl play the following game. They take turns making moves and Petro goes first. In one turn, a player chooses one of the numbers from $1$ to $2024$ that wasn't selected before and writes it on the board. The first player after whose turn the product of the numbers on the board will be divisible by $2024$ loses. Who wins if every player wants to win? [i]Proposed by Mykhailo Shtandenko[/i]

Find all prime numbers $p, q, r$ such that \[15p+7pq+qr=pqr.\]

For how many ordered triplets of three positive integers is it true that their product is four more than twice their sum?

We say that the set of step lengths $D\subset \mathbb{Z}_+=\{1,2,\ldots\}$ is [i]excellent[/i] if it has the following property: If we split the set of integers into two subsets $A$ and $\mathbb{Z}\setminus{A}$, at least other set contains element $a-d,a,a+d$ (i.e. $\{a-d,a,a+d\} \subset A$ or $\{a-d,a,a+d\}\in \mathbb{Z}\setminus A$ from some integer $a\in \mathbb{Z},d\in D$.) For example the set of one element $\{1\}$ is not excellent as the set of integer can be split into even and odd numbers, and neither of these contains three consecutive integer. Show that the set $\{1,2,3,4\}$ is excellent but it has no proper subset which is excellent.

A positive integer is called [i]powerful [/i]if all exponents in its prime factorization are $\ge 2$. Prove that there are infinitely many pairs of powerful consecutive positive integers. [i](Walther Janous)[/i]

* Prove that a number of the form $2^n$ for a positive integer $n$ may begin with any given combination of digits.

Let $m$ and $n$ be positive integers such that $5$ divides $2^n + 3^m$. Prove that $5$ divides $2^m + 3^n$.

Prove that if a,b,c are integers with $a+b+c=0$, then $2a^4+2b^4+2c^4$ is a perfect square.

(a) Find a pair of integers (x,y) such that $15x^2 +y^2 = 2^{2000}$ (b) Does there exist a pair of integers $(x,y)$ such that $15x^2 + y^2 = 2^{2000}$ and $x$ is odd?

$7.$ Let $E(n)$ denote the sum of even digits of $n.$ For example, $E(1243)=2+4=6.$ What is the value of $E(1)+E(2)+E(3)+...+E(100) ?$

Let $a$, $b$ $c$ be the natural numbers, such that every digit occurs exactly the same number of times in each of the numbers $a$, $b$, $c$. Is it possible that $a + b + c = 10^{1001}$? Justify your answer.

A positive integer $n$ is [i]acceptable [/i] if the sum of the squares of its proper divisors is equal to $2n+4$ (a divisor of $n$ is [i]proper [/i] if it is different from $1$ and of $n$ ). Find all acceptable numbers less than $10000$,

Let $x $ and $y $ be positive integers such that $[x+2,y+2]-[x+1,y+1]=[x+1,y+1]-[x,y]$.Prove that one of the two numbers $x $ and $y $ divide the other. (Here $[a,b] $ denote the least common multiple of $a $ and $b $). Proposed by Dusan Djukic.

Let $ a>0$, and let $ P(x)$ be a polynomial with integer coefficients such that \[ P(1)\equal{}P(3)\equal{}P(5)\equal{}P(7)\equal{}a\text{, and}\] \[ P(2)\equal{}P(4)\equal{}P(6)\equal{}P(8)\equal{}\minus{}a\text{.}\] What is the smallest possible value of $ a$? $ \textbf{(A)}\ 105 \qquad \textbf{(B)}\ 315 \qquad \textbf{(C)}\ 945 \qquad \textbf{(D)}\ 7! \qquad \textbf{(E)}\ 8!$

[u]Round 5[/u] [b]p13.[/b] You have a $26 \times 26$ grid of squares. Color each randomly with red, yellow, or blue. What is the expected number (to the nearest integer) of $2 \times 2$ squares that are entirely red? [b]p14.[/b] Four snakes are boarding a plane with four seats. Each snake has been assigned to a different seat. The first snake sits in the wrong seat. Any subsequent snake will sit in their assigned seat if vacant, if not, they will choose a random seat that is available. What is the expected number of snakes who sit in their correct seats? [b]p15.[/b] Let $n \ge 1$ be an integer and $a > 0$ a real number. In terms of n, find the number of solutions $(x_1, ..., x_n)$ of the equation $\sum^n_{i=1}(x^2_i + (a - x_i)^2) = na^2$ such that $x_i$ belongs to the interval $[0, a]$ , for $i = 1, 2, . . . , n$. [u]Round 6 [/u] [b]p16.[/b] All roots of $$\prod^{25}_{n=1} \prod^{2n}_{k=0}(-1)^k \cdot x^k = 0$$ are written in the form $r(\cos \phi + i\sin \phi)$ for $i^2 = -1$, $r > 0$, and $0 \le \phi < 2\pi$. What is the smallest positive value of $\phi$ in radians? [b]p17.[/b] Find the sum of the distinct real roots of the equation $$\sqrt[3]{x^2 - 2x + 1} + \sqrt[3]{x^2 - x - 6} = \sqrt[3]{2x^2 - 3x - 5}.$$ [b]p18.[/b] If $a$ and $b$ satisfy the property that $a2^n + b$ is a square for all positive integers $n$, find all possible value(s) of $a$. [u]Round 7 [/u] [b]p19.[/b] Compute $(1 - \cot 19^o)(1 - \cot 26^o)$. [b]p20.[/b] Consider triangle $ABC$ with $AB = 3$, $BC = 5$, and $\angle ABC = 120^o$. Let point $E$ be any point inside $ABC$. The minimum of the sum of the squares of the distances from $E$ to the three sides of $ABC$ can be written in the form $a/b$ , where a and b are natural numbers such that the greatest common divisor of $a$ and $b$ is $1$. Find $a + b$. [b]p21.[/b] Let $m \ne 1$ be a square-free number (an integer – possibly negative – such that no square divides $m$). We denote $Q(\sqrt{m})$ to be the set of all $a + b\sqrt{m}$ where $a$ and $b$ are rational numbers. Now for a fixed $m$, let $S$ be the set of all numbers $x$ in $Q(\sqrt{m})$ such that x is a solution to a polynomial of the form: $x^n + a_1x^{n-1} + .... + a_n = 0$, where $a_0$, $...$, $a_n$ are integers. For many integers m, $S = Z[\frac{m}] = \{a + b\sqrt{m}\}$ where $a$ and $b$ are integers. Give a classification of the integers for which this is not true. (Hint: It is true for $ m = -1$ and $2$.) PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c4h2782002p24434611]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].