NOTE 1: Be sure to read Homework Format and Homework Writing Policy BEFORE writing up your solutions to be turned in.
NOTE 2: When two or more Lessons are to be turned in on the same day, please staple the Lessons separately and turn them in separately.
Due Monday, July 7
Last modified Jul 6, 2008 1:46 PM
- Chapter 8:
- Problems 1-4 were handed out in class on Wednesday, July 2, and are available as a pdf document, Sums and Duration. Problem 5 is below.
Hint for Problem 2 (the case n = 2): Use the fact that r-1 is a factor of 2r3 - 3r2 +1.
5. In Problem 3, you are asked to prove a certain formula by induction. To be sure that you understand how induction “works”, complete the following:We are given a statement Π(n) and we want to prove that it is true for (in a simple case) all integers n ≥ 1.
Suppose we know that (i.e., we can prove that)Then we can conclude that for all integers n ≥ 1, _______________________________ .
- [basic step] _______________________________
- [inductive step] for all integers n ≥ 1, _______________________________
NOTE: As stated on the Course Home Page, all due dates are tentative. Assignments, or parts of assignments, may be postponed to a later date.
Last modified Jul 6, 2008 1:46 PM
Go to Lesson 25a (due 7/8).
Go to Lesson 26a (due 7/9).
Go to Lesson 28 (due 7/8).
Back to Course Home Page