Utilizing De Morgan's laws and Karnaugh maps to simplify boolean expressions. Quantifiers: Evaluating existential ( ∃there exists ) and universal ( ∀for all ) structures in multi-variable equations. 2. Set Theory, Relations, and Functions Why Discrete Math is Important - Art of Problem Solving
Defining domain, codomain, injectivity (one-to-one), and surjectivity (onto).
Which would you like?
Nicodemi sits between Hammack (pure proof) and Epp (balanced). It’s more applied than Hammack but less than Epp.
If you are looking for a text that makes discrete math feel like a conversation with a wise, encouraging mentor—rather than a competition with an indifferent syllabus—this is the one. Discrete Mathematics by Olympia Nicodemi
Unlike traditional calculus sequences that focus on continuous change and limits, discrete mathematics deals with distinct, separated values. Olympia Nicodemi designed her textbook with a clear objective: to bridge the gap between intuitive algorithmic thinking and rigorous mathematical proof.
Understanding the book requires understanding its author. is more than just a mathematician; she is a celebrated educator whose entire career has been devoted to making advanced mathematics accessible.
Have you used Olympia Nicodemi’s Discrete Mathematics in your studies or teaching? Share your experience (or your favorite exercise from the text) in the discussion below.
The book serves as a "bridge" course, meaning it balances fundamental mathematical theory with practical applications in computing. Its primary goal is to help students master the "basic language" of computing and develop computational skills necessary for software engineering. Internet Archive Core Topics Covered Utilizing De Morgan's laws and Karnaugh maps to
Studying vertices, edges, trees, and algorithms (like Euler and Hamiltonian paths) which are vital for network optimization. Who Should Read This Book? The target audience for this book primarily includes:
: Pairing theoretical foundations with practical computer science applications. Key Mathematical Topics Covered
A deep dive into standard and strong induction, framing it as a foundational tool for proving algorithmic correctness. 2. Set Theory and Relations
Because of the explanatory style and fully worked examples, motivated readers can work through much of the book alone. Solutions to odd-numbered exercises are often provided. Set Theory, Relations, and Functions Why Discrete Math
In an era where math textbooks cost $200 and weigh five pounds, Nicodemi’s Discrete Mathematics is a slender, affordable, humane alternative. It trusts the reader to think, and it rewards that trust.
"Given the recursive definition of the Fibonacci numbers, prove that the sum of any ten consecutive Fibonacci numbers is divisible by 11. Is this true for every integer divisor? Explain."
Direct proof, proof by contradiction, contraposition, and mathematical induction (the core of algorithm analysis). 2. Set Theory and Functions This section defines the building blocks of mathematics: