Discrete Mathematics By Olympia Nicodemi

If you want to compare this book to (like Kenneth Rosen), I can provide a comparison.

Dr. Olympia Nicodemi retired from SUNY Geneseo in 2020, leaving behind a legacy of inspired students and educators. Her 1987 textbook is a permanent part of that legacy. It is a testament to the idea that the most powerful textbooks are not just collections of facts, but the product of a master teacher's dedication to illuminating a path for her students. It serves as a bridge not only between topics, but between a student's present understanding and their future potential.

Introduction to quantifiers (universal and existential) to express complex mathematical statements.

Problems requiring students to explain the "why" behind the math.

by Olympia Nicodemi is often regarded as a foundational text that bridges the gap between lower-level calculus and the rigorous, abstract world of higher mathematics. Rather than just a collection of formulas, Nicodemi’s approach emphasizes the development of mathematical maturity through logical reasoning and problem-solving. The Core Philosophy Discrete Mathematics by Olympia Nicodemi

As computer science programs increasingly rely on discrete math, students need to see why these theories matter. Nicodemi’s book consistently anchors abstract mathematical concepts to real-world computer science applications. This makes the material feel relevant and highly practical, helping students understand the "why" behind the mathematical "what." 3. Clear, Intuitive Explanations

[Mathematical Logic & Proofs] ➔ [Sets, Relations & Functions] ➔ [Combinatorics & Probability] │ [Algebraic Structures & FSMs] 💡 🧠 [Graph Theory & Trees] 💻 🎛️ ◄──────┘ Key Curricular Topics and Concepts 1. Formal Logic and Propositional Forms

Every mathematical journey requires a language. Nicodemi begins by establishing the principles of formal logic, propositional calculus, and truth tables.

The book's strengths and structure are repeatedly highlighted by those who have used it: If you want to compare this book to

Defining domain, codomain, injectivity (one-to-one), and surjectivity (onto).

: Unlike calculus, which focuses on continuous changes, discrete math focuses on distinct, separate values (like integers). You might argue that this is the true language of digital computers, which operate in 0s and 1s. Internet Archive Core Topics Covered

It is a reference encyclopedia. It does not have 100 pages of advanced combinatorics or exhaustive coverage of network flows. It deliberately stays focused on the core transition: from calculation to proof .

For educators looking for a textbook that does not overwhelm undergraduates, or for self-taught programmers seeking to patch holes in their theoretical knowledge, this book is highly effective. Her 1987 textbook is a permanent part of that legacy

Nicodemi avoids overly dense mathematical jargon where simple language suffices. The book reads like a lecture from a supportive professor, maintaining mathematical rigor without intimidating the reader. Step-by-Step Examples

As of 2025, the book is technically out of print, but used copies are available on AbeBooks, eBay, and Amazon Marketplace. Prices range from $25 for a worn paperback to $150+ for a like-new hardcover. Many professors have also placed PDF excerpts on their course websites with permission from the author.

Applying this simple yet powerful concept to non-trivial problems.

. An essay could explore how these skills allow computer scientists to verify that their code and systems are inherently sound. Discrete vs. Continuous

Methods of proof, including direct proof, contradiction, and mathematical induction. 2. Set Theory and Relations

Many students struggle with the abstract nature of mathematical proofs. Nicodemi’s text excels at easing students into this new way of thinking. The book acts as a natural bridge between basic college algebra and the highly rigorous, proof-heavy upper-level courses. Concepts are introduced incrementally, ensuring that readers have a solid foundation before moving on to more complex theories. 2. Focus on Computer Science Applications