Hosted by The Math Forum

Problem of the Week 933

Ultra Zigzag

_____________________________________________
MacPoW Home ||  Forum PoWs ||  Teachers' Place ||  Student Center ||  Search MacPoW
_____________________________________________

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.

  1. Is there a formula for the maximal number of attainable crossings when n is odd?
  2. 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 
_____________________________________

© 1994-2014 Drexel University. All rights reserved.
http://mathforum.org/
The Math Forum is a research and educational enterprise of the Drexel University School of Education.The Math Forum is a research and educational enterprise of the Drexel University School of Education.

30 Mar 2001