Let $\mathbb{N}$ denote the set of positive integers. Find all functions $f:\mathbb{N}\longrightarrow\mathbb{N}$ such that \[n+f(m)\mid f(n)+nf(m)\] for all $m,n\in \mathbb{N}$ [i]Proposed by Dorlir Ahmeti, Albania[/i]

Find all positive integers $w$, $x$, $y$ and $z$ which satisfy $w! = x! + y! + z!$.

A right $100$-gon $P$ is given, which has $x$ vertices coloured in white and all other in black. If among some vertices of a right polygon, all the vertices of which are also vertices of $P$, there is exactly one white vertex, then you are allowed to colour this vertex in black. Find all positive integers $x \leq 100$ for which for all initial colourings it is not possible to make all vertices black. [i]A. Vaidzelevich,M. Shutro[/i]

There are five dots arranged in a line from left to right. Each of the dots is colored from one of five colors so that no $3$ consecutive dots are all the same color. How many ways are there to color the dots?

Given the following matrix $$\begin{pmatrix} 11& 17 & 25& 19& 16\\ 24 &10 &13 & 15&3\\ 12 &5 &14& 2&18\\ 23 &4 &1 &8 &22 \\ 6&20&7 &21&9 \end{pmatrix},$$ choose five of these elements, no two from the same row or column, in such a way that the minimum of these elements is as large as possible.

$\triangle ABC$ has $AB=5,BC=6,$ and $AC=7.$ Let $M$ be the midpoint of $BC,$ and let the circumcircle of $\triangle ABM$ intersect $AC$ at $N.$ If the length of segment $MN$ can be expressed as $\frac{a}{b}$ for relatively prime positive integers $a,b$ find $a+b.$ [i]Proposed by Alex Li[/i]

Let $m$ and $n$ be positive integers. Prove that if $m^{4^n+1} - 1$ is a prime number, then there exists an integer $t \ge 0$ such that $n = 2^t$.

Anna wants to form a four-digit number with four different digits from the digits $1, 2, 3, 4, 5, 6, 7, 8, 9$. She wants the first digit of that number to be bigger than the sum of the other three digits. How many such numbers can she form?

In the square, the midpoints of the two sides were marked and the segments shown in the figure on the left were drawn. Which of the shaded quadrilaterals has the largest area? [img]https://cdn.artofproblemsolving.com/attachments/d/f/2be7bcda3fa04943687de9e043bd8baf40c98c.png[/img]

In the city of $\textrm{Las Cobayas}$, the houses are arranged in a rectangular grid of $3$ rows and $n\geq 2$ columns, as illustrated in the figure. $\textrm{Mich}$ plans to move there and wants to tour the city to visit some of the houses in a way that he visits at least one house from each column and does not visit the same house more than once. During his tour, $\textrm{Mich}$ can move between adjacent houses, that is, after visiting a house, he can continue his journey by visiting one of the neighboring houses to the north, south, east, or west, which are at most four. The figure illustrates one $\textrm{Mich´s}$ position (circle), and the houses to which he can move (triangles). Let $f(n)$ be the number of ways $\textrm{Mich}$ can complete his tour starting from a house in the first column and ending at a house in the last column. Prove that $f(n)$ is odd. [asy]size(200); draw((0,0)--(1,0)--(1,1)--(0,1)--cycle); draw((2,0)--(3,0)--(3,1)--(2,1)--cycle); draw((4,0)--(5,0)--(5,1)--(4,1)--cycle); draw((0,2)--(1,2)--(1,3)--(0,3)--cycle); draw((2,2)--(3,2)--(3,3)--(2,3)--cycle); draw((4,2)--(5,2)--(5,3)--(4,3)--cycle); draw((0,4)--(1,4)--(1,5)--(0,5)--cycle); draw((2,4)--(3,4)--(3,5)--(2,5)--cycle); draw((4,4)--(5,4)--(5,5)--(4,5)--cycle); fill(circle((0.5,2.5), 0.4), black); fill((0.1262,4.15)--(0.8738,4.15)--(0.5,4.7974)--cycle, black); fill((0.1262,0.15)--(0.8738,0.15)--(0.5,0.7974)--cycle, black); fill((2.1262,2.15)--(2.8738,2.15)--(2.5,2.7974)--cycle, black); fill(circle((6,0.5), 0.07), black); fill(circle((6.3,0.5), 0.07), black); fill(circle((6.6,0.5), 0.07), black); fill(circle((6,2.5), 0.07), black); fill(circle((6.3,2.5), 0.07), black); fill(circle((6.6,2.5), 0.07), black); fill(circle((6,4.5), 0.07), black); fill(circle((6.3,4.5), 0.07), black); fill(circle((6.6,4.5), 0.07), black); draw((8,0)--(9,0)--(9,1)--(8,1)--cycle); draw((10,0)--(11,0)--(11,1)--(10,1)--cycle); draw((8,2)--(9,2)--(9,3)--(8,3)--cycle); draw((10,2)--(11,2)--(11,3)--(10,3)--cycle); draw((8,4)--(9,4)--(9,5)--(8,5)--cycle); draw((10,4)--(11,4)--(11,5)--(10,5)--cycle); draw((0,-0.2)--(0,-0.5)--(5.5,-0.5)--(5.5,-0.8)--(5.5,-0.5)--(11,-0.5)--(11,-0.5)--(11,-0.2)); label("$n$", (5.22,-1.15), dir(0), fontsize(10)); label("$\textrm{West}$", (-2,2.5), dir(0), fontsize(10)); label("$\textrm{East}$", (11.1,2.5), dir(0), fontsize(10)); label("$\textrm{North}$", (4.5,5.7), dir(0), fontsize(10)); label("$\textrm{South}$", (4.5,-2), dir(0), fontsize(10)); draw((0.5,2.5)--(2,2.5)--(1.8,2.7)--(2,2.5)--(1.8,2.3)); draw((0.5,2.5)--(0.5,4)--(0.3,3.7)--(0.5,4)--(0.7,3.7)); draw((0.5,2.5)--(0.5,1)--(0.3,1.3)--(0.5,1)--(0.7,1.3)); [/asy]

[list=a] [*] Find an example of three positive integers $a,b,c$ satisfying $31a+30b+28c=365$. [*] Prove that any triplet $a,b,c$ satisfying the above condition, also satisfies $a+b+c=12$. [/list]

There is a simple graph which chromatic number is equal to $k$. We painted all of the edges of graph using two colors. Prove that there exist a monochromatic tree with $k$ vertices

Let $ ABC$ be a triangle with angle $ A <$ angle $ C < 90^\circ <$ angle $ B$. Consider the bisectors of the external angles at $ A$ and $ B$, each measured from the vertex to the opposoite side (extended). Suppose both of these line-segments are equal to $ AB$. Compute the angle $ A$.

Is it true that for any permulation $a_1,a_2.....,a_{2002}$ of $1,2....,2002$ there are positive integers $m,n$ of the same parity such that $0<m<n<2003$ and $a_m+a_n=2a_{\frac {m+n}{2}}$

Given $n$ lines on the plane, they divide the plane onto several bounded or bounded polygonal regions. Define the rank of a region as the number of vertices on its boundary (a vertex is a point which belongs to at least two lines). Prove that the sum of squares of ranks of all regions does not exceed $10n^2$. (D. Fomin)

In Middle-Earth, nine cities form a $3$ by $3$ grid. The top left city is the capital of Gondor and the bottom right city is the capital of Mordor. How many ways can the remaining cities be divided among the two nations such that all cities in a country can be reached from its capital via the grid-lines without passing through a city of the other country?

Let $\Omega$ and $O$ be the circumcircle and the circumcentre of an acute-angled triangle $ABC$ with $AB > BC$. The angle bisector of $\angle ABC$ intersects $\Omega$ at $M \ne B$. Let $\Gamma$ be the circle with diameter $BM$. The angle bisectors of $\angle AOB$ and $\angle BOC$ intersect $\Gamma$ at points $P$ and $Q,$ respectively. The point $R$ is chosen on the line $P Q$ so that $BR = MR$. Prove that $BR\parallel AC$. (Here we always assume that an angle bisector is a ray.) [i]Proposed by Sergey Berlov, Russia[/i]

Let $k$ be a real number such that the product of real roots of the equation $$X^4 + 2X^3 + (2 + 2k)X^2 + (1 + 2k)X + 2k = 0$$ is $-2013$. Find the sum of the squares of these real roots.

What is the largest $n$ such that a square cannot be partitioned into $n$ smaller, non-overlapping squares?

Prove that the volume $V$ and the lateral area $S$ of a right circular cone satisfy the inequality \[\left( \frac{6V}{\pi}\right)^2 \leq \left( \frac{2S}{\pi \sqrt 3}\right)^3\] When does equality occur?

Let $ABC$ be a triangle and $m$ a line which intersects the sides $AB$ and $AC$ at interior points $D$ and $F$, respectively, and intersects the line $BC$ at a point $E$ such that $C$ lies between $B$ and $E$. The parallel lines from the points $A$, $B$, $C$ to the line $m$ intersect the circumcircle of triangle $ABC$ at the points $A_1$, $B_1$ and $C_1$, respectively (apart from $A$, $B$, $C$). Prove that the lines $A_1E$ , $B_1F$ and $C_1D$ pass through the same point. [i]Greece[/i]

An acute triangle $ABC$ ($AB\ne AC$) is inscribed in the circle $\omega$ with center at $O$. The point $M$ is the midpoint of the side $BC$. The tangent line to $\omega$ at point $A$ intersects the line $BC$ at point $D$. A circle with center at point $M$ with radius $MA$ intersects the extensions of sides $AB$ and $AC$ at points $K$ and $L$, respectively. Let $X$ be such a point that $BX\parallel KM$ and $CX\parallel LM$. Prove that the points $X$, $D$, $O$ are collinear.

Compute the number of ordered pairs $(a,b)$ of positive integers satisfying $a^b=2^{100}$. [i]Proposed by Nathan Xiong[/i]

Suppose $A_1, A_2, A_3, \ldots, A_{20}$is a 20 sides regular polygon. How many non-isosceles (scalene) triangles can be formed whose vertices are among the vertices of the polygon but the sides are not the sides of the polygon?

Let $n \geq 3$ be an integer. John and Mary play the following game: First John labels the sides of a regular $n$-gon with the numbers $1, 2,\ldots, n$ in whatever order he wants, using each number exactly once. Then Mary divides this $n$-gon into triangles by drawing $n-3$ diagonals which do not intersect each other inside the $n$-gon. All these diagonals are labeled with number $1$. Into each of the triangles the product of the numbers on its sides is written. Let S be the sum of those $n - 2$ products. Determine the value of $S$ if Mary wants the number $S$ to be as small as possible and John wants $S$ to be as large as possible and if they both make the best possible choices.