In the right triangle $ABC$ ( $\angle A = 90^o$), $D$ is the intersection of the bisector of the angle $A$ with the side $(BC)$, and $P$ and $Q$ are the projections of the point $D$ on the sides $(AB),(AC)$ respectively . If $BQ \cap DP=\{M\}$, $CP \cap DQ=\{N\}$, $BQ\cap CP=\{H\}$, show that: a) $PM = DN$ b) $MN \parallel BC$ c) $AH \perp BC$.

Given any collection of $2010$ nondegenerate triangles, their sides are painted so that each triangle has one red side, one blue side, and one white side. For each color, arrange the side lengths in order: [list][*]let $b_1\le b_2\le\cdots\le b_{2011}$ denote the lengths of the blue sides; [*]let $r_1\le r_2\le\cdots\le r_{2011}$ denote the lengths of the red sides; and [*]let $w_1\le w_2\le\cdots\le w_{2011}$ denote the lengths of the white sides.[/list] Find the largest integer $k$ for which there necessarily exists at least $k$ indices $j$ such that $b_j$, $r_j$, $w_j$ are the side lengths of a nondegenerate triangle.

Let $\{a_n\}_{n\geq 0}$ be a non-decreasing, unbounded sequence of non-negative integers with $a_0=0$. Let the number of members of the sequence not exceeding $n$ be $b_n$. Prove that \[ (a_0 + a_1 + \cdots + a_m)( b_0 + b_1 + \cdots + b_n ) \geq (m + 1)(n + 1). \]

Let be a natural number $ n $ and a $ n\times n $ nilpotent real matrix $ A. $ Prove that $ 0=\det\left( A+\text{adj} A \right) . $ [i]Neculai Moraru[/i]

Find the number of ways a series of $+$ and $-$ signs can be inserted between the numbers $0,1,2,\cdots, 12$ such that the value of the resulting expression is divisible by 5. [i]Proposed by Matthew Lerner-Brecher[/i]

For a polynomial $ P(x)$ with integer coefficients, $ r(2i \minus{} 1)$ (for $ i \equal{} 1,2,3,\ldots,512$) is the remainder obtained when $ P(2i \minus{} 1)$ is divided by $ 1024$. The sequence \[ (r(1),r(3),\ldots,r(1023)) \] is called the [i]remainder sequence[/i] of $ P(x)$. A remainder sequence is called [i]complete[/i] if it is a permutation of $ (1,3,5,\ldots,1023)$. Prove that there are no more than $ 2^{35}$ different complete remainder sequences.

If the natural numbers $a, b, c, d$ verify the relationships: $$(a^2 + b^2)(c^2 + d^2) = (ab + cd)^2$$ $$(a^2 + d^2)(b^2 + c^2) = (ad + bc)^2$$ and the $gcd(a, b, c, d) = 1$, prove that $a + b + c + d$ is a perfect square.

Let $c>2$ and $a_0,a_1, \ldots$ be a sequence of real numbers such that \begin{align*} a_n = a_{n-1}^2 - a_{n-1} < \frac{1}{\sqrt{cn}} \end{align*} for any $n$ $\in$ $\mathbb{N}$. Prove, $a_1=0$

Let $ABC$ be a triangle with $AB = 13$, $BC = 14$, $CA = 15$. Company $XYZ$ wants to locate their base at the point $P$ in the plane minimizing the total distance to their workers, who are located at vertices $A$, $B$, and $C$. There are $1$, $5$, and $4$ workers at $A$, $B$, and $C$, respectively. Find the minimum possible total distance Company $XYZ$'s workers have to travel to get to $P$.

Let $p > 7$ be a prime which leaves residue 1 when divided by 6. Let $m=2^p-1,$ then prove $2^{m-1}-1$ can be divided by $127m$ without residue.

Given is the sequence $(a_n)_{n\geq 0}$ which is defined as follows:$a_0=3$ and $a_{n+1}-a_n=n(a_n-1) \ , \ \forall n\geq 0$. Determine all positive integers $m$ such that $\gcd (m,a_n)=1 \ , \ \forall n\geq 0$.

Given $a, b,c \ge 0, a + b + c = 1$, prove that $(a^2 + b^2 + c^2)^2 + 6abc \ge ab + bc + ac$ (I. Voronovich)

Let $ABCD$ be a convex quadrilateral and points $E$ and $F$ on sides $AB,CD$ such that \[\tfrac{AB}{AE}=\tfrac{CD}{DF}=n\] If $S$ is the area of $AEFD$ show that ${S\leq\frac{AB\cdot CD+n(n-1)AD^2+n^2DA\cdot BC}{2n^2}}$

Find the sum of the $2007$ roots of \[(x-1)^{2007}+2(x-2)^{2006}+3(x-3)^{2005}+\cdots+2006(x-2006)^2+2007(x-2007).\]

In whatever follows $f$ denotes a differentiable function from $\mathbb{R}$ to $\mathbb{R}$. $f \circ f$ denotes the composition of $f(x)$. $\textbf{(a)}$ If $f\circ f(x) = f(x) \forall x \in \mathbb{R}$ then for all $x$, $f'(x) =$ or $f'(f(x)) =$. Fill in the blank and justify. $\textbf{(b)}$Assume that the range of $f$ is of the form $ \left(-\infty , +\infty \right), [a, \infty ),(- \infty , b], [a, b] $. Show that if $f \circ f = f$, then the range of $f$ is $\mathbb{R}$. [hide=Hint](Hint: Consider a maximal element in the range of f)[/hide] $\textbf{(c)}$ If $g$ satisfies $g \circ g \circ g = g$, then $g$ is onto. Prove that $g$ is either strictly increasing or strictly decreasing. Furthermore show that if $g$ is strictly increasing, then $g$ is unique.