Discrete mathematics for computer science

Mentions per year

What Hacker News says

• xyzzyz · Aug 26, 2015 · Mentions

  …has some experience in reading and writing mathematical proofs. Readers may have gained such experience in computer science courses such as algorithms, automata or complexity theory, or some type of “discrete mathematics for computer science students” course. They also may have gained such experience in undergraduate mathematics courses, such as abstract or linear algebra. The material in these mathematics courses may overlap with some of…

  on “A Computational Introduction to Number Theory and Algebra” ↗
• ufopilot · Feb 27, 2022 · Mentions

  …book, it's also very patient. I personally struggled with the motivation for defining total derivative through little-o notation. There are a ton more textbooks on discrete math like, say, " Essential Discrete Mathematics for Computer Science" by Lewis & Zax or "Discrete Mathematics: An Open Introduction" by Oscar Levin. Some intro books also attempt to include a tiny bit of real analysis and general topology. Topics include ways of using…

  on “Ask HN: The book that did it for you in math and/or CS?” ↗