Optimal Road Arrangement for Towns Connected by a Polygon

  • Thread starter Thread starter Natasha1
  • Start date Start date
  • Tags Tags
    Polygon
Natasha1
Messages
494
Reaction score
9
If the vertices of a regular polygon represent 4 townships and are all connected by a system of roads.

To keep costs to a minimum, what is the ideal arrangement of roads?

What if not a regular polygon but a quadrilateral, cube, regular solid?

Can someone help me please :rolleyes:
 
Last edited:
Physics news on Phys.org
Natasha1 said:
quadrilateral

By definition, this only has four verticies. HINT: Polygons are two dimentional.

~H
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top