A closed path is made up of line segments. Can one line, not containing a vertex of the path, intersect each of its segments?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Every time the line crosses one of the line segments, the line passes from being inside the closed path to being outside, or vice versa. Since an infinite line must both start and finish outside the closed path, it must change from being inside to being outside the path an even number of times. It is not possible to do this if the number of inside/outside changes is 2 0 1 9 , an odd number.