Six segments $S_1, S_2, S_3, S_4, S_5,$ and $S_6$ are given in a plane. These are congruent to the edges $AB, AC, AD, BC, BD,$ and $CD$, respectively, of a tetrahedron $ABCD$. Show how to construct a segment congruent to the altitude of the tetrahedron from vertex $A$ with straight-edge and compasses.

A [i]string of parentheses[/i] is any word that can be composed by the following rules. 1) () is a string of parentheses. 2) If $s$ is a string of parentheses then $(s)$ is a string of parentheses. 3) If $s$ and t are strings of parentheses then $st$ is a string of parentheses. The [i]midcode [/i] of a string of parentheses is the tuple of natural numbers obtained by finding, for all pairs of opening and its corresponding closing parenthesis, the number of characters remaining to the left from the medium position between these parentheses, and writing all these numbers in non-decreasing order. For example, the midcode of $(())$ is $(2,2)$ and the midcode of ()() is $(1,3)$. Prove that midcodes of arbitrary two different strings of parentheses are different.

Given triangle $ABC$ and point $P$ on the circumcircle of triangle $ABC$. Suppose the line $CP$ intersects line $AB$ at point $E$ and line $BP$ intersect line $AC$ at point $F$. Suppose also the perpendicular bisector of $AB$ intersects $AC$ at point $K$ and the perpendicular bisector of $AC$ intersects $AB$ at point $J$. Prove that $$\left( \frac{CE}{BF}\right)^2= \frac{AJ \cdot JE }{ AK \cdot KF}$$

Does there exist a function $f : \mathbb{R} \rightarrow \mathbb{R}$, which satisfies both conditions : [b]a)[/b] $f( x + y + z) \leq 3(xy + yz + zx)$ for all real numbers $x , y , z$ and [b]b)[/b] there exist function $g$ and natural number $n$, such that $g(g(x)) = x ^ {2n + 1}$ and $f(g(x)) = (g(x)) ^2$ for every real number $x$ ?

$16$ progamers are playing in a single elimination tournament. Each player has a different skill level and when two play against each other the one with the higher skill level will always win. Each round, each progamer plays a match against another and the loser is eliminated. This continues until only one remains. How many different progamers can reach the round that has $2$ players remaining?

Given the acute triangle $ABC$. A diameter of the circumscribed circle of the triangle intersects the sides $AC$ and $BC$, dividing the side $BC$ in half. Show that the same diameter divides the side $AC$ in a ratio of $1: 3$, calculated from $A$, if and only if $\tan B = 2 \tan C$.

Let $a$ and $k$ be positive integers. Prove that for every positive integer $d$ there exists a positive integer $n$ such that $d$ divides $ka^n + n.$

Prove that for every natural number $a_1>1$ there exists an increasing sequence of natural numbers $a_n$ such that $a^2_1+a^2_2+\cdots+a^2_k$ is divisible by $a_1+a_2+\cdots+a_k$ for all $k \geq 1$. [i]A. Golovanov[/i]

A circle with center O inscribed in a convex quadrilateral ABCD is tangent to the lines AB, BC, CD, DA at points K, L, M, N respectively. Assume that the lines KL and MN are not parallel and intersect at the point S. Prove that BD is perpendicular OS. I think it is very good and beautiful problem. I solved it without help. I'm wondering is it a well known theorem? Also I'm interested who is the creator of this problem? I'll be glad to see simple solution of this problem.

If $ m$ and $ b$ are real numbers and $ mb > 0$, then the line whose equation is $ y \equal{} mx \plus{} b$ [u]cannot[/u] contain the point $ \textbf{(A)}\ (0,1997)\qquad \textbf{(B)}\ (0,\minus{}1997)\qquad \textbf{(C)}\ (19,97)\qquad \textbf{(D)}\ (19,\minus{}97)\qquad \textbf{(E)}\ (1997,0)$

Claire takes a square piece of paper and folds it in half four times without unfolding, making an isosceles right triangle each time. After unfolding the paper to form a square again, the creases on the paper would look like

In an isosceles triangle $ABC$ with $BC=AC$ and $\angle B<60^\circ$, $I$ is the incenter and $O$ the circumcenter. The circle with center $E$ that passes through $A,O$ and $I$ intersects the circumcircle of $\triangle ABC$ again at point $D$. Prove that the lines $DE$ and $CO$ intersect on the circumcircle of $ABC$.

A polygon is called [i]convex[/i] if all its internal angles are smaller than 180$^{\circ}$. Given a convex polygon, prove that one can find three distinct vertices $A$, $P$, and $Q$, where $PQ$ is a side of the polygon, such that the perpendicular from $A$ to the line $PQ$ meets the segment $PQ$ (possible at $P$ of $Q$).

Determine all $2\times2$ integer matrices $A$ having the following properties: $1.$ the entries of $A$ are (positive) prime numbers, $2.$ there exists a $2\times2$ integer matrix $B$ such that $A=B^2$ and the determinant of $B$ is the square of a prime number.

Suppose $a,b,c\in \mathbb R^+$. Prove that :\[\left(\frac ab+\frac bc+\frac ca\right)^2\geq (a+b+c)\left(\frac1a+\frac1b+\frac1c\right)\]

A graph $ G$ with $ n$ vertices is given. Some $ x$ of its edges are colored red so that each triangle has at most one red edge. The maximum number of vertices in $ G$ that induce a bipartite graph equals $ y.$ Prove that $ n\ge 4x/y.$