This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Computer Science 340 Reasoning about Computation Homework 2 Due at the beginning of class on Wednesday, October 3, 2007 Problem 1 Consider a convex n-gon (a polygon with n sides). A chord is a line segment between two non-adjacent vertices. If all chords are drawn, in how many interior points do they intersect? (Assume no three chords intersect at the same point.) Solution: Number the vertices of the polygon clockwise starting from 1. Let ( a 1 ,a 2 ,a 3 ,a 4 ) be an ordered selection of 4 vertices. This tuple uniquely determines one chord intersection – namely the intersection of the chords ( a 1 ,a 3 ) and ( a 2 ,a 4 ). Conversely, each intersection is the intersection of exactly two chords and if we select any two intersecting chords ( a,b ) and ( c,d ) (without loss of generality a < b , c < d and a < c ), they uniquely determine an ordered tuple of the form ( a 1 ,a 2 ,a 3 ,a 4 ), namely ( a,c,b,d ). Therefore there is a one-to-one correspondence between the chord intersections and the ordered selections of 4 vertices. (It is absolutely essential to argue the correspondence is 1-1.) There are ( n 4 ) such selections (since once we pick the 4 elements we can just order them) and the answer to the problem is ( n 4 ) ....
View Full Document
- Fall '07
- Probability theory, blue ball