Let $ m,n > 1$ are integers which satisfy $ n|4^m \minus{} 1$ and $ 2^m|n \minus{} 1$. Is it a must that $ n \equal{} 2^{m} \plus{} 1$?

Prove that, for a function $f \colon \mathbb{R} \to \mathbb{R}$, the following $2$ statements are equivalent: a) $f$ is differentiable, with continuous first derivative. b) For any $a\in\mathbb{R}$ and for any two sequences $(x_n)_{n\geq 1},(y_n)_{n\geq 1}$, convergent to $a$, such that $x_n \neq y_n$ for any positive integer $n$, the sequence $\left(\frac{f(x_n)-f(y_n)}{x_n-y_n}\right)_{n\geq 1}$ is convergent.

Let $ABCD$ a convex quadrilateral (this means that all interior angles are smaller than $180^o$), such that there exist a point $M$ on line segment $AB$ and a point $N$ on line segment $BC$ having the property that $AN$ cuts the quadrilateral in two parts of equal area, and such that the same property holds for $CM$. Prove that $MN$ cuts the diagonal $BD$ in two segments of equal length.

Let $a\equiv 1\pmod{4}$ be a positive integer. Show that any polynomial $Q\in\mathbb{Z}[X]$ with all positive coefficients such that $$Q(n+1)((a+1)^{Q(n)}-a^{Q(n)})$$ is a perfect square for any $n\in\mathbb{N}^{\ast}$ must be a constant polynomial. [i]Proposed by Vlad Matei, Romania[/i]

Let $P(z)=a_nz^n+a_{n-1}z^{n-1}+\ldots+a_mz^m$ be a polynomial with complex coefficients such that $a_m\neq 0, a_n\neq 0$ and $n>m$. Prove that \[\text{max}_{|z|=1}\{|P(z)|\}\ge\sqrt{2|a_ma_n|+\sum_{k=m}^{n} |a_k|^2}\]

Point $ A$ lies at $ (0, 4)$ and point $ B$ lies at $ (3, 8)$. Find the $ x$-coordinate of the point $ X$ on the $ x$-axis maximizing $ \angle AXB$.

A $9\times 9$ array is filled with integers from 1 to 81. Prove that there exists $k\in\{1,2,3,\ldots, 9\}$ such that the product of the elements in the row $k$ is different from the product of the elements in the column $k$ of the array.

Let $ABC$ be an acute-angled triangle with $AB < AC$ and $\Gamma$ the circumference that passes through $A,\ B$ and $C$. Let $D$ be the point diametrically opposite $A$ on $\Gamma$ and $\ell$ the tangent through $D$ to $\Gamma$. Let $P, Q$ and $R$ be the intersection points of $B C$ with $\ell$, of $A P$ with $\Gamma$ such that $Q \neq A$ and of $Q D$ with the $A$-altitude of the triangle $ABC$, respectively. Define $S$ to be the intersection of $AB$ with $\ell$ and $T$ to be the intersection of $A C$ with $\ell$. Show that $S$ and $T$ lie on the circumference that passes through $A, Q$ and $R$.

Three $\text{A's}$, three $\text{B's}$, and three $\text{C's}$ are placed in the nine spaces so that each row and column contain one of each letter. If $\text{A}$ is placed in the upper left corner, how many arrangements are possible? [asy] size((80)); draw((0,0)--(9,0)--(9,9)--(0,9)--(0,0)); draw((3,0)--(3,9)); draw((6,0)--(6,9)); draw((0,3)--(9,3)); draw((0,6)--(9,6)); label("A", (1.5,7.5)); [/asy] $ \textbf{(A)}\ 2\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ 5\qquad\textbf{(E)}\ 6 $

Let $f:\mathbb{R}\backslash0 \rightarrow \mathbb{R}\backslash0$ be a non-constant, continuous function defined such that $f(3^x2^y)=\frac{y}{x}f(3^y)$ for any $x,y \neq 0.$ Compute $\frac{f(1296)}{f(6)}.$ [i]Proposed by Richard Chen and Zachary Perry[/i]

In the addition shown below $A$, $B$, $C$, and $D$ are distinct digits. How many different values are possible for $D$? \[\begin{array}{lr} &ABBCB \\ +& BCADA \\ \hline & DBDDD \end{array}\] $\textbf{(A) }2\qquad\textbf{(B) }4\qquad\textbf{(C) }7\qquad\textbf{(D) }8\qquad\textbf{(E) }9$

A quadrilateral is circumscribed around a circle. Its diagonals intersect at the center of the circle. Prove that the quadrilateral is a rhombus.

Prove that $x = y = z = 1$ is the only positive solution of the system \[\left\{ \begin{array}{l} x+y^2 +z^3 = 3\\ y+z^2 +x^3 = 3\\ z+x^2 +y^3 = 3\\ \end{array} \right. \]

Let $n$ be a fixed odd positive integer. For each odd prime $p$, define $$a_p=\frac{1}{p-1}\sum_{k=1}^{\frac{p-1}{2}}\bigg\{\frac{k^{2n}}{p}\bigg\}.$$ Prove that there is a real number $c$ such that $a_p = c$ for infinitely many primes $p$. [i]Note: $\left\{x\right\} = x - \left\lfloor x\right\rfloor$ is the fractional part of $x$.[/i]

A positive integer $a$ is said to [i]reduce[/i] to a positive integer $b$ if when dividing $a$ by its units digits the result is $b$. For example, 2015 reduces to $\frac{2015}{5} = 403$. Find all the positive integers that become 1 after some amount of reductions. For example, 12 is one such number because 12 reduces to 6 and 6 reduces to 1.

A difficult mathematical competition consisted of a Part I and a Part II with a combined total of $28$ problems. Each contestant solved $7$ problems altogether. For each pair of problems, there were exactly two contestants who solved both of them. Prove that there was a contestant who, in Part I, solved either no problems or at least four problems.

It is known that there is a number $S$ such that if $ a+b+c+d = S$ and $\frac{1}{a}+ \frac{1}{b}+ \frac{1}{c}+ \frac{1}{d} = S$ $(a, b, c, d$ are different from zero and one$)$, then $\frac{1}{a- 1} ++ \frac{1}{b- 1} + \frac{1}{c- 1} + \frac{1}{d -1} = S.$ Find $S$.

If $ f$ is a nonnegative, continuous, concave function on the closed interval $ [0,1]$ such that $ f(0)=1$, then \[ \int_0^1 xf(x)dx \leq \frac 23 \left[ %Error. "diaplaymath" is a bad command. \int_0^1 f(x)dx \right]^2.\] [i]Z. Daroczy[/i]

Denote by $\mathbb{Z}^{*}$ the set of all nonzero integers and denote by $\mathbb{N}_{0}$ the set of all nonnegative integers. Find all functions $f:\mathbb{Z}^{*} \rightarrow \mathbb{N}_{0}$ such that: $(1)$ For all $a,b \in \mathbb{Z}^{*}$ such that $a+b \in \mathbb{Z}^{*}$ we have $f(a+b) \geq $ [b]min[/b] $\left \{ f(a),f(b) \right \}$. $(2)$ For all $a, b \in \mathbb{Z}^{*}$ we have $f(ab) = f(a)+f(b)$.

Bunbury the bunny is hopping on the positive integers. First, he is told a positive integer $n$. Then Bunbury chooses positive integers $a,d$ and hops on all of the spaces $a,a+d,a+2d,\dots,a+2013d$. However, Bunbury must make these choices so that the number of every space that he hops on is less than $n$ and relatively prime to $n$. A positive integer $n$ is called [i]bunny-unfriendly[/i] if, when given that $n$, Bunbury is unable to find positive integers $a,d$ that allow him to perform the hops he wants. Find the maximum bunny-unfriendly integer, or prove that no such maximum exists.

As in the following diagram, square $ABCD$ and square $CEFG$ are placed side by side (i.e. $C$ is between $B$ and $E$ and $G$ is between $C$ and $D$). If $CE = 14$, $AB > 14$, compute the minimal area of $\triangle AEG$. [asy] size(120); defaultpen(linewidth(0.7)+fontsize(10)); pair D2(real x, real y) { pair P = (x,y); dot(P,linewidth(3)); return P; } int big = 30, small = 14; filldraw((0,big)--(big+small,0)--(big,small)--cycle, rgb(0.9,0.5,0.5)); draw(scale(big)*unitsquare); draw(shift(big,0)*scale(small)*unitsquare); label("$A$",D2(0,big),NW); label("$B$",D2(0,0),SW); label("$C$",D2(big,0),SW); label("$D$",D2(big,big),N); label("$E$",D2(big+small,0),SE); label("$F$",D2(big+small,small),NE); label("$G$",D2(big,small),NE); [/asy]

Let $ABC$ be a triangle, $I$ its incenter, $\omega$ its incircle, $P$ a point such that $PI\perp BC$ and $PA\parallel BC$, $Q\in (AB), R\in (AC)$ such that $QR\parallel BC$ and $QR$ tangent to $\omega$. Show that $\angle QPB = \angle CPR$.

If $x$ is a real number satisfying the equation $$9\log_3 x - 10\log_9 x =18 \log_{27} 45,$$ then the value of $x$ is equal to $m\sqrt{n}$, where $m$ and $n$ are positive integers, and $n$ is not divisible by the square of any prime. Find $m+n$. [i]Proposed by pog[/i]

Find all injective functions $f: \mathbb R \rightarrow \mathbb R$ such that for every real number $x$ and every positive integer $n$,$$ \left|\sum_{i=1}^n i\left(f(x+i+1)-f(f(x+i))\right)\right|<2016$$ [i](Macedonia)[/i]

In a country, some cities are connected by two-way airlines, and one can get from any city to any other city in no more than $n{}$ flights. Prove that all airlines can be distributed among $n{}$ companies so that a route can be built between any two cities in which no more than two flights of each company would meet. [i]From the folklore[/i]