This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Douglass Houghton Workshop, Section 2, Tue 11/22/11 Worksheet Never Say Never 1. Weve been working on the problem of finding the shortest road network between three cities in the plane. In the case we considered, the three cities were at the corners of a 45 -45 -90 triangle with legs 10 miles long. The simplest idea is to just build roads along the legs; that makes a network of length 20. But by constructing a Y-shaped network like the one at the right, we found b b b b A B C 10 10 x The length of the network is x + 2 radicalBig 100- 20 x cos(45) + x 2 . We can improve from the simple 2-road solution ( x = 0, length = 20) by increasing x . For instance, when x = 5, the network has length 19.74. (a) Consider the case where the triangle is still isosceles and the legs still have length 10, but the angle at B is 70 . Write a formula for the length of the network. (b) Can you find a value of x which beats the 2-road solution ( x = 0, length = 20)?...
View Full Document
- Winter '08