Olympiad Maths Prep

Track / Stage 6 / 297 of 400 #1297 of 2000

Problem 1297

National olympiad, first round
Geometry Difficulty 6.5 Prove it Cesko-Slovacko-Poljsko 2006 · Czech-Polish-Slovak Mathematical Match · 2006

Find out if there is a convex pentagon A1A2A3A4A5A_1A_2A_3A_4A_5, such that for i=1,2,3,4,5i = 1, 2, 3, 4, 5 the lines AiAi+3A_iA_{i+3}, Ai+1Ai+2A_{i+1}A_{i+2} are not parallel and intersect in a point BiB_i and also the points B1,B2,B3,B4,B5B_1, B_2, B_3, B_4, B_5 are collinear. (We assume A6=A1,A7=A2,A8=A3A_6 = A_1, A_7 = A_2, A_8 = A_3.)

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

We will find such a pentagon. The obstruction is, symmetric pentagons (for which it could be easier to show) have always at least one pair of lines AiAi+3A_iA_{i+3}, Ai+1Ai+2A_{i+1}A_{i+2} parallel. First we will solve more elementary problem - we will find pentagon A1A2A3A4A5A_1A_2A_3A_4A_5 with only four points BiB_i collinear. Here we afford to look for it among symmetric pentagons. To simplify the situation, say A2,A3,A4A_2, A_3, A_4 be vertices of the square QA2A3A4QA_2A_3A_4 with QA2=1QA_2 = 1 and A1,A5A_1, A_5 be on sides QA2QA_2 and QA4QA_4 with QA1=QA5=pQA_1 = QA_5 = p (fig. 3). By symmetry B1B2B3B5B_1B_2 \parallel B_3B_5. It can be observed when p0p \to 0, i.e. when A1,A5A_1, A_5 be near QQ, the

Figure 1

line B3B5B_3B_5 is more closely to QQ than B1B2B_1B_2. On the other side, when p1p \to 1, points A1,A5A_1, A_5 be near A2A_2, A4A_4 and B1B2B_1B_2 is more closely to QQ (or even on the other side of QQ) than B3B5B_3B_5. Thus we can expect for some p(0,1)p \in (0, 1) both lines be identical and B1,B2,B3,B5B_1, B_2, B_3, B_5 collinear. We will find such pp.

Let B5Q=B3Q=qB_5Q = B_3Q = q and B1A2=rB_1A_2 = r. By similarity of triangles B5QA5,B5A2A3B_5QA_5, B_5A_2A_3 we get
qp=q+11orq=p1p. \frac{q}{p} = \frac{q+1}{1} \quad \text{or} \quad q = \frac{p}{1-p}.
By similarity of triangles B1A2A1,B1A3A4B_1A_2A_1, B_1A_3A_4 we get
r1p=r+11orr=1pp. \frac{r}{1-p} = \frac{r+1}{1} \quad \text{or} \quad r = \frac{1-p}{p}.
Finally, to reach B1B_1 lying on the line B3B5B_3B_5, it suffices triangles B5QB3,B5A2B1B_5QB_3, B_5A_2B_1 be similar. This holds when
qq=q+1rorq+1=r. \frac{q}{q} = \frac{q+1}{r} \quad \text{or} \quad q+1 = r.
Substituting by previous we obtain the equation
p1p+1=1pp \frac{p}{1-p} + 1 = \frac{1-p}{p}
which can be transformed into p23p+1=0p^2 - 3p + 1 = 0. The only solution in (0,1)(0, 1) is p=(35)/2p = (3 - \sqrt{5})/2. For this value points B1,B3,B5,B2B_1, B_3, B_5, B_2 lies on one line. Moreover lines A1A5,A2A4A_1A_5, A_2A_4 are parallel to it. In some sense these three lines intersect "in infinity" in "point" B4B_4 and all points BiB_i be collinear. To satisfy given conditions it suffices to find proper map, which maps "point from infinity" to particular point (and preserves all the other necessary properties, e.g. maps lines to lines etc.). Such a map is projection (fig. 4). Consider ordinary cartesian coordinate system in space. Pentagon A1A2A3A4A5=UA_1A_2A_3A_4A_5 = U can be imbedded

Figure 2

into the plane OyzOyz with A2A_2 be in origin and with A1A_1, A3A_3 be on positive axis zz, yy. Let P(2,0,1)P \equiv (2,0,-1) be the projection-point. Every line PAiPA_i intersects the plane OxyOxy in point AiA'_i. Thus we get pentagon A1A2A3A4A5=UA'_1A'_2A'_3A'_4A'_5 = U'. It follows from the properties of the map, that UU' satisfies conditions given in the formulation of the problem. To check this, it is also sufficient to do some calculation. Namely one can easily enumerate the coordinates of AiA'_i in the plane OxyOxy and get
A1(35,0),A2(0,0),A3(1,0),A4(1,12),A5(1,354). A'_1 \equiv (3 - \sqrt{5}, 0), \quad A'_2 \equiv (0, 0), \quad A'_3 \equiv (1, 0), \quad A'_4 \equiv (1, \frac{1}{2}), \quad A'_5 \equiv (1, \frac{3-\sqrt{5}}{4}).
By another manual calculations it is easy to check B1,B2,B3,B4,B5B'_1, B'_2, B'_3, B'_4, B'_5 be collinear (fig. 5).

Figure 3

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.