IMC 2011 · Problem 5

Day 218th IMC · Blagoevgrad, Bulgaria

Statement

Let F=A0A1AnF = A_0A_1 \dots A_n be a convex polygon in the plane. Define for all 1kn11 \le k \le n-1 the operation fkf_k which replaces FF with a new polygon

fk(F)=A0Ak1AkAk+1An,f_k(F) = A_0 \dots A_{k-1}A'_k A_{k+1} \dots A_n,

where AkA'_k is the point symmetric to AkA_k with respect to the perpendicular bisector of Ak1Ak+1A_{k-1}A_{k+1}. Prove that (f1f2fn1)n(F)=F(f_1 \circ f_2 \circ \dots \circ f_{n-1})^n(F) = F. We suppose that all operations are well-defined on the polygons, to which they are applied, i.e. results are convex polygons again. (A0,A1,,AnA_0, A_1, \dots, A_n are the vertices of FF in consecutive order.)

Official solution

Hidden so you can work on the problem first.