Discrete Mathematics By Olympia Nicodemi ((top)) May 2026

Olympia Nicodemi's " Discrete Mathematics: A Bridge to Computer Science and Advanced Mathematics

" is a foundational textbook designed to introduce undergraduate students to non-continuous mathematics. First published in 1987, it serves as a critical link between introductory calculus and the rigorous thinking required for higher-level computer science and mathematics. Core Objectives and Audience

The text is specifically structured for a one-semester course, typically taken by computer science or mathematics majors in their first or second year. It assumes a baseline level of "mathematical maturity" equivalent to one semester of calculus and exposure to a high-level programming language. The book focuses on two primary goals:

Developing Technical Skills: Mastery of non-continuous mathematical structures like boolean arithmetic, combinatorics, and graph theory.

Cultivating Mathematical Reasoning: Teaching students how to think through deduction, formal proof, and recursive logic. Key Topics Covered

Nicodemi’s text spans approximately 491 pages and includes fundamental topics that are essential for algorithm design and software engineering:

Mathematical Reasoning: Introduction to logic, deduction, and the construction of proofs.

Set Theory and Boolean Algebra: Exploring the structures that underpin digital logic and database queries.

Combinatorics: Techniques for counting and probability, vital for complexity analysis.

Graph Theory: Studying networks, trees, and connectivity, which are the basis for many modern computing algorithms.

Recursive Thinking: Analyzing problems through recursion and mathematical induction. Practical Features

Pedagogical Structure: Early editions (and related works by the author) often utilized pretests and posttests for each chapter, keyed to specific learning objectives, to help students track their progress.

Problem-Solving Focus: A significant portion of the exercises requires students to translate word problems into formal mathematical language.

Availability: While older, the text remains available for study through academic resources like the Internet Archive and is sold by retailers such as Amazon and Biblio.

Discrete Mathematics: A Bridge to Computer Science and Advanced Mathematics

by Olympia Nicodemi is a textbook originally published in 1987 by West Publishing Company. It is designed as an introductory text for students transitioning into computer science or higher-level mathematics, emphasizing the connection between abstract mathematical structures and practical computational applications. Core Overview

Focus: The book serves as a foundational "bridge," introducing students to mathematical concepts that are distinct from continuous calculus. It deals with objects that have distinct, separate values, such as integers.

Primary Audience: It is tailored for undergraduate students in computer science and advanced mathematics.

Structure: The text spans approximately 491 pages and is noted for its illustrated format. Key Topics Covered

Nicodemi's work typically explores standard discrete mathematics modules that are critical for algorithm design and software development:

Discrete Mathematics by Olympia Nicodemi: A Classic Approach to Logical Foundations Discrete Mathematics by Olympia Nicodemi

In the landscape of computer science and mathematics, few subjects are as foundational as discrete mathematics. While many textbooks have come and gone, Discrete Mathematics by Olympia Nicodemi remains a respected resource for students and educators seeking a rigorous yet accessible introduction to the field.

First published in the late 1980s, Nicodemi’s work was designed to bridge the gap between high school algebra and the more abstract reasoning required for advanced mathematics and computer science. Why This Text Stands Out

Nicodemi’s approach is characterized by its clarity and focus on the "mathematical way of thinking." Rather than just presenting formulas, the book emphasizes the structure of proofs and the logic behind mathematical statements. 1. Logical Foundations

The book begins where all discrete math should: with logic and sets. Nicodemi provides a meticulous introduction to propositional logic, truth tables, and set theory. This foundation ensures that when students move on to more complex topics, they have the linguistic tools necessary to express mathematical ideas precisely. 2. Methods of Proof

One of the biggest hurdles for students is the transition from "calculating" to "proving." Nicodemi handles this by introducing various proof techniques—including direct proof, contradiction, and mathematical induction—early and often. The examples are chosen to build confidence, starting with simple parity arguments and moving toward more abstract concepts. 3. Combinatorics and Probability

For those heading into computer science, the chapters on counting (combinatorics) are invaluable. Nicodemi covers permutations, combinations, and the Pigeonhole Principle with a focus on problem-solving strategies that apply to algorithm analysis and complexity. 4. Graph Theory and Relations

The text provides a solid introduction to graphs and trees. In an era where data structures and networking are paramount, Nicodemi’s clear definitions of vertices, edges, paths, and circuits provide the essential theory needed to understand how modern data is organized. Who is Olympia Nicodemi?

Olympia Nicodemi is a Distinguished Teaching Professor Emerita at SUNY Geneseo. Her expertise isn't just in the subject matter, but in the pedagogy of mathematics. This classroom experience is evident throughout the book; the pacing feels intentional, and the exercises are designed to catch common student misconceptions before they take root. Is It Still Relevant Today?

While the world of computing has changed drastically since the book's release, the underlying mathematics has not. Discrete Mathematics by Olympia Nicodemi remains a strong choice for:

Self-Learners: The clear, conversational tone makes it manageable for those studying without a lecturer.

Reference: Its straightforward organization makes it easy to look up specific theorems or proof techniques.

Foundational Courses: It serves as an excellent "transition" book for math majors or CS students who need to sharpen their logical rigor. Final Verdict

If you are looking for a flashy, modern textbook with hundreds of colored diagrams, this might not be your first choice. However, if you want a deep, intuitive, and rigorous understanding of the math that powers our digital world, Nicodemi’s text is a hidden gem. It focuses on the "why" as much as the "how," making it a timeless addition to any mathematician’s library.

Discrete Mathematics 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

The central theme of Nicodemi’s work is the study of mathematical structures that are fundamentally "discrete" rather than "continuous." While calculus deals with smooth curves and infinitesimal changes, Nicodemi focuses on distinct, separated values—the language of computer science and modern logic. Her text is designed to transition students from "computing" answers to "proving" statements. Key Areas of Focus The book systematically covers the pillars of the field:

Logic and Set Theory: Nicodemi begins with the building blocks of mathematical language. By mastering truth tables, quantifiers, and set operations, students learn to construct unambiguous arguments.

Combinatorics: She provides a deep dive into the art of counting. This section is vital for understanding probability and the complexity of algorithms, teaching students how to analyze possibilities within finite systems.

Graph Theory: Nicodemi explores the relationships between objects using vertices and edges. This has massive real-world applications, from social network analysis to optimizing GPS routing.

Mathematical Induction: A highlight of the text is her treatment of induction. She presents it not just as a technique, but as a powerful tool for verifying the properties of integers and recursive processes. Pedagogy and Style

What sets Nicodemi’s writing apart is its clarity and accessibility. Discrete mathematics can often feel like a disjointed series of topics, but she weaves them together with a narrative that emphasizes algorithmic thinking. Her exercises are carefully tiered, moving from basic computational practice to complex proofs that require genuine creative insight. Impact on Computer Science Olympia Nicodemi's " Discrete Mathematics: A Bridge to

For students of technology, Nicodemi’s text serves as a theoretical manual. The concepts of Boolean algebra, recurrence relations, and formal languages laid out in the book are the literal "DNA" of software engineering. Understanding these discrete structures is what allows a programmer to move beyond writing code to designing efficient, scalable systems. Conclusion

Olympia Nicodemi’s Discrete Mathematics is more than a textbook; it is a guide to thinking clearly. By focusing on the structures that underpin the digital age, it equips students with the logical tools necessary to tackle the complexities of both mathematics and computer science.

Discrete Mathematics: A Bridge to Computer Science and Advanced Mathematics

by Olympia Nicodemi is an introductory textbook designed to transition students from basic algebra and calculus to the abstract thinking required for computer science and higher-level mathematics. Originally published in 1987 by West Publishing Company, it remains a classic resource for its clear, crisp explanations and deep content. Google Books Key Educational Focus

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

The text delves into several foundational areas of discrete mathematics:

Bridging the Gap: Discrete Mathematics by Olympia Nicodemi Published in 1987 by West Publishing Company,

Discrete Mathematics: A Bridge to Computer Science and Advanced Mathematics Olympia Nicodemi

serves as a foundational text designed to transition students from traditional continuous mathematics into the logic-driven world of computer science. Core Philosophy and Structure

The textbook is structured to emphasize the interconnectedness of mathematical logic and its practical applications. Unlike continuous mathematics (which deals with real numbers and calculus), Nicodemi focuses on finite or countable sets, providing the theoretical underpinnings necessary for modern technology. The primary topics covered include: Logic and Proofs : Fundamental reasoning, premises, and conclusions. Set Theory and Relations

: The study of distinct collections of objects and how they interact. Functions and Graph Theory

: Critical for understanding data structures and network modeling. Combinatorics and Number Theory : Essential for probability and the foundations of cryptography Target Audience

The book is specifically written for undergraduate students. It serves two primary roles:

The Author: A Mathematician, Not a Curriculum Machine

Olympia Nicodemi is a Professor Emerita of Mathematics at the State University of New York (SUNY) College at Geneseo. Unlike modern textbook authors who are often hired by publishing houses to compile existing curricula, Nicodemi is a working mathematician and educator who wrote her book based on how she actually taught the course.

Her background is in algebra and number theory, and that DNA is woven throughout the text. She is famously known for her Socratic teaching style—answering questions with questions, pushing students to discover structure rather than memorize it. The textbook reads exactly like a Nicodemi lecture: clear, patient, but relentlessly logical.

5. Comparative Strengths and Weaknesses

Strengths:

• Clarity: The explanations are less terse than many standard texts (e.g., Grimaldi or Biggs), making it more approachable for students with varying backgrounds.
• Pacing: The pacing is deliberate, ensuring students master the foundations of logic before attempting complex proofs.
• Proof Focus: The text prioritizes the process of proving over rote memorization of facts, which benefits students in subsequent upper-division courses.

Weaknesses:

• Breadth of Application: Compared to Kenneth Rosen’s standard text, Nicodemi’s book includes fewer explicit examples of industrial or software engineering applications. It leans more toward pure mathematics applied to CS foundations.
• Supplementary Materials: In the educational market, this text sometimes lacks the vast ecosystem of online homework platforms, algorithm simulators, and test banks that accompany competitor textbooks.
• Depth: Some advanced topics, such as recurrence relations or formal languages/automata, may be covered with less depth than required by a very rigorous CS curriculum.

Notable Editions and Availability

• First Edition (1987, Macmillan) – Out of print, but found in university library reserve collections. Contains some outdated notation (e.g., using ⊃ for implication).
• Second Edition (1999, Franklin, Beedle & Associates) – The most widely used. Cleaner typography, updated exercises, and corrected errors from the first edition.
• Third Edition (circa 2010, self-published via Lulu?) – Rumored but difficult to find. Some instructors report using a "custom edition" for their courses.

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.

1. The Historical Narrative

Unlike most textbooks that sanitize history, Nicodemi integrates the people and problems that gave birth to discrete mathematics. She discusses Euler’s solution to the Königsberg bridge problem not as a historical footnote, but as a case study in mathematical modeling. She talks about Boolean algebra through the lens of George Boole’s original logic, not just as a truth table shortcut for computer science majors. This narrative approach grounds abstract concepts in human curiosity.

Comparison to Popular Alternatives

| Book | Focus | Proof Emphasis | Applications | Readability | |------|-------|----------------|--------------|--------------| | Nicodemi | Conceptual / Proof | High | Low | Very high | | Rosen | Comprehensive / Applied | Medium | High | Medium | | Epp | Balanced | Medium-High | Medium | High | | Hammack (Book of Proof) | Pure proof intro | Very high | None | High | The Author: A Mathematician, Not a Curriculum Machine

Nicodemi sits between Hammack (pure proof) and Epp (balanced). It’s more applied than Hammack but less than Epp.

1. Logic and Proofs

The book starts at the very beginning: logic. It covers truth tables, logical equivalences, and the rules of inference. Crucially, it introduces various proof techniques (direct, contrapositive, contradiction, and induction) in a way that feels like a natural progression rather than a sudden jump.

A Quiet Classic

Discrete Mathematics does not scream for attention. There are no celebrity authors, no flashy online portals. Instead, it has built a cult following among professors who believe that mathematics is, first and foremost, a discipline of reason. Olympia Nicodemi has written a book that respects the subject’s ancient roots—the logic of Aristotle, the combinatorics of Pascal, the graphs of Euler—while preparing students for the discrete digital age.

In a world of noise, this book is a signal. In a world of continuous distraction, it offers discrete, crystalline truths.

To study from Nicodemi’s Discrete Mathematics is to learn that math is not about speed. It is about certainty. And that is a feature worth celebrating.

Olympia Nicodemi’s approach to Discrete Mathematics is famously framed as a "bridge". While a standard textbook might feel like a collection of abstract puzzles, her work—specifically

—is designed to help students transition from the "how-to" of calculus to the "why" of higher-level logic and computing.  The Core Story: Building the Bridge 

The "helpful story" of her work is centered on mathematical maturity. In many math paths, students hit a wall when they move from solving equations to writing formal proofs. Nicodemi’s text acts as a mentor through this transition by focusing on: 

Logic and Proofs: Instead of just memorizing rules, students learn the "grammar" of mathematics—truth tables, DeMorgan's Law, and predicate calculus—to build airtight arguments.

Counting and Combinatorics: She illustrates how simple counting principles (like the Pigeonhole Principle or permutations) are actually the engines behind complex computer algorithms.

Graph Theory: Her approach shows how physical networks, like computer wiring or social connections, can be modeled and optimized using discrete structures. 

Here’s a detailed review of "Discrete Mathematics" by Olympia Nicodemi based on its content, style, and typical reception among students and instructors.

3. Content and Structure Overview

The textbook follows a standard but carefully curated progression designed to build mathematical maturity incrementally.

3.1. Logic and Sets The book begins with the fundamentals of logic (propositional and predicate logic) and set theory. Nicodemi excels here by introducing formal logic not merely as an abstract concept, but as a tool for constructing valid arguments. The transition from logic to set theory is seamless, utilizing the logical structures previously established to define set operations.

3.2. Proof Techniques Perhaps the most critical section of the text, the chapters on proof techniques are handled with exceptional clarity. The text breaks down direct proofs, proof by contradiction, and mathematical induction into manageable steps. The section on induction—often a stumbling block for students—is particularly noteworthy for its use of intuitive examples (such as the Tower of Hanoi or summation formulas) before moving to rigorous formalism.

3.3. Relations and Functions The text provides a rigorous treatment of relations and functions, essential for database theory and programming language semantics. It covers equivalence relations, partial orders, and bijections with a balance of graphical representation (digraphs) and algebraic definition.

3.4. Combinatorics and Graph Theory The latter half of the book covers counting techniques, permutations, and combinations. The graph theory section covers essential definitions, paths, circuits, and trees. While not as exhaustive as specialized graph theory texts, it provides sufficient depth for computer science applications, such as network modeling and sorting algorithms.

3.5. Discrete Probability and Algebraic Structures Depending on the edition, the text also touches upon discrete probability and an introduction to algebraic systems (groups, semigroups), rounding out the necessary theoretical background for advanced CS coursework.