NotesFAQContact Us
Collection
Advanced
Search Tips
Peer reviewed Peer reviewed
Direct linkDirect link
ERIC Number: EJ785736
Record Type: Journal
Publication Date: 2007
Pages: 7
Abstractor: Author
Reference Count: 0
ISBN: N/A
ISSN: ISSN-0268-3679
Iterating the Number of Intersection Points of the Diagonals of Irregular Convex Polygons, or C (n, 4) the Hard Way!
Hathout, Leith
Teaching Mathematics and Its Applications: An International Journal of the IMA, v26 n1 p38-44 2007
Counting the number of internal intersection points made by the diagonals of irregular convex polygons where no three diagonals are concurrent is an interesting problem in discrete mathematics. This paper uses an iterative approach to develop a summation relation which tallies the total number of intersections, and shows that this total can be expressed as a simple sum of products. This iterative approach also motivates solutions for the number of internal regions and number of line segments produced by the diagonals.
Oxford University Press. Great Clarendon Street, Oxford, OX2 6DP, UK. Tel: +44-1865-353907; Fax: +44-1865-353485; e-mail: jnls.cust.serv@oxfordjournals.org; Web site: http://teamat.oxfordjournals.org/
Publication Type: Journal Articles; Reports - Descriptive
Education Level: N/A
Audience: N/A
Language: English
Sponsor: N/A
Authoring Institution: N/A