
Discrete mathematics
by László Lovász, Jozsef Pelikan, Katalin L. Vesztergombi · first published 2003
100% recommend
Discrete mathematics is quickly becoming one of the most important areas of mathematical research, with applications to cryptography, linear programming, coding theory and the theory of computing. This book is aimed at undergraduate mathematics and computer science students interested in developing a feeling for what mathematics is all about, where mathematics can be helpful, and what kinds of questions mathematicians work on. The authors discuss a number of selected results and methods of discrete mathematics, mostly from the areas of combinatorics and graph theory, with a little number theor
Affiliate links. As an Amazon Associate I earn from qualifying purchases.


ArsDigita Discrete Mathematics course (this one gives a really gentle start): 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-comput...…
on “List of Computer Science Courses” ↗…discrete math course open on his youtube channel https://www.youtube.com/c/DailyChallengewithPoShenLoh/search... you can use the book he recommends to look up anything that is assumed knowledge in lectures. Discrete Mathematics, by L. Lovász, J. Pelikán, and K. Vesztergombi. A book called Asymptopia by Spencer is well done too, good chapters for learning everything you want about big-O/omega/theta some topics are advanced and…
on “Ask HN: Looking for a book on algorithms and data structures” ↗