Maximum perimeter of small polygons with a power-of-two number of vertices
Statement
Determine the maximum possible perimeter of a convex polygon in the plane with diameter at most when the number of vertices is with ; equivalently, determine an optimal small -gon for every .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.