MIT6_042JF10_rec12

MIT6_042JF10_rec12 - 6.042/18.062J Mathematics for Computer...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
6.042/18.062J Mathematics for Computer Science October 20, 2010 Tom Leighton and Marten van Dijk Problems for Recitation 12 1 The L-tower problem Observe the structures shown in Figure 1 . One has 2 L-shapes, the other 5 L-shapes. Con- sider a tower with k L-shapes. Assume that the blocks are all of size x × 1 where x > 1. As the picture indicates, if k is too small then the tower falls to the left. On the other hand, if k is too large the tower would fall to the right. Will the tower be stable for some k ? Prove there is at least one value of k for which the L-tower is stable. Assume that a structure is stable if and only if its center of gravity is not hanging in the air horizontally. The L-tower is stable if and only if each of its subparts is stable. Hint: Show the tower is stable if and only if 3 x 2 3 k 3 x 2 1 . Figure 1: Too few or too many L shapes make the tower unstable
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
± ± ± Recitation 12 2 2 Double Sums Sometimes we have to evaluate sums of sums, otherwise known
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 4

MIT6_042JF10_rec12 - 6.042/18.062J Mathematics for Computer...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online