« Vrati se
Let ABCD be a parallelogram. A variable line g through the vertex A intersects the rays BC and DC at the points X and Y, respectively. Let K and L be the A-excenters of the triangles ABX and ADY. Show that the angle \measuredangle KCL is independent of the line g.

Slični zadaci

Let ABC be a triangle, and M the midpoint of its side BC. Let \gamma be the incircle of triangle ABC. The median AM of triangle ABC intersects the incircle \gamma at two points K and L. Let the lines passing through K and L, parallel to BC, intersect the incircle \gamma again in two points X and Y. Let the lines AX and AY intersect BC again at the points P and Q. Prove that BP = CQ.
Let \triangle ABC be an acute-angled triangle with AB \not= AC. Let H be the orthocenter of triangle ABC, and let M be the midpoint of the side BC. Let D be a point on the side AB and E a point on the side AC such that AE=AD and the points D, H, E are on the same line. Prove that the line HM is perpendicular to the common chord of the circumscribed circles of triangle \triangle ABC and triangle \triangle ADE.
Given a triangle ABC satisfying AC+BC=3\cdot AB. The incircle of triangle ABC has center I and touches the sides BC and CA at the points D and E, respectively. Let K and L be the reflections of the points D and E with respect to I. Prove that the points A, B, K, L lie on one circle.
Let n\geq 3 be a fixed integer. Each side and each diagonal of a regular n-gon is labelled with a number from the set \left\{1;\;2;\;...;\;r\right\} in a way such that the following two conditions are fulfilled:

1. Each number from the set \left\{1;\;2;\;...;\;r\right\} occurs at least once as a label.

2. In each triangle formed by three vertices of the n-gon, two of the sides are labelled with the same number, and this number is greater than the label of the third side.

(a) Find the maximal r for which such a labelling is possible.

(b) Harder version (IMO Shortlist 2005): For this maximal value of r, how many such labellings are there?

Easier version (5th German TST 2006) - contains answer to the harder versionEasier version (5th German TST 2006): Show that, for this maximal value of r, there are exactly \frac{n!\left(n-1\right)!}{2^{n-1}} possible labellings.
Given a triangle ABC, let D and E be points on the side BC such that \angle BAD = \angle CAE. If M and N are, respectively, the points of tangency of the incircles of the triangles ABD and ACE with the line BC, then show that
\frac{1}{MB}+\frac{1}{MD}= \frac{1}{NC}+\frac{1}{NE}.
Let triangle ABC be such that its circumradius is R = 1. Let r be the inradius of ABC and let p be the inradius of the orthic triangle A'B'C' of triangle ABC. Prove that p \leq 1 - \frac{1}{3 \cdot (1+r)^2}.