| Display Name | Sessions Completed | Antibiotics | Circulation | Massive Bleeding | Details |
|---|
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 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 Discrete Mathematics by Olympia Nicodemi
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 (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. Discrete Mathematics by Olympia Nicodemi is often regarded
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: 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: 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
Primary audience includes computer science and mathematics majors. Prerequisites: Sample Quote (Paraphrased from Chapter on Induction)
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?
“Induction is not a trick. It is a recognition that if we can climb onto the first rung and if we can always move from one rung to the next, then we can climb the whole ladder. The formality of the proof merely makes this intuition precise.”
This illustrates her approachable, metaphor-rich style.
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.
Strengths:
Weaknesses:
Olympia Nicodemi’s Discrete Mathematics is not for everyone. It lacks the glossy, four-color diagrams, the online homework portals, and the endless algorithmic drills that define the modern textbook market. It will not hold your hand, and it will occasionally leave you frustrated at 1 AM, staring at a single proof by contradiction.
But for the student who wants to understand—really understand—what discrete mathematics is, why it works, and how to build new mathematics from old ideas, this book is a gift. It treats the reader not as a consumer of mathematical facts, but as a participant in mathematical thought.
In an era where education is increasingly transactional ("I paid tuition, now give me the skills"), Nicodemi’s book stands defiantly as a piece of bildung—a formation of the mind. If you find a copy, treasure it. Work through it slowly. And when you finally prove that generalization about Fibonacci numbers on your own, you will understand why a small group of mathematicians and educators still whisper the name Olympia Nicodemi with genuine reverence.
Have you used Olympia Nicodemi’s Discrete Mathematics in your studies or teaching? Share your experience (or your favorite exercise from the text) in the discussion below.
REPORT: TEXTBOOK REVIEW AND ANALYSIS
Title: Discrete Mathematics Author: Olympia Nicodemi (with Margaret A. Winters) Subject Area: Computer Science & Mathematics Education Date: October 26, 2023
Many discrete math books relegate recursion to a single section, often as a prelude to induction. Nicodemi makes recursion a recurring theme from the very first chapters. She uses recursive definitions not as a programming trick but as a fundamental way to define mathematical objects (strings, trees, sequences). By the time the student reaches induction, it feels like a natural extension of recursive thinking, not a magical leap.
This application is in Beta access and is pending AMEDD certification.