Determine all positive integers $n$ with the following property: for each triple $(a, b, c)$ of positive real numbers there is a triple $(k, \ell, m)$ of non-negative integer numbers so that $an^k$, $bn^{\ell}$ and $cn^m$ are the lengths of the sides of a (non-degenerate) triangle shapes.

For positive integer $n$, define $S_n$ to be the minimum value of the sum \[ \sum_{k=1}^n \sqrt{(2k-1)^2+a_k^2}, \] where $a_1,a_2,\ldots,a_n$ are positive real numbers whose sum is 17. There is a unique positive integer $n$ for which $S_n$ is also an integer. Find this $n$.

The side lengths $a,$ $b,$ $c$ of a triangle $ABC$ form an arithmetical progression (such that $b-a=c-b$). The side lengths $a_{1},$ $b_{1},$ $c_{1}$ of a triangle $A_{1}B_{1}C_{1}$ also form an arithmetical progression (with $b_{1}-a_{1}=c_{1}-b_{1}$). [Hereby, $a=BC,$ $b=CA,$ $c=AB, $ $a_{1}=B_{1}C_{1},$ $b_{1}=C_{1}A_{1},$ $c_{1}=A_{1}B_{1}.$] Moreover, we know that $\measuredangle CAB=\measuredangle C_{1}A_{1}B_{1}.$ Show that triangles $ABC$ and $A_{1}B_{1}C_{1}$ are similar.

Inside a square with side lengths $1$ a broken line of length $>1000$ without selfintersection is drawn. Show that there is a line parallel to a side of the square that intersects the broken line in at least $501$ points.

Determine all values $\alpha\in\mathbb R$ with the following property: if positive numbers $(x,y,z)$ satisfy the inequality \[x^2+y^2+z^2\le\alpha(xy+yz+zx),\] then $x,y,z$ are sides of a triangle.

It is given a regular hexagon in the plane. Let P be a point of the plane. Define s(P) as the sum of the distances from P to each side of the hexagon, and v(P) as the sum of the distances from P to each vertex. a) Find the locus of points P that minimize s(P) b) Find the locus of points P that minimize v(P)

Given a point $O$ and lengths $x, y, z$, prove that there exists an equilateral triangle $ABC$ for which $OA = x, OB = y, OC = z$, if and only if $x+y \geq z, y+z \geq x, z+x \geq y$ (the points $O,A,B,C$ are coplanar).

It is known that four of these sticks can be assembled into a quadrilateral. Is it always true that you can make a triangle out of three of them?

Find the largest possible integer $k$, such that the following statement is true: Let $2009$ arbitrary non-degenerated triangles be given. In every triangle the three sides are coloured, such that one is blue, one is red and one is white. Now, for every colour separately, let us sort the lengths of the sides. We obtain \[ \left. \begin{array}{rcl} & b_1 \leq b_2\leq\ldots\leq b_{2009} & \textrm{the lengths of the blue sides }\\ & r_1 \leq r_2\leq\ldots\leq r_{2009} & \textrm{the lengths of the red sides }\\ \textrm{and } & w_1 \leq w_2\leq\ldots\leq w_{2009} & \textrm{the lengths of the white sides }\\ \end{array}\right.\] Then there exist $k$ indices $j$ such that we can form a non-degenerated triangle with side lengths $b_j$, $r_j$, $w_j$. [i]Proposed by Michal Rolinek, Czech Republic[/i]

If $a,b,c$ are the sides of a triangle whose perimeter is equal to 2 then prove that: a) $abc+\frac{28}{27}\geq ab+bc+ac$; b) $abc+1<ab+bc+ac$ See also [url]http://www.mathlinks.ro/Forum/viewtopic.php?t=47939&view=next[/url] (problem 1) :)

Let $\vartriangle ABC$ be a triangle with orthocenter $H$ and altitudes $AD$, $BE$ and $CF$. Let $D'$, $E' $ and $F'$ be the intersections of the heights $AD$, $BE$ and $CF$, respectively, with the circumcircle of $\vartriangle ABC $, so that they are different points from the vertices of triangle $\vartriangle ABC$. Let $L$, $M$ and $N$ be the midpoints of $BC$, $AC$ and $AB$, respectively. Let $ P$, $Q$ and $R$ be the intersections of the circumcircle with $LH$, $MH$ and $NH$, respectively, such that $ P$ and $ A$ are on opposite sides of $BC$, $Q$ and $A$ are on opposite sides of $AC$ and $R$ and $C$ are on opposite sides of $AB$. Show that there exists a triangle whose sides have the lengths of the segments $D' P$, $E'Q$, and $F'R$.

Suppose $a,b,c$ are the sides of a triangle. Prove that \[ a^2(b+c-a)+b^2(a+c-b)+c^2(a+b-c) \leq 3abc \]

Let $ABCDEF$ be a convex hexagon such that $AB = BC, CD = DE, EF = FA$. Prove that $\frac{BC}{BE} +\frac{DE}{DA} +\frac{FA}{FC} \ge \frac{3}{2}$ . When does equality occur?

We are given the triangle $ABC$ with an area of $2000$. Let $P,Q,R$ be the midpoints of the sides $BC$, $AC$, $AB$. Let $U,V,W$ be the midpoints of the sides $QR$, $PR$, $PQ$. The lengths of the line segments $AU$, $BV$, $CW$ are $x$, $y$, $z$. Show that there exists a triangle with side lengths $x$, $y$ and $z$ and caluclate it's area.

Let ABC be a triangle and let $r, r_a, r_b, r_c$ denote the inradius and ex-radii opposite to the vertices $A, B, C$, respectively. Suppose that $a>r_a, b>r_b, c>r_c$. Prove that [b](a)[/b] $\triangle ABC$ is acute. [b](b)[/b] $a+b+c > r+r_a+r_b+r_c$.

Let $D$ be a point on the side $BC$ of a triangle $ABC$ such that $AD > BC$. Let $E$ be a point on the side $AC$ such that $\frac{AE}{EC} = \frac{BD}{AD-BC}$. Show that $AD > BE$.

Suppose there are $4n$ line segments of unit length inside a circle of radius $n$. Furthermore, a straight line $L$ is given. Prove that there exists a straight line $L'$ that is either parallel or perpendicular to $L$ and that $L'$ cuts at least two of the given line segments.

For $ a_i \in \mathbb{Z}^ \plus{}$, $ i \equal{} 1, \ldots, k$, and $ n \equal{} \sum^k_{i \equal{} 1} a_i$, let $ d \equal{} \gcd(a_1, \ldots, a_k)$ denote the greatest common divisor of $ a_1, \ldots, a_k$. Prove that $ \frac {d} {n} \cdot \frac {n!}{\prod\limits^k_{i \equal{} 1} (a_i!)}$ is an integer. [i]Dan Schwarz, Romania[/i]

Which of the following sets could NOT be the lengths of the external diagonals of a right rectangular prism [a "box"]? (An [i]external diagonal[/i] is a diagonal of one of the rectangular faces of the box.) $ \textbf{(A)}\ \{4, 5, 6\} \qquad\textbf{(B)}\ \{4, 5, 7\} \qquad\textbf{(C)}\ \{4, 6, 7\} \qquad\textbf{(D)}\ \{5, 6, 7\} \qquad\textbf{(E)}\ \{5, 7, 8\} $

Let $ABC$ be a triangle and $M,N,P$ be the midpoints of sides $BC, CA, AB$. The lines $AM, BN, CP$ meet the circumcircle of $ABC$ in the points $A_{1}, B_{1}, C_{1}$. Show that the area of triangle $ABC$ is at most the sum of areas of triangles $BCA_{1}, CAB_{1}, ABC_{1}$.

Let $T_1$ be a triangle having $a, b, c$ as lengths of its sides and let $T_2$ be another triangle having $u, v,w$ as lengths of its sides. If $P,Q$ are the areas of the two triangles, prove that \[16PQ \leq a^2(-u^2 + v^2 + w^2) + b^2(u^2 - v^2 + w^2) + c^2(u^2 + v^2 - w^2).\] When does equality hold?

Find the largest possible integer $k$, such that the following statement is true: Let $2009$ arbitrary non-degenerated triangles be given. In every triangle the three sides are coloured, such that one is blue, one is red and one is white. Now, for every colour separately, let us sort the lengths of the sides. We obtain \[ \left. \begin{array}{rcl} & b_1 \leq b_2\leq\ldots\leq b_{2009} & \textrm{the lengths of the blue sides }\\ & r_1 \leq r_2\leq\ldots\leq r_{2009} & \textrm{the lengths of the red sides }\\ \textrm{and } & w_1 \leq w_2\leq\ldots\leq w_{2009} & \textrm{the lengths of the white sides }\\ \end{array}\right.\] Then there exist $k$ indices $j$ such that we can form a non-degenerated triangle with side lengths $b_j$, $r_j$, $w_j$. [i]Proposed by Michal Rolinek, Czech Republic[/i]

Let $\alpha,\beta,\gamma$ measures of angles of opposite to the sides of triangle with measures $a,b,c$ respectively.Prove that $$2(cos^2\alpha+cos^2\beta+cos^2\gamma)\geq \frac{a^2}{b^2+c^2}+\frac{b^2}{a^2+c^2}+\frac{c^2}{a^2+b^2}$$

Show that there are infinitely many triangles with side lengths $a$, $b$, $c$, where $a$ is a prime, $b$ is a power of $2$ and $c$ is the square of an odd integer.

For each of $k=1,2,3,4,5$ find necessary and sufficient conditions on $a>0$ such that there exists a tetrahedron with $k$ edges length $a$ and the remainder length $1$.