olymmath

DANUBE 2010

Danube Mathematical Competition 2010.

Other problems

Problem 1

Determine all integer numbers n≥3n\ge 3 such that the regular nn -gon can be decomposed into isosceles triangles by non-intersecting diagonals.

Problem 2

Given a triangle ABCABC , let A′,B′,C′A',B',C' be the perpendicular feet dropped from the centroid GG of the triangle ABCABC onto the sides BC,CA,ABBC,CA,AB respectively. Reflect A′,B′,C′A',B',C' through GG to A′′,B′′,C′′A'',B'',C'' respectively. Prove that the lines AA′′,BB′′,CC′′AA'',BB'',CC'' are concurrent.

Problem 3

All sides and diagonals of a convex nn -gon, n≥3n\ge 3 , are coloured one of two colours. Show that there exist [n+13]\left[\frac{n+1}{3}\right] pairwise disjoint monochromatic segments.

(Two segments are disjoint if they do not share an endpoint or an interior point).

Problem 5

Let n≥3n\ge3 be a positive integer. Find the real numbers x1≥0,…,xn≥0x_1\ge0,\ldots,x_n\ge 0 , with x1+x2+…+xn=nx_1+x_2+\ldots +x_n=n , for which the expression (n−1)(x12+x22+…+xn2)+nx1x2…xn(n-1)(x_1^2+x_2^2+\ldots+x_n^2)+nx_1x_2\ldots x_n takes a minimal value.