ArsDigita Discrete Mathematics course (this one gives a really gentle start): http://www.aduni.org/courses/discrete/index.php?view=cw http://www.aduni.org/cour

ArsDigita Discrete Mathematics course (this one gives a really gentle start): http://www.aduni.org/courses/discrete/index.php?view=cw http://www.aduni.org/courses/discrete/index.php?view=cw MIT Mathematics for Computer Science (harder but still not that hard): http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-042j-mathematics-for-computer-science-fall-2010/video-lectures/ http://ocw.mit.edu/courses/electrical-engineering-and-comput... Steve Skienna discrete mathematics course (graduate course based on Knuth's "Concrete Mathematics", quite hard): http://www3.cs.stonybrook.edu/~algorith/math-video/ http://www3.cs.stonybrook.edu/~algorith/math-video/ I also recommend checking out some books: http://infolab.stanford.edu/~ullman/focs.html http://infolab.stanford.edu/~ullman/focs.html - free "Foundations of Computer Science" book that combines discrete mathematics with C programming and some theory of computation stuff, a pretty good way to make things more practical http://www.amazon.com/Discrete-Mathematics-Elementary-Beyond-Undergraduate/dp/0387955852/ref=sr_1_1?ie=UTF8&qid=1419846906&sr=8-1&keywords=lovasz+discrete+mathematics http://www.amazon.com/Discrete-Mathematics-Elementary-Beyond... - very pleasant introductory discrete mathematics book, a welcome break from the usual "brick" format and covers some important topics that often do not make it into the normal discrete mathematics curriculum e.g. induction on trees. http://www.amazon.com/Introductory-Combinatorics-Modern-Birkh%C3%A4user-Classics/dp/0817649522/ref=sr_1_1?ie=UTF8&qid=1419847131&sr=8-1&keywords=polya+introductory+combinatorics http://www.amazon.com/Introductory-Combinatorics-Modern-Birk... - classic introduction to combinatorics