MHB Minimum area of an odd number-sided, equilateral polygon with side lengths of 1 unit.

checkitagain
Messages
137
Reaction score
1
Suppose you look at all of the equilateral (non-self-intersecting)
polygons** with an odd number of sides, and each side length is
equal to 1 unit.

For examples, the polygon with the fewest number of sides in this group
is the equilateral triangle, and then the next one is an equilateral pentagon.

Has anyone thought about this?

The area of the equilateral triangle is \dfrac{\sqrt{3}}{4} square units.Is the area of any of these certain polygons (beyond the equilateral triangle)

less than \dfrac{\sqrt{3}}{4} square units?
Please, do not attempt any sort of a proof. The one I saw
(and did not fully digest), is about two and a half pages long.
And, to me, I couldn't see the motivations for using the
strategies in the proof.** These are not limited to regular polygons in general.
The equilateral triangle happens to also be regular.
 
Mathematics news on Phys.org
Since you don't want a proof I'll just say no!
 
biffboy said:
Since you don't want a proof I'll just say no!

From the problem statement, I would have (some type of past tense) gone with "yes."

I would have thought about the snake-like effect of the sides twisting around and what
I believed to be a decreasing net area.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top