Several prime numbers (some repeated) are written on the board. Mauro added the numbers on the board and Fernando multiplied the numbers on the board. The result obtained by Fernando is equal to $40$ times the result obtained by Mauro. Determine what the numbers on the board can be. Give all chances.

Denote by $\omega (n)$ the number of prime divisors of the natural number $n$ (without multiplicities). Let $$F(x)=\max_{n\leq x} \omega (n) \,\,\,\,\,\,\,\,\,\,\,\,\, G(x)=\max_{n\leq x} \left( \omega (n) + \omega (n^2+1)\right)$$ Prove that $G(x)-F(x)\to \infty$ as $x\to\infty$. (translated by Miklós Maróti)

[u]Round 1[/u] [b]p1.[/b] Three snails – Alice, Bobby, and Cindy – were racing down a road. Whenever one snail passed another, it waved at the snail it passed. During the race, Alice waved $3$ times and was waved at twice. Bobby waved $4$ times and was waved at $3$ times. Cindy waved $5$ times. How many times was she waved at? [b]p2.[/b] Sherlock and Mycroft are playing Battleship on a $4\times 4$ grid. Mycroft hides a single $3\times 1$ cruiser somewhere on the board. Sherlock can pick squares on the grid and fire upon them. What is the smallest number of shots Sherlock has to fire to guarantee at least one hit on the cruiser? [b]p3.[/b] Thirty girls – $13$ of them in red dresses and $17$ in blue dresses – were dancing in a circle, hand-in-hand. Afterwards, each girl was asked if the girl to her right was in a blue dress. Only the girls who had both neighbors in red dresses or both in blue dresses told the truth. How many girls could have answered “Yes”? [b]p4.[/b] Herman and Alex play a game on a $5\times 5$ board. On his turn, a player can claim any open square as his territory. Once all the squares are claimed, the winner is the player whose territory has the longer border. Herman goes first. If both play their best, who will win, or will the game end in a draw? [img]https://cdn.artofproblemsolving.com/attachments/5/7/113d54f2217a39bac622899d3d3eb51ec34f1f.png[/img] [b]p5.[/b] Is it possible to find $2014$ distinct positive integers whose sum is divisible by each of them? [u]Round 2[/u] [b]p6.[/b] Hermione and Ron play a game that starts with 129 hats arranged in a circle. They take turns magically transforming the hats into animals. On each turn, a player picks a hat and chooses whether to change it into a badger or into a raven. A player loses if after his or her turn there are two animals of the same species right next to each other. Hermione goes first. Who loses? [b]p7.[/b] Three warring states control the corner provinces of the island whose map is shown below. [img]https://cdn.artofproblemsolving.com/attachments/e/a/4e2f436be1dcd3f899aa34145356f8c66cda82.png[/img] As a result of war, each of the remaining $18$ provinces was occupied by one of the states. None of the states was able to occupy any province on the coast opposite their corner. The states would like to sign a peace treaty. To do this, they each must send ambassadors to a place where three provinces, one controlled by each state, come together. Prove that they can always find such a place to meet. For example, if the provinces are occupied as shown here, the squares mark possible meeting spots. [img]https://cdn.artofproblemsolving.com/attachments/e/b/81de9187951822120fc26024c1c1fbe2138737.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

An integer partition, is a way of writing n as a sum of positive integers. Two sums that differ only in the order of their summands are considered the same partition. [quote]For example, 4 can be partitioned in five distinct ways: 4 3 + 1 2 + 2 2 + 1 + 1 1 + 1 + 1 + 1[/quote] The number of partitions of n is given by the partition function $p\left ( n \right )$. So $p\left ( 4 \right ) = 5$ . Determine all the positive integers so that $p\left ( n \right )+p\left ( n+4 \right )=p\left ( n+2 \right )+p\left ( n+3 \right )$.

Find the smallest positive integer that ends in $56$, is a multiple of $56$, and has the sum of its digits equal to $56$.

Find the number of positive integers $n$ not greater than 2017 such that $n$ divides $20^n + 17k$ for some positive integer $k$.

Let $p$ be a prime such that $p \equiv 3 \pmod 4$. Prove that we can't partition the numbers $a,a+1,a+2,\cdots,a+p-2$,($a \in \mathbb Z$) in two sets such that product of members of the sets be equal.

Four dice are thrown. What is the probability that the product of the number equals $ 36?$

Find all positive integers $n$ such that there are positive integers $a_1,\cdots,a_n, b_1,\cdots,b_n$ that satisfy \[(a_1^2+\cdots+a_n^2)(b_1^2+\cdots+b_n^2)-(a_1b_1+\cdots+a_nb_n)^2=n\]

Prove that if $ n $ is an integer greater than $ 4 $, then $ 2^n $ is greater than $ n^2 $.

Calculate the value of $\sqrt{\dfrac{11^4+100^4+111^4}{2}}$ and answer in the form of an integer.

Let $f(x)=x^2+x+1$. Determine, with proof, all positive integers $n$ such that $f(k)$ divides $f(n)$ whenever $k$ is a positive divisor of $n$.

We consider the non-zero natural numbers $(m, n)$ such that the numbers $$\frac{m^2 + 2n}{n^2 - 2m} \,\,\,\, and \,\,\, \frac{n^2 + 2m}{m^2-2n}$$ are integers. a) Show that $|m - n| \le 2$: b) Find all the pairs $(m, n)$ with the property from hypothesis $a$.

Let $p$ and $n$ be a natural numbers such that $p$ is a prime and $1+np$ is a perfect square. Prove that the number $n+1$ is sum of $p$ perfect squares.

Find the greatest integer $n$ such that $10^n$ divides $$\frac{2^{10^5} 5^{2^{10}}}{10^{5^2}}$$

For a given integer $k \geq 1$, find all $k$-tuples of positive integers $(n_1,n_2,...,n_k)$ with $\text{GCD}(n_1,n_2,...,n_k) = 1$ and $n_2|(n_1+1)^{n_1}-1$, $n_3|(n_2+1)^{n_2}-1$, ... , $n_1|(n_k+1)^{n_k}-1$. [i]Authored by Pavel Dimovski[/i]

Find all pairs of integers $(x,y)$ that satisfy the equation $3^4 2^3(x^2+y^2)=x^3y^3$

A rectangle can be divided into $n$ equal squares. The same rectangle can also be divided into $n+76$ equal squares. Find $n$.

Two farmers agree that pigs are worth $ \$300$ and that goats are worth $ \$210$. When one farmer owes the other money, he pays the debt in pigs or goats, with ``change'' received in the form of goats or pigs as necessary. (For example, a $ \$390$ debt could be paid with two pigs, with one goat received in change.) What is the amount of the smallest positive debt that can be resolved in this way? $ \textbf{(A) } \$5\qquad \textbf{(B) } \$10\qquad \textbf{(C) } \$30\qquad \textbf{(D) } \$90\qquad \textbf{(E) } \$210$

[b]p1.[/b] Consider this statement: An equilateral polygon circumscribed about a circle is also equiangular. Decide whether this statement is a true or false proposition in euclidean geometry. If it is true, prove it; if false, produce a counterexample. [b]p2.[/b] Show that the fraction $\frac{x^2-3x+1}{x-3}$ has no value between $1$ and $5$, for any real value of $x$. [b]p3.[/b] A man walked a total of $5$ hours, first along a level road and then up a hill, after which he turned around and walked back to his starting point along the same route. He walks $4$ miles per hour on the level, three miles per hour uphill, and $r$ miles per hour downhill. For what values of $r$ will this information uniquely determine his total walking distance? [b]p4.[/b] A point $P$ is so located in the interior of a rectangle that the distance of $P$ from one comer is $5$ yards, from the opposite comer is $14$ yards, and from a third comer is $10$ yards. What is the distance from $P$ to the fourth comer? [b]p5.[/b] Each small square in the $5$ by $5$ checkerboard shown has in it an integer according to the following rules: $\begin{tabular}{|l|l|l|l|l|} \hline & & & & \\ \hline & & & & \\ \hline & & & & \\ \hline & & & & \\ \hline & & & & \\ \hline \end{tabular}$ i. Each row consists of the integers $1, 2, 3, 4, 5$ in some order. ii. Тhе order of the integers down the first column has the same as the order of the integers, from left to right, across the first row and similarly fог any other column and the corresponding row. Prove that the diagonal squares running from the upper left to the lower right contain the numbers $1, 2, 3, 4, 5$ in some order. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Each of $2n + 1$ students chooses a finite, nonempty set of consecutive integers . Two students are friends if they have chosen a common number. Everyone student is friends with at least $n$ other students. Show that there is a student who is friends with everyone else.

Determine all pairs $(a,b)$ of positive integers satisfying \[a^2+b\mid a^2b+a\quad\text{and}\quad b^2-a\mid ab^2+b.\]

Is it true that for any nonzero rational numbers $a$ and $b$ one can find integers $m$ and $n$ such that the number $(am+b)^2+(a+nb)^2$ is an integer? [i](M. Karpuk)[/i]

Suppose that $y$ is a positive integer written only with digit $1$, in base $9$ system. Prove that $y$ is a triangular number, that is, exists positive integer $n$ such that the number $y$ is the sum of the $n$ natural numbers from $1$ to $n$.

Find all prime numbers $ p,q,r$, such that $ \frac{p}{q}\minus{}\frac{4}{r\plus{}1}\equal{}1$