In the Euclidean traveling salesperson problem, cities are points in the plane and the distance between two cities is the Euclidean distance between the points for these cities, that is, the length of the straight line joining these points. Show that an optimal solution to the Euclidean TSP is a simple polygon, that is, a connected sequence of line segments such that no two ever cross.

i belive those are the ones that are under 90 degreese.

37/3

step-by-step explanation:

step 1: simplify both sides of the equation.

7x+8(x+

1

4

)=3(6x−9)−8

7x+(8)(x)+(8)(

1

4

)=(3)(6x)+(3)(−9)+−8(distribute)

7x+8x+2=18x+−27+−8

(7x+8x)+(2)=(18x)+(−27+−8)(combine like terms)

15x+2=18x+−35

15x+2=18x−35

tep 2: subtract 18x from both sides.

15x+2−18x=18x−35−18x

−3x+2=−35

step 3: subtract 2 from both sides.

−3x+2−2=−35−2

−3x=−37

step 4: divide both sides by -3.

−3x

−3

=

−37

−3

x=

37

3

4

step-by-step explanation:

im pretty sure it's 4 beacsue 8/2 equals 4