Nicodemi: Discrete Mathematics By Olympia

Olympia Nicodemi’s Discrete Mathematics remains a relevant and valuable contribution to mathematics education. It successfully demystifies the transition from computational calculus to abstract algebra and logic. By prioritizing clarity, logical flow, and the art of the proof, the text ensures that students are well-prepared for the rigors of upper-division computer science and mathematics. While it may not be the most exhaustive reference on the market, it is undoubtedly one of the most effective teaching instruments available for introductory discrete mathematics.

Discrete Mathematics by Olympia Nicodemi (published in 1987) is often regarded as a classic introductory text, specifically noted for its clarity and accessibility for students transitioning into higher-level computer science or mathematics. While it is older, it remains a cited reference in various academic syllabi for computer applications (BCA). Key Features & Content

The book is structured to bridge the gap between basic algebra and more advanced mathematical structures. Based on library archives and academic listings, its core strengths include:

Logic and Set Theory: A strong foundation in propositional calculus, truth tables, and the principles of sets.

Graph Theory: Comprehensive coverage that is frequently used as a primary reference for computer science students.

Algorithms: Introduction to algorithm complexity and growth rates, which are essential for software development.

Proof Techniques: Focused instruction on mathematical induction and other standard proof methods. General Reception

Readability: Readers on platforms like Goodreads generally rate it around 3.25 to 3.3 stars, noting its straightforward prose.

Educational Utility: It is a recurring recommended textbook in Indian university curricula (such as Sant Gadge Baba Amravati University) for its alignment with fundamental discrete structures.

Limitations: Because it was published in the late 1980s, it lacks contemporary examples related to modern fields like machine learning or advanced cryptography, though the underlying mathematical principles remain valid.

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

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 Discrete Mathematics by Olympia Nicodemi

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.

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, 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.

In the vast landscape of undergraduate math textbooks, many volumes on discrete mathematics read like encyclopedias: dense, dry, and dizzying with sidebars. Then there is the quiet exception—Olympia Nicodemi’s Discrete Mathematics: A Bridge to Proofs and Beyond (commonly referred to simply as Discrete Mathematics by Nicodemi).

Published as part of the "A Bridge to Proofs" tradition, this text stands apart not for what it covers, but for how it speaks to the reader.

A Conversational Bridge

Most students first encounter discrete math as a shock—a sudden departure from the continuous calculus they know. Nicodemi understands this. Her writing is famously unhurried and conversational, as if she is sitting next to the student, asking, “Does that make sense?” She avoids the sterile “Definition-Theorem-Proof” march. Instead, she builds concepts from natural questions: How do we count without counting? What does it mean for a statement to be true? Why does a proof by induction actually work?

The book’s subtitle says it all: this is a bridge. It assumes no prior proof-writing experience. In early chapters, logic and set theory are introduced not as abstract rituals, but as the grammar of mathematical thought. In the vast landscape of undergraduate math textbooks,

Structure and Soul

The table of contents follows a classic arc:

But within that familiar structure, Nicodemi embeds a rare feature: narrative. Each chapter opens with a problem or a puzzle that feels accessible. She teaches proof by showing how a flawed proof fails—and why that failure illuminates the correct logic.

The exercises are another highlight. They are not endless, repetitive drills. Many are short proofs, some are counterexample hunts, and a few are genuine mini-research puzzles. The difficulty ramps slowly, but steadily. By the end, a student who began unsure how to prove “If n is even, then n² is even” can handle basic graph theory proofs and combinatorial identities.

For Whom?

This book is ideal for:

It is not 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.

The Quiet Legacy

Olympia Nicodemi is a retired professor from SUNY Geneseo, and her book carries the hallmarks of a master teacher who has watched hundreds of students struggle—and succeed. There is no ego in the prose. There are no flashy graphics or gimmicks. Just clear, patient, beautiful mathematical exposition.

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.

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.

Final verdict: A perfect first proof book. Gentle without being soft. Rigorous without being cruel. Highly recommended for the anxious beginner and the jaded instructor alike.

Discrete Mathematics by Olympia Nicodemi: A Comprehensive Guide

Discrete mathematics is a branch of mathematics that deals with mathematical structures that are fundamentally discrete, meaning they are made up of distinct, individual elements rather than continuous values. This field of study has gained significant importance in recent years due to its applications in computer science, information technology, and other areas. One of the leading authors in this field is Olympia Nicodemi, who has written extensively on discrete mathematics. In this article, we will explore Nicodemi's work on discrete mathematics, its significance, and the key concepts covered in her book.

Introduction to Discrete Mathematics

Discrete mathematics is a broad field that encompasses various branches of mathematics, including graph theory, combinatorics, number theory, and algebra. It provides a mathematical framework for solving problems that involve discrete structures, such as networks, graphs, and sets. Discrete mathematics has numerous applications in computer science, including algorithm design, data analysis, and software development.

Olympia Nicodemi's Contributions to Discrete Mathematics

Olympia Nicodemi is a renowned mathematician and author who has made significant contributions to the field of discrete mathematics. Her work focuses on making discrete mathematics accessible to students and researchers. Nicodemi's book, "Discrete Mathematics," is a comprehensive textbook that covers a wide range of topics in discrete mathematics. But within that familiar structure, Nicodemi embeds a

Overview of the Book: Discrete Mathematics by Olympia Nicodemi

The book "Discrete Mathematics" by Olympia Nicodemi is a thorough introduction to the field of discrete mathematics. The book covers various topics, including:

Key Features of the Book

The book "Discrete Mathematics" by Olympia Nicodemi has several key features that make it an excellent textbook for students and researchers:

Significance of Discrete Mathematics

Discrete mathematics has numerous applications in various fields, including:

Conclusion

In conclusion, Olympia Nicodemi's book "Discrete Mathematics" is a comprehensive textbook that provides a thorough introduction to the field of discrete mathematics. The book covers various topics, including set theory, logic and proof, combinatorics, graph theory, and number theory. The book's clear explanations, numerous examples, and exercises make it an excellent resource for students and researchers. Discrete mathematics has numerous applications in computer science, information technology, and data analysis, making it a significant field of study. Nicodemi's work on discrete mathematics has made it accessible to a wide range of readers, and her book is an essential resource for anyone interested in this field.

References

Further Reading

For readers interested in learning more about discrete mathematics, here are some recommended resources:

By exploring these resources, readers can gain a deeper understanding of discrete mathematics and its applications.

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

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.

Most discrete math textbooks follow a predictable formula: Chapter 1 (Logic), Chapter 2 (Set Theory), Chapter 3 (Functions), Chapter 4 (Algorithms), etc. Nicodemi follows a similar table of contents superficially, but the soul of the book is different.

Her central philosophy can be boiled down to: "You do not understand a piece of mathematics until you can prove it."

Where other books might present the Pigeonhole Principle as a simple formula followed by ten computational exercises, Nicodemi pauses. She asks: Why does this work? Can you construct a counterexample? The book is notoriously light on "plug-and-chug" exercises and heavy on proofs, generalizations, and open-ended problems.