play and relax: games for kids games
  Cut the knot: learn to enjoy mathematics
A math books store at a unique math study site. Learn to enjoy mathematics.
Google
Web CTK
Best sites for teachers
Sites for teachers
Sites for parents
Terms of use
Awards

Interactive Activities
CTK Exchange
CTK Insights - a blog

Games & Puzzles
What Is What
Arithmetic/Algebra
Geometry
Probability
Outline Mathematics
Make an Identity
Book Reviews
Eye Opener
Analog Gadgets
Inventor's Paradox
Did you know?...
Proofs
Math as Language
Things Impossible
Visual Illusions
My Logo
Math Poll
Cut The Knot!
MSET99 Talk
Other Math sites
Front Page
Movie shortcuts
Personal info
Privacy Policy

Guest book
News sites

Recommend this site

Best sites for teachers
Sites for teachers
Sites for parents

Education & Parenting

Manifesto: what CTK is about Search CTK Buying a book is a commitment to learning Table of content Things you can find on CTK Chronology of updates Email to Cut The Knot Recommend this page

Counting Triangles and Segments in a Polygon

This is an extension of the problem of diagonal count in a convex polygon. Now, we have an N-gon, i.e. a polygon with N vertices and N sides and M additional points in its interior. Connect all the given points without intersection until no segments could be added. Count the number of added segments and the triangles formed along the way. What can you say about the two numbers?


This applet requires Sun's Java VM 2 which your browser may perceive as a popup. Which it is not. If you want to see the applet work, visit Sun's website at http://www.java.com/en/download/index.jsp, download and install Java VM and enjoy the applet.


Buy this applet
What if applet does not run?

(Points are connected by dragging the cursor from one to the other.)

Copyright © 1996-2008 Alexander Bogomolny

 

 

 

 

 

 

 

 

 

 

 

 

 

 

The number of segments and triangles depends only on the numbers M and N.

Let, when no additional segments could be drawn, there be K triangles. Angles in K triangles sum up to 180oK. We may find the same quantity in a different way. Internal angles of the N-gon add up to 180o(N - 2). The angles around each of the internal points add up to 360oM. We thus obtain the relationship

  180oK = 180o(N - 2) + 360oM, or K = N - 2 + 2M.

So that the number of triangles is always K = N - 2 + 2M, which depends only on N and M, but not on the manner or order in which the points have been connected.

K triangles have the total of 3K sides, of which N belong only to one triangle, while the rest belong to two triangles each. The latter are exactly the segments that have been added by construction and whose number we are looking for. It's therefore equals (3K - N)/2.

  (3K - N)/2 = (3N - 6 + 6M - N)/2 = N - 3 + 3M.

Copyright © 1996-2008 Alexander Bogomolny

29397663Page copy protected against web site content infringement by Copyscape


Search:
Keywords:


Latest on CTK Exchange
try this puzzle ?/?? + ?/?? + ?/? ...
Posted by albert1950
0 messages
07:05 AM, Jul-10-08

Monty Hall Problem
Posted by linkdon
71 messages
03:06 PM, Jul-18-08

Missing information
Posted by roboknight
2 messages
07:32 AM, Jun-22-08

Golden Number linked to 666
Posted by Titus
4 messages
02:53 PM, Jul-19-08

Mistake on the page (an aside, Be ...
Posted by Max
4 messages
10:28 AM, Feb-28-08

trisection of an angle
Posted by Pytheus
2 messages
06:39 AM, Jul-14-08

You can drill a square hole
Posted by Giorgis
1 messages
10:15 PM, Jul-12-08