**Hosted by The Math
Forum**

Consider polygons with 10 sides in which we allow sides to intersect. Each intersection point can be an intersection point of two edges only, not three or more.

Find such a polygon with the largest number of intersections.

Consider the same question for a polygon with n sides.

- Is there a formula for the maximal number of attainable crossings when n is odd?
- Is there a known formula when n is even?
Source: Sigbjorn Vik, Macalester Student© Copyright 2001 Stan Wagon. Reproduced with permission.

[**Privacy Policy**]
[**Terms of Use**]

Home || The Math Library || Quick Reference || Search || Help

http://mathforum.org/

The Math Forum is a research and educational enterprise of the Drexel University School of Education.

30 Mar 2001