You are missing trading opportunities:
- Free trading apps
- Over 8,000 signals for copying
- Economic news for exploring financial markets
Registration
Log in
You agree to website policy and terms of use
If you do not have an account, please register
1) It is difficult to prove the fact that the vertices of the maximal area must lie on the same circle (Cramer's theorem). I do not know how to prove it or where to read the proof.
2) I don't really believe in the existence of analytical formula for maximal area or radius of a circle.
3) The sum of array elements can be calculated by MathSum()
1) I think this is an obvious fact. And it is easy to prove by understanding that the maximal area of a triangle with a given vertex A, midline h and given opposite side a is the area of an isosceles triangle, when the angle at the given vertex is maximal. And the area of such triangle is h*a/2
Imagine that all nodes between given sides of polygons are flexible (like in a child's construction set on magnets) and it is clear that we can arrange the sides in such a way that all vertices have a common equidistant centre (provided that the larger side is smaller than the sum of other sides, otherwise they cannot be connected), i.e. they are inscribed in a circle. And this will be the maximum area, since it consists of the sum of the areas of isosceles triangles, with a side equal to the radius of this circle.
2) I believe
3) I did not find such formula in MQL4 or MQL5
1) I think this is an obvious fact.
intuitively yes, but it doesn't even stretch to a rigid proof by any stretch.
2) I believe
If there was one, it could be found, there is only a system of equations
1) The difficulty is in proving the fact that the vertices of the mnc with the maximal area must lie on the same circle (Cramer's theorem). I don't know how to prove it or where to read the proof.
I did not find such a theorem at all, only references to this property.
http://algolist.ru/maths/geom/polygon/area.php
as always, useless links and no words on the point.
as usual useless references and not a word of substance.
it's really useless to you
1) I think this is an obvious fact. And it is easily proved by understanding that the maximal area of a triangle with a given vertex A, midline h and given opposite side a is the area of an isosceles triangle when the angle at the given vertex is maximal. And the area of such triangle is h*a/2
Imagine that all nodes between given sides of polygons are flexible (like in a child's construction set on magnets) and it is clear that we can arrange the sides in such a way that all vertices have a common equidistant centre (provided that the larger side is smaller than the sum of other sides, otherwise they cannot be connected), i.e. inscribed in a circle. And this will be the maximum area, since it consists of the sum of the areas of isosceles triangles, with a side equal to the radius of this circle.
2) I believe
3) I haven't found such formula in MQL4 or MQL5.
1) Perhaps it can be somehow formalized as equality to zero of variation (derivative) of the area of a mnc by coordinates of vertices when they lie on one circle. Only this is a condition of local extremality and we need to prove 1) that it is a maximum and 2) that it is global.
3) MathSum()
s=6.0
You get a polynomial from the roots of the other polynomials, and from all this baad over take three derivatives. Kilometric formulas. And who knows, maybe there's a surprise waiting at the end. We'll have to get some kind of trick.
intuitively yes, but it doesn't even amount to a rigid proof by any stretch.
if there was one, it could be found, there is only a system of equations
I couldn't find such a theorem at all, only mentions of this property.
as usual useless references and not a single word on the point.
Googled "maximum area polygon given sides", found only that this result is "well known") and numerical solutions like the one given by Nikolay.
Apparently, you have to go through some ancient books on geometry - nowadays they don't like to expound on such things.
The above solution is only valid for polygons whose centre of the circumcircle lies inside the perimeter. Try triangle {2,2,3.9}
In general terms (approximation by precision double) the solution is as follows:
The above solution is only valid for polygons whose centre of the circumcircle lies inside the perimeter. Try triangle {2,2,3.9}
...
What does this have to do with a triangle if the problem is to find a polygon with the maximum area given the dimensions of the sides?
Oops. I myself have only one of the variants counting correctly)))
UPD: Corrected.
You get a polynomial from the roots of the other polynomials, and from all this baad over take three derivatives. Kilometric formulas. And who knows, maybe there's a surprise waiting at the end. We'll have to get some kind of trick.
Here's the function for the sum of all angles versus the radius. The solution area of 2p is highlighted in green.
Maybe this will help.
I'm too lazy to rack my brains, especially since I'm not very good at the tower.