We create some segments in a regular \(n\)-gon by joining endpoints of the \(n\)-gon. What’s the maximum number of such segments while ensuring that no two segments are parallel? The segments are allowed to be sides of the \(n\)-gon - that is, joining adjacent vertices of the polygon.
James furiously cuts a rectangular sheet of paper with scissors. Every second he cuts a random piece by an unsystematic rectilinear cut into two parts.
a) Find the mathematical expectation of the number of sides of a polygon (made from a piece of paper) that James randomly picks up after an hour of such work.
b) Solve the same problem if at first the piece of paper had the form of an arbitrary polygon.