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/29/11 Worksheet Out Among the Stars 1. Shortest Network. We found last week that some V newtorks can be improved to a Y , and some cant. In particular, our big result was that: If A , B , and C form an isosceles triangle, then the V network is not minimizing if the vertex angle is less than 120 . Now we need to generalize to all possible placements of cities. (a) Prove that the network to the right is NOT minimizing. You dont need to find the optimal network, just prove that this one can be improved. Hint: consider the portion of the network that is inside the circle. (b) What allowed that trick to work? Phrase your answer like this: Any network which contains can be improved. (c) Put it all together, and explain where the soap puts the roundabout. b b b 2. Write the following sums in sigma ( ) notation. (a) 1 + 2 + 3 + 4 + 10 (b) 1 + 2 + 3 + 4 + + n (c) 3 + 5 + 7 + 9 + + 21 (d) 4 + 9 + 16 + 25 +...
View
Full
Document
This note was uploaded on 01/28/2012 for the course MATH 146 taught by Professor Conger during the Winter '08 term at University of Michigan.
 Winter '08
 Conger

Click to edit the document details