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

Counting the number of internal intersection points made bythe diagonals of irregular convex polygons where no three diagonalsare concurrent is an interesting problem in discrete mathematics.This paper uses an iterative approach to develop a summationrelation which tallies the total number of intersections, andshows that this total can be expressed as a simple sum of products.This iterative approach also motivates solutions for the numberof internal regions and number of line segments produced bythe diagonals