Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.1 6/24/83; site stolaf.UUCP Path: utzoo!watmath!clyde!burl!ulysses!mhuxj!ihnp4!stolaf!gilje From: gilje@stolaf.UUCP (Mark A. Gilje) Newsgroups: net.puzzle Subject: High School Math problems:Answers and a toughie! Message-ID: <1975@stolaf.UUCP> Date: Thu, 4-Oct-84 20:02:40 EDT Article-I.D.: stolaf.1975 Posted: Thu Oct 4 20:02:40 1984 Date-Received: Sun, 7-Oct-84 02:33:38 EDT Organization: St. Olaf College, Northfield MN Lines: 19 The first two were easy I know and have heard from others. In case you didn't get them, the first is n(n+1)(2n+1)/6 which is the sum of the squares from 1 to n. The second answer comes from the fact that 1,000,000,000 = 10^9 = 2^9 * 5^9. For all of you who found the first one too easy, try this one. Find the greatest number of intersections in an n-gon if all vertices are connected. Ex. If you draw lines connecting all four vertices of a quadrilateral, you get one intersection. Good luck! Send answers to me and if you get the answer, buy yourself a Mars bar! Mark Gilje stolaf!gilje w