Discrete Mathematics and Its Applications
by Kenneth H. Rosen · first published 1988
74% recommend21% neutral5% critical
Why HN recommends it
Broad, CS-oriented intro to discrete math (logic, proofs, counting, graphs, trees, automata) that builds foundations before algorithms. Praised for plentiful exercises; suits beginners and self-learners.
Summarised by Claude from recommending comments
Affiliate links. As an Amazon Associate I earn from qualifying purchases.
Mentions per year
What Hacker News says
Related books
2009–2026Discrete Mathematics with Applications
Susanna S. Epp, Susanna Epp
Recommended by 18 · mentioned by 2918 recommend · 29 mention18 recommend · 2918 recommend
2010–2023The Art of Probability
Richard Hamming
Recommended by 7 · mentioned by 87 recommend · 8 mention7 recommend · 87 recommend
2008–2025Introduction to automata theory, languages, and computation
John E. Hopcroft, Jeffrey D. Ullman, Rajeev Motwani
Recommended by 24 · mentioned by 3324 recommend · 33 mention24 recommend · 3324 recommend
2007–2026Concrete mathematics
Ronald L. Graham, Donald Knuth, Oren Patashnik
Recommended by 140 · mentioned by 215140 recommend · 215 mention140 recommend · 215140 recommend
2009–2025Mathematics for Computer Science
Eric Lehman, F Thomson Leighton, Albert R Meyer
Recommended by 37 · mentioned by 6537 recommend · 65 mention37 recommend · 6537 recommend
2007–2026How to prove it
Daniel J. Velleman
Recommended by 78 · mentioned by 10478 recommend · 104 mention78 recommend · 10478 recommend
2015–2026How to Think About Analysis
Lara Alcock
Recommended by 15 · mentioned by 1615 recommend · 16 mention15 recommend · 1615 recommend
2012–2026Precalculus mathematics in a nutshell
George Finlay Simmons
Recommended by 10 · mentioned by 1110 recommend · 11 mention10 recommend · 1110 recommend
…Application - Strang 2) Discrete Math You need an understanding of proofs and logic before you can get to the real algorithms material. Counting and probability is also very important. Suggested book: Discrete Mathematics and Its Applications - Kenneth Rosen This looks like a good free option, but there are no exercises: http://courses.csail.mit.edu/6.042/fall10/mcs-ftl.pdf 3) Algorithms Enough said. Suggested book: CLRS, but here's a…
on “Ask HN: Learn Math the Hard Way” ↗I'm starting to learn CS all over again at the old age of 40, and had the pleasure to rediscover mathematics thanks to: - Discrete Mathematics with Applications, by Susanna Epp, or - Discrete Mathematics and Its Applications, by Kenneth Rosen (both have the same content, choose the style that you prefer), and - Concrete Mathematics, by our lord and savior Donald Knuth. I don't plan on reading TAOCP anymore as I would be…
on “Ask HN: The book that did it for you in math and/or CS?” ↗First make sure you have a solid operational foundation on the basics. Advanced topics will feel so much easier. For that I can recommend Discrete Mathematics and its Applications by Kenneth H. Rosen. Optionally supplemented by Student's Solutions Guide for more elaborate answers to exercises. Do as many exercises as possible.
on “Ask HN: Independent Math Study” ↗Discrete Mathematics and its Applications by Rosen, Kenneth H. The most interesting math book I've read as a computer programmer. It covers graph theory, combinatorics, boolean algebra, trees, complexity theory, etc. I already knew a good chunk…
on “Ask HN: What are you reading right now?” ↗…most of the time, so I'd need an answer key nearby to get unstuck. Drill, drill, drill. Just like you'd expect to drill for calculus, you can drill for this class. What I found helpful was Rosen's "Discrete Mathematics and Its Applications". The material wasn't the best, but the problems are excellent. You can buy an older edition of the book and its solution manual for next to nothing on used book sites like abebooks.com
on “Mathematics for Computer Science” ↗…ensure you understand how every problem works. 1. Calculus 4th ed. by Smith and Minton 2. Introduction to Linear Algebra (Gilbert Strang) 3. Introduction to Probability Theory (Hoel, Port, Stone) 4. Discrete Mathematics and its applications (Rosen) 5. Introduction to Automata Theory, Languages, and Computation (Hopcroft) 6. Introduction to Algorithms (Cormen, Leiserson, Rivest, Stein) It will take you at least a year if not two to work…
on “Ask HN: Resources to learn math as a foundation for CS” ↗…subject. Then the more advanced books later in the list. Introduction to Proofs: Just pick one of these that speaks to you the most. All three are good. Discrete Mathematics with Applications - Epp Discrete Mathematics and Its Applications - Rosen Mathematical Proofs: A Transition to Advanced Mathematics - Chartrand, et al. Abstract Algebra: How to Think about Abstract Algebra - Alcock Abstract Algebra - Pinter Abstract Algebra: A…
on “Physics Student Earns PhD at Age 89” ↗Since you are also into programming, I would recommend studying some discrete math. Discrete Mathematics and Its Applications by Kenneth H. Rosen is rather friendly and instructive on how to do proofs.
on “Ask HN: How Do I Get Math?” ↗…I. This was expanded upon in the form of Concrete Mathematics. If you want just the maths and at a slightly slower pace, go with Concrete Mathematics. If that's a struggle, I found the first part of Discrete Mathematics and its applications by Kenneth Rosen was enough for me to make progress in Concrete Mathematics. I also found learning a bit of linear algebra and calculus was a mind changer. I expect more fruits by my continuing of those…
on “Ask HN: Which areas of math are practical to programming/algorithms and why?” ↗…challenges and practice, try LeetCode and HackerRank. By the way, it'd be better to keep a discrete math book at hand, it would help you if you encounter some mathematical proof problems. I would recommend Discrete Mathematics and Its Applications by Kenneth H. Rosen for reference.
on “Ask HN: How should I study algorithms and datastructures?” ↗To stick to the more theoretical interpretation of "computer science," and with a focus on theory of computation/programming languages: - Discrete Mathematics And Its Applications, Kenneth H. Rosen (this is more foundational, but it's definitely targeted at a CS audience and touches on things like automata theory) - Types and Programming Languages, Benjamin C. Pierce - Semantics…
on “Ask HN: What are the most fundamental books on computer science?” ↗Discrete Mathematics and Its Applications by Rosen
on “Must Read CS Books For Self Self-Taught Programmers” ↗Looking for recommendations on technical books that are written really well, where the form, flow, and structure – and not necessarily the content - are excellent. Some examples that I enjoyed: - SICP - Discrete Mathematics and Its Applications - K&R - The C++ Programming Language - Code: The Hidden Language of Computer Hardware and Software - GEB - Real-Time Rendering - Artificial Intelligence: A Modern Approach As a counter-example,…
on “Ask HN: Well-written Technical Books?” ↗…some basics of Discrete Math before you start learning some deep algorithms that may require more advanced math than high school math. I don't know any book that I can recommend to you. But, I am using "Discrete Mathematics and Its Applications" in my first semester in UIUC. The author of this book tried to relate Discrete Math with Computer Science. So, it may be a good head start for you. From the book, you can learn some basic algorithms…
on “Ask HN: Advice to Student Finishing School” ↗I second Discrete Mathematics and its Applications. This book was the book I used in the first class that required a substantial amount of proof writing. A majority of it was easily tackled within a six week course.
on “Ask HN: Independent Math Study” ↗