Discrete Mathematics By Olympia Nicodemi =link= May 2026

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.

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

: 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:

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 (published in 1987)

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

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. The Author: A Mathematician, Not a Curriculum Machine

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.

Olympia Nicodemi’s "Discrete Mathematics: A Bridge to Computer Science and Advanced Mathematics" (1987) is designed to transition university students from calculus to rigorous, proof-based mathematical reasoning. The text emphasizes structural clarity and recursive thinking, covering foundational areas such as combinatorics, graph theory, and Boolean arithmetic. Learn more about the text at books.google.com. A Bridge to Computer Science and Advanced Mathematics

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.

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.

✅ Ideal Readers:

• Mathematics Majors minoring in computer science. This book builds proof-writing muscles essential for real analysis and abstract algebra.
• Honors Discrete Math courses at liberal arts colleges or universities with a theoretical bent.
• Self-learners with patience. If you are studying alone and want to truly understand discrete math rather than pass a standardized exam (like the GRE Subject Test in Math), this book is a treasure.
• Instructors tired of standard textbooks. Many professors use Nicodemi as a supplementary text, assigning her proof exercises alongside a more algorithmic main text.

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.

❌ Who Might Struggle:

• Computer Science undergraduates looking for an algorithms/data structures primer. This book contains almost no runtime analysis (Big-O), minimal pseudocode, and no programming exercises.
• Students with weak high school algebra experience. Nicodemi assumes you can factor polynomials, manipulate inequalities, and understand basic functions without hand-holding.
• Anyone who wants an answer key. While some editions include answers to odd-numbered problems, the solutions are often terse ("Proof by induction" without details). There is no fully worked solutions manual widely available.

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.

3. A Gentle but Firm Introduction to Proof Writing

The book contains one of the best slow introductions to proof writing available. She begins with propositional logic and truth tables, then moves to direct proof, proof by contradiction, and finally induction. Each proof is broken down into motive, plan, execution, and reflection. She includes "common pitfalls" boxes—small asides where she explicitly names the errors students make (e.g., "assuming what you are trying to prove," "misplacing parentheses in logical statements").

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.