Abstract

Let K be a convex pentagon in the plane and let K1 be the pentagon bounded by the diagonals of K. It has been conjectured that the maximum of the ratio between the areas of K1 and K is reached when K is an affine regular pentagon. In this paper we prove this conjecture. We also show that for polygons with at least six vertices the trivial answers are the best possible.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.