Let $\triangle ABC$ be a right-angled triangle with $\angle A = 90^{\circ}$, and $AB < AC$. Let points $D, E, F$ be located on side $BC$ such that $AD$ is the altitude, $AE$ is the internal angle bisector, and $AF$ is the median. Prove that $3AD + AF > 4AE$.

For all positive integers $n$, show that: $$ \dfrac1n \sum^n _{k=1} \dfrac{k \cdot k! \cdot {n\choose k}}{n^k} = 1$$

$1$ or $-1$ is written in $50$ letters. These letters are put into $50$ envelopes. If you ask, you can learn the product of numbers written into any three letters. At least, how many questions are required to find the product of all of the $50$ numbers?

$\textbf{Problem C.1}$ There are two piles of coins, each containing $2010$ pieces. Two players $A$ and $B$ play a game taking turns ($A$ plays first). At each turn, the player on play has to take one or more coins from one pile or exactly one coin from each pile. Whoever takes the last coin is the winner. Which player will win if they both play in the best possible way?

In the tribe of Zimmer, being able to hike long distances and knowing the roads through the forest are both extremely important, so a boy who reaches the age of manhood is not designated as a man by the tribe until he completes an interesting rite of passage. The man must go on a sequence of hikes. The first hike is a $5$ kilometer hike down the main road. The second hike is a $5\frac{1}{4}$ kilometer hike down a secondary road. Each hike goes down a different road and is a quarter kilometer longer than the previous hike. The rite of passage is completed at the end of the hike where the cumulative distance walked by the man on all his hikes exceeds $1000$ kilometers. So in the tribe of Zimmer, how many roads must a man walk down, before you call him a man?

We have $n$ integers $a_1, a_2,. . . , a_n$, not necessarily distinct, with sum $2S.$ An integer $k$ is called [i]separator[/i] if $k$ of the numbers can be chosen with sum equal to $S.$ What is the maximum possible number of separators?

To each three-digit number, Matías added the number obtained by inverting its digits. For example, he added $729$ to the number $927$. Calculate in how many cases the result of the sum of Matías is a number with all its digits odd.

Let $ABC$ be a triangle with incenter $I$, and let $D$ be a point on line $BC$ satisfying $\angle AID=90^{\circ}$. Let the excircle of triangle $ABC$ opposite the vertex $A$ be tangent to $\overline{BC}$ at $A_1$. Define points $B_1$ on $\overline{CA}$ and $C_1$ on $\overline{AB}$ analogously, using the excircles opposite $B$ and $C$, respectively. Prove that if quadrilateral $AB_1A_1C_1$ is cyclic, then $\overline{AD}$ is tangent to the circumcircle of $\triangle DB_1C_1$. [i]Ankan Bhattacharya[/i]

A standard six-sided die is rolled, and $ P$ is the product of the five numbers that are visible. What is the largest number that is certain to divide $ P$? $ \textbf{(A)}\ 6\qquad \textbf{(B)}\ 12\qquad \textbf{(C)}\ 24\qquad \textbf{(D)}\ 144\qquad \textbf{(E)}\ 720$

Given two circles $k_{1}$ and $k_{2}$ with centers $O_{1}$ and $O_{2}$ that intersect at the points $A$ and $B$.Passes through A two lines that intersect the circle $k_{1}$ at the points $N_{1}$and $M_{1}$, and the circle $k_{2}$ at the points $N_{2}$ and $M_{2}$ (points $A, N_{1},M_{1}$ in colinear). Denote the midpoints of the segments $N_{1}N_{2}$ and $M_{1}M_{2]}$ , through $N$ and $M$.Prove that: $a)$ Points $M,N,A$ and $B$ lie on a circle $b)$The center of the circle passing through $M,N,A$ and $B$ lies in the middle of the segment $O_{1}O_{2}$

A polynomial $P$ with integer coefficients is [i]square-free[/i] if it is not expressible in the form $P = Q^2R$, where $Q$ and $R$ are polynomials with integer coefficients and $Q$ is not constant. For a positive integer $n$, let $P_n$ be the set of polynomials of the form $$1 + a_1x + a_2x^2 + \cdots + a_nx^n$$ with $a_1,a_2,\ldots, a_n \in \{0,1\}$. Prove that there exists an integer $N$ such that for all integers $n \geq N$, more than $99\%$ of the polynomials in $P_n$ are square-free. [i]Navid Safaei, Iran[/i]

A [i]fortress[/i] is a finite collection of cells in an infinite square grid with the property that one can pass from any cell of the fortress to any other by a sequence of moves to a cell with a common boundary line (but it can have "holes"). The [i]walls[/i] of a fortress are the unit segments between cells belonging to the fortress and cells not belonging to the fortress. The [i]area[/i] $A$ of a fortress is the number of cells it consists of. The [i]perimeter[/i] $P$ is the total length of its walls. Each cell of the fortress can contain a [i]guard[/i] which can oversee the cells to the top, the bottom, the right and the left of this cell, up until the next wall (it also oversees its own cell). (a) Determine the smallest integer $k$ such that $k$ guards suffice to oversee all cells of any fortress of perimeter $P \le 2024$. (b) Determine the smallest integer $k$ such that $k$ guards suffice to oversee all cells of any fortress of area $A \le 2024$.

Prove that every positive integer can be represented in the form $$3^{m_1}\cdot 2^{n_1}+3^{m_2}\cdot 2^{n_2} + \dots + 3^{m_k}\cdot 2^{n_k}$$ where $m_1 > m_2 > \dots > m_k \geq 0$ and $0 \leq n_1 < n_2 < \dots < n_k$ are integers.

In triangle $ABC$, $D$ is the midpoint of $AB$; $E$ is the midpoint of $DB$; and $F$ is the midpoint of $BC$. If the area of $\triangle ABC$ is $96$, then the area of $\triangle AEF$ is $\textbf{(A) }16\qquad\textbf{(B) }24\qquad\textbf{(C) }32\qquad\textbf{(D) }36\qquad \textbf{(E) }48$

Let the triangle $ABC$ with $BC$ the smallest side. Let $P$ on ($AB$) such that angle $PCB$ equals angle $BAC$. and $Q$ on side ($AC$) such that angle $QBC$ equals angle $BAC$. Show that the line passing through the circumenters of triangles $ABC$ and $APQ$ is perpendicular on $BC$.

$4026$ points were noted on the plane, not three of which lie on a straight line. The $2013$ points are the vertices of a convex polygon, and the other $2013$ vertices are inside this polygon. It is allowed to paint each point in one of two colors. Coloring will be good if some pairs of dots can be combined segments with the following conditions: $\bullet$ Each segment connects dots of the same color. $\bullet$ No two drawn segments intersect at their inner points. $\bullet$ For an arbitrary pair of dots of the same color, there is a path along the lines from one point to another. Please note that the sides of the convex $2013$ rectangle are not automatically drawn segments, although some (or all) can be drawn as needed. Prove that the total number of good colors does not depend on the specific locations of the points and find that number.