Introduction and Proofs 
Introduction and Proofs
by MIT / Tom Leighton
Video Lecture 1 of 25
Copyright Information: Tom Leighton, and Marten Dijk. 6.042J Mathematics for Computer Science, Fall 2010. (Massachusetts Institute of Technology: MIT OpenCourseWare), (Accessed 25 Jan, 2015). License: Creative Commons BY-NC-SA
Not yet rated
Views: 2,163
Date Added: January 25, 2015

Lecture Description

Introduction to mathematical proofs using axioms and propositions. Covers basics of truth tables and implications, as well as some famous hypotheses and conjectures.

Course Index

Course Description

This course covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics may also be covered, such as recursive definition and structural induction; state machines and invariants; recurrences; generating functions.


There are no comments. Be the first to post one.
  Post comment as a guest user.
Click to login or register:
Your name:
Your email:
(will not appear)
Your comment:
(max. 1000 characters)
Are you human? (Sorry)