Iterating the number of intersection points of the diagonals of irregular convex polygons, or C(n,4) the hard way !

• Leith Hathout ^[1]
  1. [1] 660 S. Figueroa St., Suite 1200, Los Angeles, CA
• Localización: Teaching mathematics and its applications, ISSN 0268-3679, Vol. 26, Nº. 1, 2007, págs. 38-44
• Idioma: inglés
• DOI: 10.1093/teamat/hrl002
• Texto completo no disponible (Saber más ...)
• Resumen

  • 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