Outside of the plane of the triangle $ABC$ is given point $D$. (a) prove that if the segment $DA$ is perpendicular to the plane $ABC$ then orthogonal projection of the orthocenter of the triangle $ABC$ on the plane $BCD$ coincides with the orthocenter of the triangle $BCD$. (b) for all tetrahedrons $ABCD$ with base, the triangle $ABC$ with smallest of the four heights that from the vertex $D$, find the locus of the foot of that height.

Let $ABC$ be an equilateral triangle. $M$ is the midpoint of segment $AB$ and $N$ is the midpoint of segment $BC$. Let $P$ be the point outside $ABC$ such that the triangle $ACP$ is isosceles and right in $P$. $PM$ and $AN$ are cut in $I$. Prove that $CI$ is the bisector of the angle $MCA$ .

Find all functions $f: \mathbb{R} \to \mathbb{R}$ such that for all real number $x,y$, $$(y+1)f(yf(x))=yf(x(y+1)).$$

In right triangle $ABC$ the hypotenuse $\overline{AB}=5$ and leg $\overline{AC}=3$. The bisector of angle $A$ meets the opposite side in $A_1$. A second right triangle $PQR$ is then constructed with hypotenuse $\overline{PQ}=A_1B$ and leg $\overline{PR}=A_1C$. If the bisector of angle $P$ meets the opposite side in $P_1$, the length of $PP_1$ is: $\textbf{(A)}\ \frac{3\sqrt{6}}{4}\qquad \textbf{(B)}\ \frac{3\sqrt{5}}{4}\qquad \textbf{(C)}\ \frac{3\sqrt{3}}{4}\qquad \textbf{(D)}\ \frac{3\sqrt{2}}{2}\qquad \textbf{(E)}\ \frac{15\sqrt{2}}{16}$

Consider the $8\times 8\times 8$ Rubik’s cube below. Each face is painted with a different color, and it is possible to turn any layer, as you can with smaller Rubik’s cubes. Let $X$ denote the move that turns the shaded layer shown (indicated by arrows going from the top to the right of the cube) clockwise by $90$ degrees, about the axis labeled $X$. When move $X$ is performed, the only layer that moves is the shaded layer. Likewise, define move $Y$ to be a clockwise $90$-degree turn about the axis labeled Y, of just the shaded layer shown (indicated by the arrows going from the front to the top, where the front is the side pierced by the $X$ rotation axis). Let $M$ denote the move “perform $X$, then perform $Y$.” [img]https://cdn.artofproblemsolving.com/attachments/e/f/951ea75a3dbbf0ca23c45cd8da372595c2de48.png[/img] Imagine that the cube starts out in “solved” form (so each face has just one color), and we start doing move $M$ repeatedly. What is the least number of repeats of $M$ in order for the cube to be restored to its original colors?

Each field of the $n \times n$ array has been colored either red or blue, with the following conditions met: $\bullet$ if a row and a column contain the same number of red fields, the field at their intersection is red; $\bullet$ if a row and a column contain different numbers of red cells, the field at their intersection is blue. Prove that the total number of blue cells is even.

A graup of pirates had an argument and not each of them holds some other two at gunpoint.All the pirates are called one by one in some order.If the called pirate is still alive , he shoots both pirates he is aiming at ( some of whom might already be dead .) All shorts are immediatcly lethal . After all the pirates have been called , it turns out the exactly $28$ pirates got killed . Prove that if the pirates were called in whatever other order , at least $10$ pirates would have been killed anyway.

Let $C$ be the point of intersection of the tangent lines $l,\ m$ at $A(a,\ a^2),\ B(b,\ b^2)\ (a<b)$ on the parabola $y=x^2$ respectively. When $C$ moves on the parabola $y=\frac 12 x^2-x-2$, find the minimum area bounded by 2 lines $l,\ m$ and the parabola $y=x^2$.

Suppose we have distinct positive integers $a, b, c, d$, and an odd prime $p$ not dividing any of them, and an integer $M$ such that if one considers the infinite sequence \begin{align*} ca &- db \\ ca^2 &- db^2 \\ ca^3 &- db^3 \\ ca^4 &- db^4 \\ &\vdots \end{align*} and looks at the highest power of $p$ that divides each of them, these powers are not all zero, and are all at most $M$. Prove that there exists some $T$ (which may depend on $a,b,c,d,p,M$) such that whenever $p$ divides an element of this sequence, the maximum power of $p$ that divides that element is exactly $p^T$.

The sequence $(s_n)$, where $s_n= \sum_{k=1}^n \sin k$ for $n = 1, 2,\dots$ is bounded. Find an upper and lower bound.

A token is placed in one square of a $m\times n$ board, and is moved according to the following rules: [list] [*]In each turn, the token can be moved to a square sharing a side with the one currently occupied. [*]The token cannot be placed in a square that has already been occupied. [*]Any two consecutive moves cannot have the same direction.[/list] The game ends when the token cannot be moved. Determine the values of $m$ and $n$ for which, by placing the token in some square, all the squares of the board will have been occupied in the end of the game.

We have an $n \times n$ board, and in every square there is an integer. The sum of all integers on the board is $0$. We define an action on a square where the integer in the square is decreased by the number of neighbouring squares, and the number inside each of the neighbouring squares is increased by 1. Determine if there exists $n\geq 2$ such that we can turn all the integers into zeros in a finite number of actions.

Fifty students take part in a mathematical competition where a set of $8$ problems is given (same set to each participant). The final result showed that a total of $171$ correct solutions were obtained. Prove that there are $3$ of the given problems that have been correctly solved by the same $3$ students.

Three coins lie on integer points on the number line. A move consists of choosing and moving two coins, the first one $ 1$ unit to the right and the second one $ 1$ unit to the left. Under which initial conditions is it possible to move all coins to one single point?

A positive proper divisor is a positive divisor of a number, excluding itself. For positive integers $n \ge 2$, let $f(n)$ denote the number that is one more than the largest proper divisor of $n$. Determine all positive integers $n$ such that $f(f(n)) = 2$.

Assume that a real polynomial $P(x)$ has no real roots. Prove that the polynomial $$Q(x)=P(x)+\frac{P''(x)}{2!}+\frac{P^{(4)}(x)}{4!}+\ldots$$ also has no real roots.

Let $S_n=1-2+3-4+\cdots +(-1)^{n-1}n,\ n=1, 2, \cdots$. Then $S_{17}+S_{33}+S_{50}$ equals: $\textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ -1 \qquad\textbf{(E)}\ -2$

A right circular cylinder is inscribed in a sphere of radius $\sqrt3$. What is the height of the cylinder when its volume is maximal?

A round-robin tournament is one where each team plays every other team exactly once. Five teams take part in such a tournament getting: $3$ points for a win, $1$ point for a draw and $0$ points for a loss. At the end of the tournament the teams are ranked from first to last according to the number of points. (a) Is it possible that at the end of the tournament, each team has a different number of points, and each team except for the team ranked last has exactly two more points than the next-ranked team? (b) Is this possible if there are six teams in the tournament instead?

Suppose that $c\in\left(\frac{1}{2},1\right)$. Find the least $M$ such that for every integer $n\ge 2$ and real numbers $0<a_1\le a_2\le\ldots \le a_n$, if $\frac{1}{n}\sum_{k=1}^{n}ka_{k}=c\sum_{k=1}^{n}a_{k}$, then we always have that $\sum_{k=1}^{n}a_{k}\le M\sum_{k=1}^{m}a_{k}$ where $m=[cn]$

What fraction of the square is shaded? [asy] draw((0,0)--(0,3)--(3,3)--(3,0)--cycle); draw((0,2)--(2,2)--(2,0)); draw((0,1)--(1,1)--(1,0)); draw((0,0)--(3,3)); fill((0,0)--(0,1)--(1,1)--cycle,grey); fill((1,0)--(1,1)--(2,2)--(2,0)--cycle,grey); fill((0,2)--(2,2)--(3,3)--(0,3)--cycle,grey);[/asy] $ \text{(A)}\ \frac{1}{3}\qquad\text{(B)}\ \frac{2}{5}\qquad\text{(C)}\ \frac{5}{12}\qquad\text{(D)}\ \frac{3}{7}\qquad\text{(E)}\ \frac{1}{2} $

Let $k_1,k_2,\ldots,k_5$ be five circles in the lane such that $k_1$ and $k_2$ are externally tangent to each other at point $T,$ $k_3$ and $k_4$ are exetrnally tangent to both $k_1$ and $k_2,$ $k_5$ is externally tangent to $k_3$ and $k_4$ at points $U$ and $V,$ respectively, and $k_5$ intersects $k_1$ at $P$ and $Q,$ like shown in the figure. Prove that \[\frac{PU}{QU}\cdot\frac{PV}{QV}=\frac{PT^2}{QT^2}.\]

If $ a$ and $ b$ are positive and $ a\not\equal{} 1,\,b\not\equal{} 1$, then the value of $ b^{\log_b{a}}$ is: $ \textbf{(A)}\ \text{dependent upon }{b} \qquad \textbf{(B)}\ \text{dependent upon }{a}\qquad \textbf{(C)}\ \text{dependent upon }{a}\text{ and }{b}\qquad \textbf{(D)}\ \text{zero}\qquad \textbf{(E)}\ \text{one}$

Located on the plane $\left[ \frac43 n \right]$ rectangles with sides parallel to the coordinate axes. It is known that any rectangle intersects at least n rectangles. Prove that exists a rectangle that intersects all rectangles.

Show that for any triangle $ABC$, the following inequality is true: \[ a^2 + b^2 +c^2 > \sqrt{3} max \{ |a^2 - b^2|, |b^2 -c^2|, |c^2 -a^2| \} . \]