Eighteen points are chosen on a circle. An octadecagon ( sided polygon) is drawn. All of its vertices are joined to each other by straight lines (the polygon is designed in such a way that no three of these lines will be concurrent). Obviously, these straight lines will intersect each other, either inside or outside the polygon.
Find the total number of internal intersection points. (Vertices are not internal)
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The total number of internal intersection points is the same as the number of times 2 different diagonals intersect, and since 2 different diagonals require 4 different vertices.
Therefore, the total is equivalent to the number of ways of choosing 4 vettices out of 1 8 , which is ( 4 1 8 ) = 3 0 6 0 .