|
Principal source for the topics below is the required text by L. Lovász, J. Pelikán, and Vesztergombi. Not everything of importance will be covered in lecture: you learn some things by reading textbook assignments, reading on-line notes, working through Mathematica notebooks I provide, doing Mathematica work, and solving homework problems.
- Counting elements of finite sets (“combinatorics”)
- Recursive definitions and proof by induction
- Elementary number theory (about integers) and application to public-key cryptography
- Graphs (in the sense of networks of relationships)
- Additional topics as time may allow
|
