Math 28 -- Syllabus

The following is a tentative syllabus for the course. This page will be updated irregularly.

 

Date

Section

Description

Thurs. 4-Jan

 

No Class

Fri. 5-Jan

1.1

Elementary Counting Principles

Mon. 8-Jan

1.1

Elementary Counting Principles

Wed. 10-Jan

1.2

Functions and the pigeonhole principle

Thurs. 11-Jan

 

 

Fri. 12-Jan

1.2

Functions and the pigeonhole principle

Mon. 15-Jan

 

No class--Holiday-MLK

Wed. 17-Jan

1.3

Subsets

Thurs. 18-Jan

1.4

Binomial coefficiets

Fri. 19-Jan

1.5

Math Induction

Mon 22-Jan

2.1

Equivalence relations

Wed. 24-Jan

2.2

Distribution and multisets

Thurs. 25-Jan

 

Exam 1

Fri. 26-Jan

2.3

Partitions and Stirling Numbers

Mon. 29-Jan

2.3

More on Partitions and Stirling Numbers

Wed. 31-Jan

2.4

Partitions and Integers

Thurs. 1-Feb

 

 

Fri. 2-Feb

3.1

Principle of inclusion and exclusion

Mon. 5-Feb

3.1

Principle of inclusion and exclusion

Wed. 7-Feb

3.2

Concept of a generating function

Thurs. 8-Feb

3.3

Applications to partitions and inclusion and exc.

Fri. 9-Feb

 

No Class--Holiday-Carnival

Mon. 12-Feb

3.4

Recurrence Relation and Generating fuctions

Wed. 14-Feb

 

Review

Thurs. 15-Feb

 

Exam 2

Fri. 16-Feb

3.5

Exponential generating fuctions

Mon. 19-Feb

3.5

Exponential generating fuctions

Wed. 21-Feb

8.1

Permutation groups

Thurs. 22-Feb

 

 

Fri. 23-Feb

8.1

Permutation groups

Mon. 26-Feb

8.2

Groups acting on sets

Wed. 28-Feb

8.2

Groups acting on sets

Thurs. 1-March

 

 

Fri. 2-March

8.3

Polya's Enumeration Theorem

Mon. 5-March

8.3

Polya's Enumeration Theorem

Wed. 7-March

 

Review


Last Updated on 1/1/01
By Rosa Orellana