of the
Week
|
Problem
of the Week |
The following was posed by N. Schwarzkopf as a companion problem to Problem 136.
A diagonal in a convex polygon is a line joining two non-adjacent vertices. Take an n-sided convex polygon and draw all possible diagonals. Suppose that in doing so no three diagonals ever intersect at a common interior point. How many different regions are the interior of the polygon?
You are visitor number 3899
to this page.
ã2003 Alberto L. Delgado