There are \(n\) seats on a plane and each of the \(n\) passenger sat in the wrong seat. What is the total number of ways this could happen?
Let \(n\geq 2\) be a integer. Fix \(2n\) points in space and select any \(n^2+1\) segments between these points. Show that these segments must form at least \(n\) triangles.