Starting with an empty string, we create a string by repeatedly appending one of the letters $H$, $M$, $T$ with probabilities $\frac 14$, $\frac 12$, $\frac 14$, respectively, until the letter $M$ appears twice consecutively. What is the expected value of the length of the resulting string?

Let $ABC$ be an acute triangle such that $AB$ is the shortest side of the triangle. Let $D$ be the midpoint of the side $AB$ and $P$ be an interior point of the triangle such that $\angle CAP = \angle CBP = \angle ACB$. Denote by M and $N$ the feet of the perpendiculars from $P$ to $BC$ and $AC$, respectively. Let $p$ be the line through $ M$ parallel to $AC$ and $q$ be the line through $N$ parallel to $BC$. If $p$ and $q$ intersect at $K$ prove that $D$ is the circumcenter of triangle $MNK$.

Let $A_1B_3A_2B_1A_3B_2$ be a cyclic hexagon such that $A_1B_1,A_2B_2,A_3B_3$ intersect at one point. Let $C_1=A_1B_1\cap A_2A_3,C_2=A_2B_2\cap A_1A_3,C_3=A_3B_3\cap A_1A_2$. Let $D_1$ be the point on the circumcircle of the hexagon such that $C_1B_1D_1$ touches $A_2A_3$. Define $D_2,D_3$ analogously. Show that $A_1D_1,A_2D_2,A_3D_3$ meet at one point.

It is known about the numbers $a, b$ and $c$ that $\frac{a}{b+c-a}=\frac{b}{a ​​+ c-b}= \frac{c}{a ​​+ b-c}$. What values ​​can an expression take $\frac{(a + b) (b + c) (a + c)}{abc}$ ?

A rectangular box has width $12$ inches, length $16$ inches, and height $\tfrac{m}{n}$ inches, where $m$ and $n$ are relatively prime positive integers. Three faces of the box meet at a corner of the box. The center points of those three faces are the vertices of a triangle with an area of $30$ square inches. Find $m+n$.

Let $n$ be the smallest positive integer that is a multiple of $75$ and has exactly $75$ positive integral divisors, including $1$ and itself. Find $n/75$.

In an acute triangle $ABC$, let $ \overline {AK}, \overline {BL}, \overline {CM} $ be the altitudes of the triangle concurrent at the point $ H $ and let $ P $ the midpoint of $ \overline {AH} $. Let's define $ S = \overline {BH} \cap \overline {MK} $ and $ T = \overline {LP} \cap \overline {AB} $. Show that $ \overline {TS} \perp \overline {BC} $

On a $n \times n$ grid, each edge are written with $=$ or $\neq$. We need to filled every cells with color black or white. Find the largest constant $k$, such that for every $n>777771449$ and any layout of $=$ and $\neq$, we can always find a way to colored every cells, such that at least $k \cdot 2n(n-1)$ neighboring cells, there colors conform to the symbols on the edge. (Namely, two cells are filled with the same color if $=$ was written on their edge; two cells are filled with different colors if $\neq$ was written on their edge) [i]Proposed by chengbilly & sn6dh[/i]

([b]3[/b]) Let $ \ell$ be the line through $ (0,0)$ and tangent to the curve $ y \equal{} x^3 \plus{} x \plus{} 16$. Find the slope of $ \ell$.

$(a)$ Is it possible to partition the segment $[0,1]$ into two sets $A$ and $B$ and to define a continuous function $f$ such that for every $x\in A \ f(x)$ is in $B$, and for every $x\in B \ f(x)$ is in $A$? $(b)$ The same question with $[0,1]$ replaced by $[0,1).$

Given the system of equations \[ ax \plus{} (a \minus{} 1)y \equal{} 1 \\ (a \plus{} 1)x \minus{} ay \equal{} 1. \] For which one of the following values of $ a$ is there no solution $ x$ and $ y$? $ \textbf{(A)}\ 1\qquad \textbf{(B)}\ 0\qquad \textbf{(C)}\ \minus{} 1\qquad \textbf{(D)}\ \frac {\pm \sqrt {2}}{2}\qquad \textbf{(E)}\ \pm\sqrt {2}$

$3.$ Congruent circles $k_{1}$ and $k_{2}$ intersect in the points $A$ and $B$. Let $P$ be a variable point of arc $AB$ of circle $k_{2}$ which is inside $k_{1}$ and let $AP$ intersect $k_{1}$ once more in point $C$, and the ray $CB$ intersects $k_{2}$ once more in $D$. Let the angle bisector of $\angle CAD$ intersect $k_{1}$ in $E$, and the circle $k_{2}$ in $F$. Ray $FB$ intersects $k_{1}$ in $Q$. If $X$ is one of the intersection points of circumscribed circles of triangles $CDP$ and $EQF$, prove that the triangle $CFX$ is equilateral.

Let $ n$ be an integer greater than $ 3.$ Points $ V_{1},V_{2},...,V_{n},$ with no three collinear, lie on a plane. Some of the segments $ V_{i}V_{j},$ with $ 1 \le i < j \le n,$ are constructed. Points $ V_{i}$ and $ V_{j}$ are [i]neighbors[/i] if $ V_{i}V_{j}$ is constructed. Initially, chess pieces $ C_{1},C_{2},...,C_{n}$ are placed at points $ V_{1},V_{2},...,V_{n}$ (not necessarily in that order) with exactly one piece at each point. In a move, one can choose some of the $ n$ chess pieces, and simultaneously relocate each of the chosen piece from its current position to one of its neighboring positions such that after the move, exactly one chess piece is at each point and no two chess pieces have exchanged their positions. A set of constructed segments is called [i]harmonic[/i] if for any initial positions of the chess pieces, each chess piece $ C_{i}(1 \le i \le n)$ is at the point $ V_{i}$ after a finite number of moves. Determine the minimum number of segments in a harmonic set.

Let $a$, $b$, $c$, $d$ and $e$ be distinct positive real numbers such that $a^2+b^2+c^2+d^2+e^2=ab+ac+ad+ae+bc+bd+be+cd+ce+de$ $a)$ Prove that among these $5$ numbers there exists triplet such that they cannot be sides of a triangle $b)$ Prove that, for $a)$, there exists at least $6$ different triplets

The numbers $1,2,...,1970$ are written on a board. One is allowed to remove $2$ numbers and to write down their difference instead. When repeated often enough, only one number remains. Show that this number is odd.

What is the greatest integer not exceeding the number $\left( 1 + \frac{\sqrt 2 + \sqrt 3 + \sqrt 4}{\sqrt 2 + \sqrt 3 + \sqrt 6 + \sqrt 8 + 4}\right)^{10}$? $ \textbf{(A)}\ 2 \qquad\textbf{(B)}\ 10 \qquad\textbf{(C)}\ 21 \qquad\textbf{(D)}\ 32 \qquad\textbf{(E)}\ 36 $