|
Math 455 is an introduction to some topics in pure mathematics that underlie areas in computer science and computing engineering, including:
- 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
Details about course organization and requirements appear on the various pages on the About section of this web site and are summarized here.
Briefly: There will be two mid-semester exams, a final exam, and frequent homework that will include computer work. You will be introduced to the software package Mathematica and will use it both as a computing tool and as a medium in which to express mathematical ideas.
|
