A couple days ago, a friend challenged me to solve a problem:
You have N vertices, each randomly placed on the edge of a unit circle. What is the formula (given N) that yields the average perimeter of these polygons.
Note that the points are not connected by the order in which they were placed, but rather by which points are closest together. i.e. You sweep in a clockwise direction tracing the polygon by the order you come across the points after the points have been randomly placed.
After some hard thought, I came up with what I think may be the solution:
$$n\int_0^{2\pi} \frac{(n-1)(1-\frac{x}{2\pi})^{n-2}}{2\pi} \times \sqrt{2-2\cos {x}} \, dx$$
This formula finds the average secant length length for $n$ vertices and multiplies that length by the number of sides; however, I have a feeling this does not solve the problem because the lengths of the secants in the polygon depend on each other.
I would like someone to confirm my suspicions, tell me that my formula works, or give me a different reason why the formula doesn't work.
Please Do Not Solve This Problem For Me
I still want to solve it on my own if this is not the solution.