This looks excellent. I also heartily recommend Knuth's <i>Concrete Mathematics</i> (<a href="http://www.amazon.com/Concrete-Mathematics-Foundation-Computer-Science/dp/0201558025/ref=sr_1_1?ie=UTF8&qid=1332445763&sr=8-1" rel="nofollow">http://www.amazon.com/Concrete-Mathematics-Foundation-Comput...</a>)
I teach a number theory course to gifted high school students. I've been using these notes for two years now to plan lessons and find exercises. Great resource. You can also find more materials for the same course on MIT OpenCourseWare.
Just a question for CS graduates here, how many Math courses were required to major in CS?<p>When I was an undergraduate the bare minimum was:<p>- 2 algebra (number theory + linear algebra)<p>- 2 calculus (single variable)<p>- 2 statistics<p>- 1 logic<p>- 1 combinatorics (graph theory + enumeration)<p>There was no "Math for CS" course per say, there was just math you should know. And that was the bare minimum for a BCS, the BMath (CS) had even more. I myself struggled with those courses (mostly the "raw" math courses rather the CS-y ones) but I'm grateful now that I did them. Math and Computer Science are so intrinsically linked.
I find it somewhat strange that generating functions are introduced significantly before recurrences are (and that recurrences are introduced last!). Does anyone know why the authors did that?
Great to see it completed. The previous draft was salvation for my graph theory course.
I think Mathematics for Computer Science offers very good understanding without unnecessary jargon or formalisms that obscure more than they clarify. Truly excellent introduction.
In the same spirit I'd like to recommend the books of Walter Warwick Sawyer, and the "How to Ace..." books of Adams/Hass/Thompson.
I took this class (6.042) as a sophomore a few semesters ago. I wasn't terribly good at it. Additionally, the professor and staff were a real pain in the ass, so I didn't really have the best experience. I remember they were writing this text my year. They made us do reading assignments critiquing each section. They were basically having us proofread it for them.
I really like this book, it start with the very basics:
Discrete Mathematics with Applications (<a href="http://www.amazon.com/gp/product/0495391328/ref=oh_o04_s00_i00_details" rel="nofollow">http://www.amazon.com/gp/product/0495391328/ref=oh_o04_s00_i...</a>)
I took this class last semester!<p>As a mechanical engineering major who is interesting in computer science I really enjoyed it (the Psets were a bit annoying sometimes though). The text is pretty easy to read too.