1. Use a combinatorial argument to show that with
2. We are given points arranged around a circle and the chords connecting each pair of points are drawn. If no three chords meet in a point, how many points of intersection are there? For example, when there are intersections.
I just started combinatorics so please don't leave out any necessary steps! Thanks again