A broken line $A_1A_2 \ldots A_n$ is drawn in a $50 \times 50$ square, so that the distance from any point of the square to the broken line is less than $1$. Prove that its total length is greater than $1248.$
Problem
Source:
Tags: combinatorics, length, point set, polygon, IMO Shortlist
09.06.2018 17:21
Move a circle along the broken line (from $A_1$ to $A_n$) with radius $1$ such that it's center always lie on the broken lie. Area of the trace of a circle is equal to $2(A_1A_2+A_2A_3+...+A_{n-1}A_n)+\pi$. Meanwhile distance from any point of the square to the broken line is less than $1$, so every point of the square belongs to the trace of moving circle, so $2(A_1A_2+A_2A_3+...+A_{n-1}A_n)+\pi\ge2500$
09.06.2018 19:17
WolfusA wrote: Move a circle along the broken line (from $A_1$ to $A_n$) with radius $1$ such that it's center always lie on the broken lie. Area of the trace of a circle is equal to $2(A_1A_2+A_2A_3+...+A_{n-1}A_n)+\pi$. Meanwhile distance from any point of the square to the broken line is less than $1$, so every point of the square belongs to the trace of moving circle, so $2(A_1A_2+A_2A_3+...+A_{n-1}A_n)+\pi\ge2500$ Perhaps you mean perimeter?
09.06.2018 21:13
No, I mean the area of a figure, that looks like "shade" after moving a circle with radius 1 along the broken line, such that center of circle is moved along the line.