polygon cuts itself [Iran TST 2010]
Source:
May 10, 2010
combinatorics proposedcombinatorics
Problem Statement
Without lifting pen from paper, we draw a polygon in such away that from every two adjacent sides one of them is vertical.
In addition, while drawing the polygon all vertical sides have been drawn from up to down. Prove that this polygon has cut itself.