In a right-angled triangle $ ABC$ let $ AD$ be the altitude drawn to the hypotenuse and let the straight line joining the incentres of the triangles $ ABD, ACD$ intersect the sides $ AB, AC$ at the points $ K,L$ respectively. If $ E$ and $ E_1$ dnote the areas of triangles $ ABC$ and $ AKL$ respectively, show that \[ \frac {E}{E_1} \geq 2. \]

Each point on the plane is colored either red, green, or blue. Prove that there exists an isosceles triangle whose vertices all have the same color.

Let $ABC$ be a triangle with $CA \neq CB$. Let $D$, $F$, and $G$ be the midpoints of the sides $AB$, $AC$, and $BC$ respectively. A circle $\Gamma$ passing through $C$ and tangent to $AB$ at $D$ meets the segments $AF$ and $BG$ at $H$ and $I$, respectively. The points $H'$ and $I'$ are symmetric to $H$ and $I$ about $F$ and $G$, respectively. The line $H'I'$ meets $CD$ and $FG$ at $Q$ and $M$, respectively. The line $CM$ meets $\Gamma$ again at $P$. Prove that $CQ = QP$. [i]Proposed by El Salvador[/i]

Let be two natural numbers $ n $ and $ a. $ [b]a)[/b] Prove that there exists an $ n\text{-tuplet} $ of natural numbers $ \left( a_1,a_2,\ldots ,a_n\right) $ that satisfy the following equality. $$ 1+\frac{1}{a} =\prod_{i=1}^n \left( 1+\frac{1}{a_i} \right) $$ [b]b)[/b] Show that there exist only finitely such $ n\text{-tuplets} . $

Let $A$ be a set of polynomials with real coefficients and let them satisfy the following conditions: [b](i)[/b] if $f \in A$ and $\deg( f ) \leq 1$, then $f(x) = x - 1$; [b](ii)[/b] if $f \in A$ and $\deg( f ) \geq 2$, then either there exists $g \in A$ such that $f(x) = x^{2+\deg(g)} + xg(x) -1$ or there exist $g, h \in A$ such that $f(x) = x^{1+\deg(g)}g(x) + h(x)$; [b](iii)[/b] for every $g, h \in A$, both $x^{2+\deg(g)} + xg(x) -1$ and $x^{1+\deg(g)}g(x) + h(x)$ belong to $A.$ Let $R_n(f)$ be the remainder of the Euclidean division of the polynomial $f(x)$ by $x^n$. Prove that for all $f \in A$ and for all natural numbers $n \geq 1$ we have $R_n(f)(1) \leq 0$, and that if $R_n(f)(1) = 0$ then $R_n(f) \in A$.

For all $n$, $t_{n+1} = 2(t_n)^2 - 1$. Prove that gcd $(t_n,t_m) = 1$ if $n \ne m$.

A gambling student tosses a fair coin. She gains $1$ point for each head that turns up, and gains $2$ points for each tail that turns up. Prove that the probability of the student scoring [i]exactly[/i] $n$ points is $\frac{1}{3}\cdot\left(2+\left(-\frac{1}{2}\right)^{n}\right)$.

The function $f (x)$ satisfies the relation $f(x+\pi)=\frac{f(x)}{3f(x) -1}$ for any real number $x$. Prove that the function $f (x)$ is periodic.

Find all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ that satisfy \[f(xf(y) + f(x)) = f(x)f(y) + 2f(x) + f(y) - 1,\] for every $x, y \in \mathbb{R}$, and $f(kx) > kf(x)$ for every $x \in \mathbb{R}$ and $k \in \mathbb{R}$, such that $k > 1$.

Let $ABCD$ be a quadrilateral with side lengths $AB = 2$, $BC = 3$, $CD = 5$, and $DA = 4$. What is the maximum possible radius of a circle inscribed in quadrilateral $ABCD$?

When $4444^{4444}$ is written in decimal notation, the sum of its digits is $ A.$ Let $B$ be the sum of the digits of $A.$ Find the sum of the digits of $ B.$ ($A$ and $B$ are written in decimal notation.)

Let points $ A = (0,0) , \ B = (1,2), \ C = (3,3), $ and $ D = (4,0) $. Quadrilateral $ ABCD $ is cut into equal area pieces by a line passing through $ A $. This line intersects $ \overline{CD} $ at point $ \left (\frac{p}{q}, \frac{r}{s} \right ) $, where these fractions are in lowest terms. What is $ p + q + r + s $? $ \textbf{(A)} \ 54 \qquad \textbf{(B)} \ 58 \qquad \textbf{(C)} \ 62 \qquad \textbf{(D)} \ 70 \qquad \textbf{(E)} \ 75 $

Three circles with radii $23$, $46$, and $69$ are tangent to each other as shown in the figure below (figure is not drawn to scale). Find the radius of the largest circle that can fit inside the shaded region. [img]https://cdn.artofproblemsolving.com/attachments/6/d/158abc178e4ddd72541580958a4ee2348b2026.png[/img]

The area of the smallest square that will contain a circle of radius 4 is $\textbf{(A)}\ 8 \qquad \textbf{(B)}\ 16 \qquad \textbf{(C)}\ 32 \qquad \textbf{(D)}\ 64 \qquad \textbf{(E)}\ 128$

An open half-plane is the set of all points lying to one side of a line, but excluding the points on the line itself. If four open half-planes cover the plane, show that one can select three of them which still cover the plane.

Two straight lines $a$ and $b$ are given and also points $A$ and $B$. Point $X$ slides along the line $a$, and point $Y$ slides along the line $b$, so that $AX \parallel BY$. Find the locus of the intersection point of $AY$ with $XB$.

Find all primes $p$ such that $2p^2 - 3p - 1$ is a positive perfect cube

Let $T$ the set of the infinite sequences of integers. For two given elements in $T$: $(a_{1},a_{2},a_{3},...)$ and $(b_{1},b_{2},b_{3},...)$, define the sum $(a_{1},a_{2},a_{3},...)+(b_{1},b_{2},b_{3},...)=(a_{1}+b_{1},a_{2}+b_{2},a_{3}+b_{3},...)$. Let $f: T\rightarrow$ $\mathbb{Z}$ a function such that: i) If $x\in T$ has exactly one of your terms equal $1$ and all the others equal $0$, then $f(x)=0$. ii)$f(x+y)=f(x)+f(y)$, for all $x,y\in T$. Prove that $f(x)=0$ for all $x\in T$

Let $ n$ be a positive integer. We consider the set $ P$ of all partitions of $ n$ into a sum of positive integers (the order is irrelevant). For every partition $ \alpha$, let $ a_{k}(\alpha)$ be the number of summands in $ \alpha$ that are equal to $ k, k = 1,2,...,n.$ Prove that $ \sum_{\alpha\in P}\frac{1}{1^{a_{1}(\alpha)}a_{1}(\alpha)!\cdot 2^{a_{2}(\alpha)}a_{2}(\alpha)!...n^{a_{n}(\alpha)}a_{n}(\alpha)!}=1.$

Let $ f : [0, \plus{}\infty) \to \mathbb R$ be a differentiable function. Suppose that $ \left|f(x)\right| \le 5$ and $ f(x)f'(x) \ge \sin x$ for all $ x \ge 0$. Prove that there exists $ \lim_{x\to\plus{}\infty}f(x)$.

A regular octahedron is formed by joining the centers of adjoining faces of a cube. The ratio of the volume of the octahedron to the volume of the cube is $ \textbf{(A)}\ \frac{\sqrt{3}}{12} \qquad\textbf{(B)}\ \frac{\sqrt{6}}{16} \qquad\textbf{(C)}\ \frac{1}{6} \qquad\textbf{(D)}\ \frac{\sqrt{2}}{8} \qquad\textbf{(E)}\ \frac{1}{4} $

Let $n$ be a positive integer and $M=\{1,2,\ldots, n\}.$ A subset $T\subset M$ is called [i]heavy[/i] if each of its elements is greater or equal than $|T|.$ Let $f(n)$ denote the number of heavy subsets of $M.$ Describe a method for finding $f(n)$ and use it to calculate $f(32).$

What is the maximum area of an isosceles trapezoid that has legs of length $1$ and one base twice as long as the other? $ \textbf{(A) }\frac 54 \qquad \textbf{(B) } \frac 87 \qquad \textbf{(C)} \frac{5\sqrt2}4 \qquad \textbf{(D) } \frac 32 \qquad \textbf{(E) } \frac{3\sqrt3}4 $

Let $D$ be a point inside the equilateral triangle $\triangle ABC$ such that $|AD|=\sqrt{2}, |BD|=3, |CD|=\sqrt{5}$. $m(\widehat{ADB}) = ?$ $\textbf{(A)}\ 120^{\circ} \qquad\textbf{(B)}\ 105^{\circ} \qquad\textbf{(C)}\ 100^{\circ} \qquad\textbf{(D)}\ 95^{\circ} \qquad\textbf{(E)}\ 90^{\circ}$

In every row of a grid $100 \times n$ is written a permutation of the numbers $1,2 \ldots, 100$. In one move you can choose a row and swap two non-adjacent numbers with difference $1$. Find the largest possible $n$, such that at any moment, no matter the operations made, no two rows may have the same permutations.