Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site watrose.UUCP
Path: utzoo!watmath!watrose!jhputtick
From: jhputtick@watrose.UUCP (James Puttick)
Newsgroups: net.puzzle
Subject: Re: High School Math problems:Answers and a toughie!
Message-ID: <7050@watrose.UUCP>
Date: Mon, 22-Oct-84 14:41:39 EDT
Article-I.D.: watrose.7050
Posted: Mon Oct 22 14:41:39 1984
Date-Received: Tue, 23-Oct-84 00:51:16 EDT
References: <1975@stolaf.UUCP> <1590@ucla-cs.ARPA>, <1214@utah-gr.UUCP>
Organization: U of Waterloo, Ontario
Lines: 4

The problem stated 'n-gon', not 'regular n-gon'. Thus, for a regular
hexagon, there will indeed be just one point of intersection; but
with a bit of work we can make a 6-sided figure with the appropriate
nuymber of intersections. I don't believe 'n-gon' implies regularity.