This subject offers an interactive introduction to discrete mathematics oriented toward computer science and engineering. The subject coverage divides roughly into thirds: Fundamental concepts of mathematics: Definitions, proofs, sets, functions, relations. Discrete structures: graphs, state machines, modular arithmetic, counting. Discrete probability theory. On completion of 6.042J, students will be able to explain and apply the basic methods of discrete (noncontinuous) mathematics in computer science. They will be able to use these methods in subsequent courses in the design and analysis of algorithms, computability theory, software engineering, and computer systems.Interactive site components can be found on the Unit pages in the left-hand navigational bar, starting with Unit 1: Proofs.
Welcome to AMS Open Math Notes, a repository of freely downloadable mathematical works in progress hosted by the American Mathematical Society as a service to researchers, teachers and students. These draft works include course notes, textbooks, and research expositions in progress. They have not been published elsewhere, and, as works in progress, are subject to significant revision. Visitors are encouraged to download and use these materials as teaching and research aids, and to send constructive comments and suggestions to the authors.
- How to give an effective math talk
- General resources on preparing a talk (not specific to mathematics):
- Preparing a poster presentation
- Resources for teachers (relevant literature)
- Using PowerPoint