Chord Intersections

On a circle, n n points are being connected, each to each other, by chords. Assuming that no three chords meet in a common point, how many points of intersection (within the circle) are formed?

n ( n 1 ) ( n 2 ) ( n 3 ) 8 \frac{n(n-1)(n-2)(n-3)}{8} n ( n 1 ) 2 \frac{n(n-1)}{2} n ( n 1 ) ( n 2 ) ( n 3 ) 24 \frac{n(n-1)(n-2)(n-3)}{24} ( n 2 ) ( n 1 ) n ( n + 1 ) 4 \frac{(n-2)(n-1)n(n+1)}4

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.

1 solution

Ben Hambrecht
Sep 13, 2018

From an intersection point, trace back along the chords to find four endpoints on the circle. Also, any such group of 4 (out of n n ) uniquely determines an intersection point. So there is a one-to-one correspondence between points of intersection and (unordered) groups of 4 points. The total number of such groups is the binomial coefficient ( n 4 ) \binom{n}{4} , or n ( n 1 ) ( n 2 ) ( n 3 ) 24 \frac{n(n-1)(n-2)(n-3)}{24} .

(In the example, where n = 7 n=7 , there are ( 7 4 ) = 7 × 6 × 5 × 4 4 ! = 35 \binom{7}{4}=\frac{7\times 6\times 5\times 4}{4!} = 35 intersections.)

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...