Office:325G Maclean Hall |
Email:goodman at math dot uiowa dot edu |
Phone:Office: 319-335-0791 Mobile: 319-331-1939 |
Paper Mail:Fred Goodman Department of Mathematics MLH The University of Iowa Iowa City, IA 52242-1419 USA |
Office Hours:M, W at 12:30 and by appointment |
Class Hours:10:30A - 11:20A MWF, 118 MLH |
Click here to read the syllabus.
R. Brualdi, Introductory Combinatorics, 4th edition, Prentice Hall, 2004 . |
Mathematica Lesson 1: Getting started.
Mathematica Lesson 2: Mathematica as a scientific calculator.
Mathematica Lesson 3: Mathematica as a symbolic calculator.
Mathematica Lesson 5: Some help with programming, oriented towards your programming exercise.
There will be 8 to 12 written assignments. Details will appear here as the assignments are made.
1st assignment, due Friday, Sept. 7: Exercises from Chapter 2: 2, 3, 6, 7, 8.
2nd assignment due Friday, Sept. 14: Exercises from Chapter 2: 9, 17; Exercises from Chapter 3: 1, 2
3rd assignment due Friday, Sept. 21: Exercises from Chapter 3: 8,9,10,13
4th assignment due Friday, Sept. 28: Exercises from Chapter 3: 12, 15, 17, 23, 26, 27
5th assignment due Friday, October 12: Exercises from Chapter 4: 5, 6, 7, 8, 9, 33, 34, 35
6th assignment due Friday, October 19: Exercises from Chapter 4: 10-21
7th assignment due Friday, November 2: Exercises from Chapter 5: 7, 8, 10-12
8th assignment due Friday, November 9: Exercises from Chapter 5: 19, 20, 23-25; Chapter 6: Write a computer program in your favorite language to compute the number of solutions to x_1 + x_2 + ... + x_n = N, with 0 <= x_j <= a_j for all j. Your program should take inputs (n, N, a_1, ... a_n) and output the number of solutions. Check your program on some small cases that you can do by hand. Hand in a printout of the program and solve the problem with n = 8, N = 50, a_j = 3j for 1 <= j <= 8.
8th assignment due Friday, November 16: Exercises from Chapter 6: 5-9 (Use your program! Please write a note to the grader saying you are using your program, so she doesn't grade down for missing calculations.) 10-17, 22-23.
9th assignment due Friday, November 30: Exercises from Chapter 7: 5, 8-11, 18.
10th assignment due Friday, December 7: click here. Addition to assignment: click here.
Last assignment: Chapter 7: 44--46, and this.
fibonacci experiments for use in class
class demo on linear, homogeneous, constant coefficient recursion relations
some computations for homework 11
There will be one or two midterms, to be scheduled by agreement with the class.
There will be a comprehensive final exam at the time specified in the Fall, 2007 course schedule.
Here are some exams from previous semesters, in pdf format.