20

Part of 2007 Stanford Mathematics Tournament

Problems(1)

Intersection of Paths

Source:

Let there be 4n \plus{} 2 distinct paths in space with exactly 2n^2 \plus{} 6n \plus{} 1 points at which exactly two of the paths intersect. (A path never intersects itself.) What is the maximum number of points where exactly three paths intersect?