Discrete Mathematics By Olympia Nicodemi Review

Recommended for anyone who wants to learn to think mathematically rather than just compute answers. If your goal is to master proofs, understand the structure of discrete objects, and enjoy the process, Nicodemi’s book is a hidden gem. However, if you need a reference for programming interviews or applied combinatorics, pair it with a more computational supplement.

Bottom line: A thoughtful, student-friendly text that prioritizes mathematical maturity over breadth. Not for everyone, but excellent for its intended audience.

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

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 by Olympia Nicodemi: A Comprehensive Guide

In the landscape of higher mathematics, finding a textbook that balances rigorous theory with approachable pedagogy is a rare feat. Discrete Mathematics by Olympia Nicodemi stands as a cornerstone for students and educators alike who are navigating the transition from computational calculus to the abstract world of discrete structures.

Whether you are a computer science major, a future mathematician, or an enthusiast of logical puzzles, Nicodemi’s work offers a clear roadmap through some of the most vital concepts in modern science. Who is Olympia Nicodemi?

Olympia Nicodemi is a distinguished professor of mathematics at SUNY Geneseo, known for her commitment to mathematical education and her ability to make complex topics accessible. Her approach in Discrete Mathematics reflects years of classroom experience, prioritizing student comprehension and the development of proof-writing skills. Core Themes and Coverage

The book is designed to provide a solid foundation in the "mathematics of the finite." Unlike calculus, which deals with continuous change, discrete mathematics focuses on distinct, separated values. Nicodemi covers several essential pillars: 1. Logic and Proofs Discrete Mathematics by Olympia Nicodemi

The journey begins with the language of mathematics. Nicodemi introduces propositional logic, quantifiers, and the rules of inference. The real strength here is the focus on mathematical induction and direct/indirect proofs, teaching students not just how to find an answer, but how to argue that the answer is correct. 2. Set Theory and Relations

Understanding how objects group together and interact is fundamental to computer science. The text explores sets, functions, and relations (including equivalence relations and partial orderings), which are the building blocks for database theory and algorithm design. 3. Combinatorics (The Art of Counting)

From basic permutations to complex combinations, Nicodemi breaks down counting principles. This section is vital for understanding probability and the complexity of algorithms. 4. Graph Theory

Graphs are used to model everything from social networks to neural pathways. Nicodemi provides a lucid introduction to vertices, edges, paths, circuits, and trees, ensuring students can visualize and manipulate these structures effectively. 5. Algebraic Structures

For those moving toward abstract algebra, the book introduces concepts like Boolean algebra, which is the mathematical backbone of digital logic and computer circuitry. Why Choose This Text? Pedagogy First

Nicodemi’s writing style is often described as "conversational yet precise." She avoids the "definition-theorem-proof" fatigue by providing ample examples that ground abstract ideas in reality. Clarity in Proof Writing

One of the biggest hurdles for students is learning how to write proofs. This textbook acts as a mentor, guiding the reader through the logic of construction, helping them move from "knowing" a fact to "proving" it. Bridge to Computer Science

While it is a math book at its heart, the applications to computer science—such as algorithm analysis and logic gates—make it an invaluable resource for CS students who need to understand the "why" behind the code. Final Thoughts

Discrete Mathematics by Olympia Nicodemi is more than just a collection of formulas; it is a training manual for logical thinking. In an age dominated by digital data and complex algorithms, the ability to think discretely is a superpower. Nicodemi provides the tools to build that power, one logic gate and one proof at a time.

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

(1987) is a foundational textbook designed to transition students from continuous mathematics (like calculus) to the discrete structures essential for computing and higher-level math. Core Focus and Purpose

The book serves as a "bridge" primarily for computer science students, emphasizing logic and the discrete entities (like integers) that form the basis of digital systems, rather than the continuous real-number line. It is frequently recommended in university syllabi for courses such as Bachelor of Computer Applications (BCA) and other computer science degrees. Key Topics Covered

Based on its academic usage and standard structure, the text typically covers: Propositions, truth tables, and logical equivalence. Set Theory: Notations, subsets, Venn diagrams, and operations. Relations and Functions:

Cartesian products, domain/range, and types of functions (one-to-one, onto). Graph Theory: Definitions of graphs, isomorphism, and connectivity. Binary trees, spanning trees, and fundamental circuits. Combinatorics: Counting principles and elementary algebra. Applications and Practicality

Nicodemi’s approach highlights how these mathematical concepts apply to real-world technology: Recommended for anyone who wants to learn to

"Discrete Mathematics: A Bridge to Computer Science and Advanced Mathematics" by Olympia Nicodemi, published in 1987, serves as a foundational text bridging calculus and higher-level mathematics. The 491-page book covers essential topics such as logic, set theory, graph theory, and mathematical induction for computer science students. The book is available for digital loan through the Internet Archive and the Open Library.

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. 

Discrete Mathematics: A Bridge to Computer Science and Advanced Mathematics

by Olympia Nicodemi is a foundational textbook designed to introduce students to the non-continuous mathematical structures essential for modern computing and higher-level math. Overview and Purpose

Originally published in 1987 by West Publishing Co., this text serves as a "bridge" for first- or second-year undergraduate students. It is specifically crafted for a one-semester course, helping students transition from the continuous mathematics of calculus to the discrete reasoning required in computer science. Key Core Topics

The book covers several critical areas of discrete mathematics, emphasizing both theoretical understanding and practical application: Mathematical Reasoning:

Developing skills in deduction, formal proof, and recursive thinking. Combinatorics: Studying counting, permutations, and combinations. Graph Theory:

Exploring networks and the relationships between discrete objects. Boolean Algebra: Foundations for digital logic and computer arithmetic. Logic and Sets:

Fundamental concepts like propositional logic, set theory, and functions. Target Audience & Prerequisites The textbook follows a standard but carefully curated

Primary audience includes computer science and mathematics majors. Prerequisites:

Students typically need at least one semester of calculus and familiarity with a high-level computer programming language to fully engage with the material.

Reviewers have noted the book's "crisp and clear" delivery of deep content, making it a classic choice for foundational study.

You can find digital versions or physical copies through retailers like or borrow it from the Internet Archive If you're studying for a specific course, would you like a summary of a particular chapter solving a practice problem from the book?

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.

Before diving into the content, it is important to understand the audience. Discrete math can be intimidating. It requires a shift in thinking from the continuous calculus many of us learned in high school to the distinct, logical world of sets and integers.

Nicodemi’s book is specifically designed to be accessible. It is often used in introductory courses for students who may not yet be math majors but need a solid grounding in the concepts. If you have ever felt overwhelmed by the dense, encyclopedic tomes usually assigned in CS programs, this book comes as a breath of fresh air.

The first thing a student notices is the lack of hand-holding. In an era of math textbooks bloated with sidebars, glossy photos of engineers, and QR codes linking to video tutorials, Nicodemi’s Discrete Mathematics is almost austere. The prose is precise, lean, and mercilessly clear.

But clarity is not the same as ease.

Nicodemi commits a radical act: She assumes her reader is intelligent. She does not talk down. She does not offer "math made easy" gimmicks. Instead, she offers rigor. The book is famous (or infamous, depending on your constitution) for its proof-heavy approach. Before you touch combinatorics or graph theory, you will live inside truth tables, predicates, and quantifiers. You will learn what it means to prove something by contradiction not as a trick, but as a necessity.

A typical Nicodemi exercise doesn’t ask, "Compute X." It asks, "Is the following statement true? Defend your answer." The difference is everything. Computation is clerical. Defense is intellectual.