- #1
quackdesk
- 7
- 0
Proving lemma about regular polygons?
Can a n-1 sided regular polygon be inscribed in n sided regular polygon for
[itex]\forall n \in \mathbb {N} \gt 3[/itex]
N/A
The area of n-1 sided regular polygon may be the largest of any n-1 polygon which is to be inscribed.
PS. It is polygon of course not pentagon MY BAD!
Homework Statement
Can a n-1 sided regular polygon be inscribed in n sided regular polygon for
[itex]\forall n \in \mathbb {N} \gt 3[/itex]
Homework Equations
N/A
The area of n-1 sided regular polygon may be the largest of any n-1 polygon which is to be inscribed.
The Attempt at a Solution
PS. It is polygon of course not pentagon MY BAD!
Last edited: