# The base case is obvious assume true for n 1 disks

This preview shows page 4. Sign up to view the full content.

inductive, and a minor variation on the first argument. The base case is obvious. Assume true for n - 1 disks. Now we have to prove that for n disks. At some point we have to move the largest disk. At that point all the n - 1 disks have to be on tower C. By the induction hypothesis, that cannot be done in less than 2 n - 1 - 1 moves. Then we move the largest disk to tower B. And then again move the rest of the n - 1 disks back to tower B in a minimum of 2 n - 1 - 1 moves. 5 2(a) lim t →- 2 f ( t ) = 0 2(b) lim t →- 1 f ( t ) = - 1 2(c) lim t 0 f ( t ) is not defined. 4(a) False 4(b) False 4(c) True 4(d) True 4(e) True 17(a) The table of values can be the following. θ sin θ sin θ/θ 1 0.841471 0.841471 0.1 0.099834 0.99834 0.01 0.00999983 0.999983 0.001 0.001 1 4
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern