For a polygon with n sides, the sum of the interior angles is 180n - 360. If we find n positive numbers that sum up to 180n - 360, does that necessarily mean these numbers can be represented as the inside angles of a polygon with n sides? I can't prove this right or wrong...
do you know how to prove this formula (180n-360) for the n-polygon? knowing that prove will help you construct an arguement for either prove or disprove your conjecture.
http://www.algebralab.org/lessons/lesson.aspx?file=Geometry_AnglesSumPolygons.xml Maybe this website can help you prove it.
Huh thanks but I don't see how this helps... I'm not learning anything new here. Maybe my question wasn't clear. If if we have set of n terms and the sum of these terms is given by 180n - 360, does that necessarily mean that a polygon with these terms as its interior angles can be constructed? It's not about the fact that the sum of the interior angles of a polygon is 180n - 360... it's about going the other way around.
Well, if you can't work forward, than working backwards will be even more difficult. So that's why knowing the proof to that formula will help. Because then, you know the forward direction and can lay down some logic on how to go backwards if even possible.
I understood your question. strategy: start with n=3 (the smallest) and see what conclusions you get first.....note 180n-360 is in fact 180(n-2)
No it doesn't nessicarily mean that, with regards to what mjsd just quoted you on, werg. Say n=3, one angle could be 60 + e, another 60-e, and the other 6. You can't construct e since it is transcendental.
Well it's pretty obvious with n = 3, you can choose a point arbitrarily, draw a line then draw another line with one of the angle in between. Then you draw another line starting at the end of the second so that the angle is the second angle. Then at the intersection of the third line and the first the angle in between will obviously be what we are looking for. This method however is not as obvious going up, and when one of the number is greater than 180, we have to deal with convex polygons which makes this kind of construction difficult to imagine. Not to mention that you get really unusual shapes.
I don't believe Werg22 meant constructible in the sense of being constructible with ruler and compass, but merely whether or not there would exist an n-sided polygon that had those n angles for its internal angles. My thoughts on the problem are that if you can find n numbers that add to 180(n-2) then you can construct a polygon that has at least (n-2) of these same angles, I haven't proved this, but it makes some bit of sense, however I am not sure as to whether the final two angles are guaranteed to be equal to the original two numbers in your sequence, because there are an infinite number of other numbers that will sum to the remaining angle measure that must be present in the n-gon. Edit: For example with a triangle you can arbitrarily choose one angle, and then the other two angles depend on the lengths of the sides that form the original angle, I believe it will be a similar situation for larger n. Edit 2: Maybe you should disregard everything I just said, after a bit more thought it seems you may be able to choose arbitrarily (n-1) angles which then guarentees you the final angle to be from the initial sequence.
Yeah, this is what I described in post 9. It's not this simple. For other angles, what guarantee do we have that the final line won't intersect the first line in such a way that it would have to cut through the other lines?
Yes, you have a good point which you might try to construct a counter example from, however, there may be some restriction you could make on the set of angle measures that would make this always possible.
I was thinking about angles between 90 and 180... then again what guarantees that we won't be constructing a spiral?
Yes, but if you think about this a little bit you will see that the restrictions heavily rely on the previous angles. Your last angle chosen will hardly be a choice! So, the chance of having a random set of angles contruct a polygon is pretty much nil it seems.
Let's assume the lengths are adjustable as we construct. So, basically choosing any three angles that totals to 180 degrees can be constructed into a triangle. Each angle has a boundary to not allow the sum to go over 180. Example, for the first angle a we have the choice 0 < a < 180. For the second angle b, b < 0 < 180-a. For the third angle c, c=180-a-b. So, technically the last angle you have no choice as I mentionned earlier.
The last angle will obviously not be chosen. The difficulty here is in if there is a way to adjust the length of the constructed polygon so that the intersection of the last and first line will form a closed n sides polygon with the other lines. For example, there are constructions where the two lines intersect in such a way that the last line has to cut through other lines. And the set is not that random, it has the property that the sum of its terms is 180n - 360...
If the length's are fully adjustable then I say yes it is possible. I would say do a couple examples and create an algorithm on how to construct it where the algorithm provides rules to how long they are. So, you have to do dirty work here.
if it works for n=3, i think it will work for all n, but for n >3 the way you permute your arbitrary positive numbers inside the polygon may not be totally arbitrary.