| Section | Problem | Notes
|
|---|
| 1.4 | 10
|
| 2.3 | 38 | Your answer should be one or more equations that relate the constants (e.g. ab=c+d). An answer that gives an example of specific values of constants that work is not enough.
|
| 5.1 | 10 | It should be a very simple formula.
|
| 5.2 | 8 | Your answer should be something of the form "For $5n, where n≥a" for some integer a (which you need to find). Then you will need strong induction to prove it. This is probably one of the more confusing problems, but look for the solutions of the similar ones in the book for some help.
|
| 10 | I will give you the answer to the first part: It is always n-1 breaks. For the inductive step, don't over think it. When you break the chocolate the first time, just make up sizes it breaks into (e.g. one piece will be size i (where i is at least 1), and the other then has to be what?). Strong induction makes this pretty straightforward.
|
| 30
|
| 32 |