No. | Date | Sections | Lecture | Assignment | ||
---|---|---|---|---|---|---|

Chapter 10 - The Mathematics of Finance | ||||||

1 | Mon, Jan 15 | Introduction | None | |||

2 | Wed, Jan 17 | 10.2 | Simple Interest | Ch. 10: 17, 18, 25, 26, 67 | ||

3 | Fri, Jan 19 | 10.3 | Compound Interest | Ch. 10: 27, 28, 31, 32, 41, 42, 43, 44, 70 | ||

4 | Mon, Jan 22 | 10.3 | Building up an Annuity
(Financial Formulas) |
Annuity Exercises: 1 - 5 (Annuity Exercises) |
||

5 | Wed, Jan 24 | Drawing down an Annuity | Annuity Exercises: 6 - 10 (Annuity Exercises) |
|||

6 | Fri, Jan 26 | 10.4 | Installment Loans | Ch. 10: 57, 58, 59, 61, 62, 63 Answers to annuity problems |
||

7 | Mon, Jan 29 | Inflation | ||||

8 | Wed, Jan 31 | More Inflation | Inflation Exercises: 1 - 10 (Inflation Exercises) (Inflation Solutions) |
|||

Chapter 1 - The Mathematics of Elections | ||||||

9 | Fri, Feb 2 | 1.1 - 1.3 | The Plurality and Borda Count Methods | Ch. 1: 11, 13, 15, 16, 21, 25, 27, 29 | ||

10 | Mon, Feb 5 | 1.4 | The Plurality-with-Elimination Method | Ch. 1: 31, 32, 33, 35, 37, 38, 69a Rework 31, 32, and 33 using Coombs' method |
||

11 | Wed, Feb 7 | 1.5 | The Pairwise-Comparison Method | Ch. 1: 41, 42, 43, 44, 45, 47, 49, 50 | ||

12 | Fri, Feb 9 | 1.6 | Arrow's Impossibility Theorem | Ch. 1: 51, 52, 53, 54, 55, 56 | ||

Chapter 2 - The Mathematics of Power | ||||||

13 | Mon, Feb 12 | 2.1 | Weighted Voting | Ch. 2: 1, 2, 3, 4, 5, 6, 7, 8 | ||

14 | Wed, Feb 14 | 2.2 | Banzhaf Power | Ch. 2: 11, 12, 13, 14, 15, 17, 19, 69, 71 Use the webpage program for 69 and 71 |
||

Fri, Feb 16 | Test 1 (Chapters 10 and 1) | |||||

15 | Mon, Feb 19 | 2.3 | Shapley-Shubik Power | Ch. 2: 27, 28, 29, 30, 32, 33, 56 | ||

Chapter 3 - The Mathematics of Sharing | ||||||

16 | Wed, Feb 21 | 3.1 - 3.3 | The Divider-Chooser Method | Ch. 3: 1, 3, 5, 15, 16, 17, 18, 19, 20 | ||

17 | Fri, Feb 23 | 3.4 | The Lone-Chooser Method | Ch. 3: 35, 36, 37, 38, 41, 42 | ||

18 | Mon, Feb 26 | 3.4 | Lone-Chooser Examples | Same as last assignment | ||

19 | Wed, Feb 28 | 3.5 | The Method of Sealed Bids | Ch. 3: 43, 44, 46, 47, 48 | ||

Chapter 4 - The Mathematics of Apportionment | ||||||

20 | Fri, Mar 2 | 4.1 - 4.2 | Apportionment Problems | |||

Mon, Mar 5 | Spring Break | |||||

Wed, Mar 7 | ||||||

Fri, Mar 9 | ||||||

21 | Mon, Mar 12 | 4.3 | Jefferson's and Adams's Methods | Ch. 4: 21, 23, 34, 27 | ||

22 | Wed, Mar 14 | 4.2 | Hamilton's Method | Ch. 4: 21, 23, 24, 27, 31, 32, 33, 34 | ||

23 | Fri, Mar 16 | 4.4 | Webster's Method | Ch. 4: 35, 36, 37, 38, 39, 40 | ||

24 | Mon, Mar 19 | 4.5 | The Huntington-Hill Method - Version 1 | Ch. 4: 43, 44, 45, 46, 49. Use Version 1. | ||

25 | Wed, Mar 21 | 4.6 | Apportionment Paradoxes | |||

Fri, Mar 23 | Test 2 | |||||

Chapter 5 - The Mathematics of Getting Around | ||||||

26 | Mon, Mar 26 | 5.2 - 5.2 | Street-Routing Problems | |||

27 | Wed, Mar 28 | 5.3 | Euler's Theorems | |||

30 | Fri, Mar 30 | 5.4 | Eulerization | |||

29 | Mon, Apr 2 | The Shortest-Path Algorithm | ||||

Chapter 6 - The Mathematics of Touring | ||||||

30 | Wed, Apr 4 | 6.1, 6.3 | The Traveling Salesman Problem | |||

31 | Fri, Apr 6 | 6.4 | The Nearest-Neighbor Algorithm | |||

32 | Mon, Apr 9 | 6.5 | The Cheapest-Link Algorithm | |||

Chapter 8 - The Mathematics of Scheduling | ||||||

33 | Wed, Apr 11 | 8.1 - 8.2 | Scheduling and Digraphs | |||

34 | Fri, Apr 13 | 8.3 | Priority List Scheduling | |||

35 | Mon, Apr 16 | 8.4 | The Decreasing-Time Algorithm | |||

36 | Wed, Apr 18 | 8.5 | The Backflow Algorithm | |||

Fri, Apr 20 | Test 3 | |||||

37 | Mon, Apr 23 | 8.5 | The Critical-Path Algorithm | |||

38 | Wed, Apr 25 | 8.5 | The Critical-Path Algorithm | |||

39 | Fri, Apr 27 | Summary and Review | ||||

Tue, May 1 | Final Exam (1:30 pm - 4:30 pm) |