You've got.
Polygon, we have an even number of notes or points or vertices and an even number of sides, and each
side has got.
Each side has size one or landform.
Right.
And you are supposed to find the minimum size square.
Right.
In which you can get that regular polygon and get it polygon right into the square.
So basically the minimum size bounding box square.
Right.
As simple as that.
Cool.
Why do we have to do here?
Obviously, you have to take a lot of examples on paper and see how it looks like.
I only need to think about.
N equals free I think.
I don't know if you got here the example, but it's really simple.
We can Google search.
Right.
This is the Barney Book Square.
So its size is actually equal to the length of this diagonal.
So for this case.
We have to get the length of this diagonal.
How do we get the length of this diagonal?
Well, I don't know if I have complicated or not, but what I did is that I've previously found some
article which was giving me the formula for the longest diagonal in some more regular polygon with even
vertices.
Right.
So if you have even vertices, which means both C one and C two problems.
Right.
The formula is correct for both of them.
You basically, with that formula can get the length of the longest diagonal.
One more time, guys, really quick, because it covered my face, my face covered image.
One more time, really quick.
I figured the formula for this longest diagonal, which was this one, and because I knew the length
of this side, which is one.
And on the Internet, the length of the longest diagonal, we have the Pythagoras formula.
I got the length of my desires square and that's it.